TSTP Solution File: GRP012+5 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : GRP012+5 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 09:44:13 EDT 2022
% Result : Theorem 2.42s 2.62s
% Output : CNFRefutation 2.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 102 ( 67 unt; 0 def)
% Number of atoms : 219 ( 0 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 209 ( 92 ~; 78 |; 31 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 242 ( 0 sgn 64 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0,conjecture,
! [X1] :
( ( ! [X2,X3] :
? [X4] : product(X2,X3,X4)
& ! [X2,X3,X4,X5,X6,X7] :
( ( product(X2,X3,X5)
& product(X3,X4,X6)
& product(X5,X4,X7) )
=> product(X2,X6,X7) )
& ! [X2,X3,X4,X5,X6,X7] :
( ( product(X2,X3,X5)
& product(X3,X4,X6)
& product(X2,X6,X7) )
=> product(X5,X4,X7) )
& ! [X2] : product(X2,X1,X2)
& ! [X2] : product(X1,X2,X2)
& ! [X2] : product(X2,inverse(X2),X1)
& ! [X2] : product(inverse(X2),X2,X1) )
=> ! [X5,X6,X7,X2] :
( ( product(inverse(X5),inverse(X6),X7)
& product(X6,X5,X2) )
=> product(inverse(X7),inverse(X2),X1) ) ),
file('<stdin>',prove_distribution) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ( ! [X2,X3] :
? [X4] : product(X2,X3,X4)
& ! [X2,X3,X4,X5,X6,X7] :
( ( product(X2,X3,X5)
& product(X3,X4,X6)
& product(X5,X4,X7) )
=> product(X2,X6,X7) )
& ! [X2,X3,X4,X5,X6,X7] :
( ( product(X2,X3,X5)
& product(X3,X4,X6)
& product(X2,X6,X7) )
=> product(X5,X4,X7) )
& ! [X2] : product(X2,X1,X2)
& ! [X2] : product(X1,X2,X2)
& ! [X2] : product(X2,inverse(X2),X1)
& ! [X2] : product(inverse(X2),X2,X1) )
=> ! [X5,X6,X7,X2] :
( ( product(inverse(X5),inverse(X6),X7)
& product(X6,X5,X2) )
=> product(inverse(X7),inverse(X2),X1) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2,negated_conjecture,
! [X9,X10,X12,X13,X14,X15,X16,X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27] :
( product(X9,X10,esk2_2(X9,X10))
& ( ~ product(X12,X13,X15)
| ~ product(X13,X14,X16)
| ~ product(X15,X14,X17)
| product(X12,X16,X17) )
& ( ~ product(X18,X19,X21)
| ~ product(X19,X20,X22)
| ~ product(X18,X22,X23)
| product(X21,X20,X23) )
& product(X24,esk1_0,X24)
& product(esk1_0,X25,X25)
& product(X26,inverse(X26),esk1_0)
& product(inverse(X27),X27,esk1_0)
& product(inverse(esk3_0),inverse(esk4_0),esk5_0)
& product(esk4_0,esk3_0,esk6_0)
& ~ product(inverse(esk5_0),inverse(esk6_0),esk1_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X5,X2)
| ~ product(X1,X6,X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X5)
| ~ product(X4,X6,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
~ product(inverse(esk5_0),inverse(esk6_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
product(X1,X2,esk2_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
product(X1,inverse(X1),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
product(inverse(X1),X1,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
product(inverse(esk3_0),inverse(esk4_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
product(X1,esk1_0,X1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
product(esk1_0,X1,X1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
product(esk4_0,esk3_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X5,X2)
| ~ product(X1,X6,X4) ),
c_0_3,
[final] ).
cnf(c_0_14,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X5)
| ~ product(X4,X6,X1) ),
c_0_4,
[final] ).
cnf(c_0_15,negated_conjecture,
~ product(inverse(esk5_0),inverse(esk6_0),esk1_0),
c_0_5,
[final] ).
cnf(c_0_16,negated_conjecture,
product(X1,X2,esk2_2(X1,X2)),
c_0_6,
[final] ).
cnf(c_0_17,negated_conjecture,
product(X1,inverse(X1),esk1_0),
c_0_7,
[final] ).
cnf(c_0_18,negated_conjecture,
product(inverse(X1),X1,esk1_0),
c_0_8,
[final] ).
cnf(c_0_19,negated_conjecture,
product(inverse(esk3_0),inverse(esk4_0),esk5_0),
c_0_9,
[final] ).
cnf(c_0_20,negated_conjecture,
product(X1,esk1_0,X1),
c_0_10,
[final] ).
cnf(c_0_21,negated_conjecture,
product(esk1_0,X1,X1),
c_0_11,
[final] ).
cnf(c_0_22,negated_conjecture,
product(esk4_0,esk3_0,esk6_0),
c_0_12,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_0,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X3,X4)
| ~ product(X2,X3,X5)
| product(X0,X4,X5) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94997e.p',c_0_13) ).
cnf(c_14,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X3,X4)
| ~ product(X2,X3,X5)
| product(X0,X4,X5) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_54,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X3,X4)
| ~ product(X2,X3,X5)
| product(X0,X4,X5) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_73,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X3,X4)
| ~ product(X2,X3,X5)
| product(X0,X4,X5) ),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_74,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X3,X4)
| ~ product(X2,X3,X5)
| product(X0,X4,X5) ),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_94,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X3,X4)
| ~ product(X2,X3,X5)
| product(X0,X4,X5) ),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_8,negated_conjecture,
product(sk3_esk1_0,X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94997e.p',c_0_21) ).
cnf(c_30,negated_conjecture,
product(sk3_esk1_0,X0,X0),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_62,negated_conjecture,
product(sk3_esk1_0,X0,X0),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_65,negated_conjecture,
product(sk3_esk1_0,X0,X0),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_82,negated_conjecture,
product(sk3_esk1_0,X0,X0),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_110,plain,
product(sk3_esk1_0,X0,X0),
inference(copy,[status(esa)],[c_82]) ).
cnf(c_148,plain,
( ~ product(X0,X1,sk3_esk1_0)
| ~ product(X1,X2,X3)
| product(X0,X3,X2) ),
inference(resolution,[status(thm)],[c_94,c_110]) ).
cnf(c_149,plain,
( ~ product(X0,X1,sk3_esk1_0)
| ~ product(X1,X2,X3)
| product(X0,X3,X2) ),
inference(rewriting,[status(thm)],[c_148]) ).
cnf(c_4,negated_conjecture,
product(X0,inverse(X0),sk3_esk1_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94997e.p',c_0_17) ).
cnf(c_22,negated_conjecture,
product(X0,inverse(X0),sk3_esk1_0),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_58,negated_conjecture,
product(X0,inverse(X0),sk3_esk1_0),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_69,negated_conjecture,
product(X0,inverse(X0),sk3_esk1_0),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_78,negated_conjecture,
product(X0,inverse(X0),sk3_esk1_0),
inference(copy,[status(esa)],[c_69]) ).
cnf(c_102,plain,
product(X0,inverse(X0),sk3_esk1_0),
inference(copy,[status(esa)],[c_78]) ).
cnf(c_232,plain,
( product(X0,sk3_esk1_0,inverse(X1))
| ~ product(X0,X1,sk3_esk1_0) ),
inference(resolution,[status(thm)],[c_149,c_102]) ).
cnf(c_233,plain,
( product(X0,sk3_esk1_0,inverse(X1))
| ~ product(X0,X1,sk3_esk1_0) ),
inference(rewriting,[status(thm)],[c_232]) ).
cnf(c_7,negated_conjecture,
product(X0,sk3_esk1_0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94997e.p',c_0_20) ).
cnf(c_28,negated_conjecture,
product(X0,sk3_esk1_0,X0),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_61,negated_conjecture,
product(X0,sk3_esk1_0,X0),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_66,negated_conjecture,
product(X0,sk3_esk1_0,X0),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_81,negated_conjecture,
product(X0,sk3_esk1_0,X0),
inference(copy,[status(esa)],[c_66]) ).
cnf(c_108,plain,
product(X0,sk3_esk1_0,X0),
inference(copy,[status(esa)],[c_81]) ).
cnf(c_146,plain,
( ~ product(X0,sk3_esk1_0,X1)
| ~ product(X2,X0,X3)
| product(X2,X1,X3) ),
inference(resolution,[status(thm)],[c_94,c_108]) ).
cnf(c_147,plain,
( ~ product(X0,sk3_esk1_0,X1)
| ~ product(X2,X0,X3)
| product(X2,X1,X3) ),
inference(rewriting,[status(thm)],[c_146]) ).
cnf(c_5,negated_conjecture,
product(inverse(X0),X0,sk3_esk1_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94997e.p',c_0_18) ).
cnf(c_24,negated_conjecture,
product(inverse(X0),X0,sk3_esk1_0),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_59,negated_conjecture,
product(inverse(X0),X0,sk3_esk1_0),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_68,negated_conjecture,
product(inverse(X0),X0,sk3_esk1_0),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_79,negated_conjecture,
product(inverse(X0),X0,sk3_esk1_0),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_104,plain,
product(inverse(X0),X0,sk3_esk1_0),
inference(copy,[status(esa)],[c_79]) ).
cnf(c_184,plain,
( product(inverse(X0),X1,sk3_esk1_0)
| ~ product(X0,sk3_esk1_0,X1) ),
inference(resolution,[status(thm)],[c_147,c_104]) ).
cnf(c_185,plain,
( product(inverse(X0),X1,sk3_esk1_0)
| ~ product(X0,sk3_esk1_0,X1) ),
inference(rewriting,[status(thm)],[c_184]) ).
cnf(c_2,negated_conjecture,
~ product(inverse(sk3_esk5_0),inverse(sk3_esk6_0),sk3_esk1_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94997e.p',c_0_15) ).
cnf(c_18,negated_conjecture,
~ product(inverse(sk3_esk5_0),inverse(sk3_esk6_0),sk3_esk1_0),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_56,negated_conjecture,
~ product(inverse(sk3_esk5_0),inverse(sk3_esk6_0),sk3_esk1_0),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_71,negated_conjecture,
~ product(inverse(sk3_esk5_0),inverse(sk3_esk6_0),sk3_esk1_0),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_76,negated_conjecture,
~ product(inverse(sk3_esk5_0),inverse(sk3_esk6_0),sk3_esk1_0),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_98,negated_conjecture,
~ product(inverse(sk3_esk5_0),inverse(sk3_esk6_0),sk3_esk1_0),
inference(copy,[status(esa)],[c_76]) ).
cnf(c_804,plain,
~ product(sk3_esk5_0,sk3_esk1_0,inverse(sk3_esk6_0)),
inference(resolution,[status(thm)],[c_185,c_98]) ).
cnf(c_805,plain,
~ product(sk3_esk5_0,sk3_esk1_0,inverse(sk3_esk6_0)),
inference(rewriting,[status(thm)],[c_804]) ).
cnf(c_870,plain,
~ product(sk3_esk5_0,sk3_esk6_0,sk3_esk1_0),
inference(resolution,[status(thm)],[c_233,c_805]) ).
cnf(c_871,plain,
~ product(sk3_esk5_0,sk3_esk6_0,sk3_esk1_0),
inference(rewriting,[status(thm)],[c_870]) ).
cnf(c_1,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X3,X4)
| ~ product(X0,X4,X5)
| product(X2,X3,X5) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94997e.p',c_0_14) ).
cnf(c_16,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X3,X4)
| ~ product(X0,X4,X5)
| product(X2,X3,X5) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_55,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X3,X4)
| ~ product(X0,X4,X5)
| product(X2,X3,X5) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_72,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X3,X4)
| ~ product(X0,X4,X5)
| product(X2,X3,X5) ),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_75,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X3,X4)
| ~ product(X0,X4,X5)
| product(X2,X3,X5) ),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_96,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X3,X4)
| ~ product(X0,X4,X5)
| product(X2,X3,X5) ),
inference(copy,[status(esa)],[c_75]) ).
cnf(c_168,plain,
( ~ product(X0,X1,sk3_esk1_0)
| ~ product(X2,X0,X3)
| product(X3,X1,X2) ),
inference(resolution,[status(thm)],[c_96,c_108]) ).
cnf(c_169,plain,
( ~ product(X0,X1,sk3_esk1_0)
| ~ product(X2,X0,X3)
| product(X3,X1,X2) ),
inference(rewriting,[status(thm)],[c_168]) ).
cnf(c_6,negated_conjecture,
product(inverse(sk3_esk3_0),inverse(sk3_esk4_0),sk3_esk5_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94997e.p',c_0_19) ).
cnf(c_26,negated_conjecture,
product(inverse(sk3_esk3_0),inverse(sk3_esk4_0),sk3_esk5_0),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_60,negated_conjecture,
product(inverse(sk3_esk3_0),inverse(sk3_esk4_0),sk3_esk5_0),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_67,negated_conjecture,
product(inverse(sk3_esk3_0),inverse(sk3_esk4_0),sk3_esk5_0),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_80,negated_conjecture,
product(inverse(sk3_esk3_0),inverse(sk3_esk4_0),sk3_esk5_0),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_106,plain,
product(inverse(sk3_esk3_0),inverse(sk3_esk4_0),sk3_esk5_0),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_270,plain,
( product(sk3_esk5_0,X0,inverse(sk3_esk3_0))
| ~ product(inverse(sk3_esk4_0),X0,sk3_esk1_0) ),
inference(resolution,[status(thm)],[c_169,c_106]) ).
cnf(c_271,plain,
( product(sk3_esk5_0,X0,inverse(sk3_esk3_0))
| ~ product(inverse(sk3_esk4_0),X0,sk3_esk1_0) ),
inference(rewriting,[status(thm)],[c_270]) ).
cnf(c_1840,plain,
product(sk3_esk5_0,sk3_esk4_0,inverse(sk3_esk3_0)),
inference(resolution,[status(thm)],[c_271,c_104]) ).
cnf(c_1841,plain,
product(sk3_esk5_0,sk3_esk4_0,inverse(sk3_esk3_0)),
inference(rewriting,[status(thm)],[c_1840]) ).
cnf(c_142,plain,
( ~ product(X0,X1,inverse(X2))
| product(X0,X3,sk3_esk1_0)
| ~ product(X1,X2,X3) ),
inference(resolution,[status(thm)],[c_94,c_104]) ).
cnf(c_143,plain,
( ~ product(X0,X1,inverse(X2))
| product(X0,X3,sk3_esk1_0)
| ~ product(X1,X2,X3) ),
inference(rewriting,[status(thm)],[c_142]) ).
cnf(c_9,negated_conjecture,
product(sk3_esk4_0,sk3_esk3_0,sk3_esk6_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_94997e.p',c_0_22) ).
cnf(c_32,negated_conjecture,
product(sk3_esk4_0,sk3_esk3_0,sk3_esk6_0),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_63,negated_conjecture,
product(sk3_esk4_0,sk3_esk3_0,sk3_esk6_0),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_64,negated_conjecture,
product(sk3_esk4_0,sk3_esk3_0,sk3_esk6_0),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_83,negated_conjecture,
product(sk3_esk4_0,sk3_esk3_0,sk3_esk6_0),
inference(copy,[status(esa)],[c_64]) ).
cnf(c_112,plain,
product(sk3_esk4_0,sk3_esk3_0,sk3_esk6_0),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_566,plain,
( product(X0,sk3_esk6_0,sk3_esk1_0)
| ~ product(X0,sk3_esk4_0,inverse(sk3_esk3_0)) ),
inference(resolution,[status(thm)],[c_143,c_112]) ).
cnf(c_567,plain,
( product(X0,sk3_esk6_0,sk3_esk1_0)
| ~ product(X0,sk3_esk4_0,inverse(sk3_esk3_0)) ),
inference(rewriting,[status(thm)],[c_566]) ).
cnf(c_1880,plain,
product(sk3_esk5_0,sk3_esk6_0,sk3_esk1_0),
inference(resolution,[status(thm)],[c_1841,c_567]) ).
cnf(c_1881,plain,
product(sk3_esk5_0,sk3_esk6_0,sk3_esk1_0),
inference(rewriting,[status(thm)],[c_1880]) ).
cnf(c_150757,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_871,c_1881]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP012+5 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 13:49:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.39 % FOF problem with conjecture
% 0.12/0.39 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_83f5bb.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_94997e.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_c7914a | grep -v "SZS"
% 0.20/0.41
% 0.20/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.41
% 0.20/0.41 %
% 0.20/0.41 % ------ iProver source info
% 0.20/0.41
% 0.20/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.41 % git: non_committed_changes: true
% 0.20/0.41 % git: last_make_outside_of_git: true
% 0.20/0.41
% 0.20/0.41 %
% 0.20/0.41 % ------ Input Options
% 0.20/0.41
% 0.20/0.41 % --out_options all
% 0.20/0.41 % --tptp_safe_out true
% 0.20/0.41 % --problem_path ""
% 0.20/0.41 % --include_path ""
% 0.20/0.41 % --clausifier .//eprover
% 0.20/0.41 % --clausifier_options --tstp-format
% 0.20/0.41 % --stdin false
% 0.20/0.41 % --dbg_backtrace false
% 0.20/0.41 % --dbg_dump_prop_clauses false
% 0.20/0.41 % --dbg_dump_prop_clauses_file -
% 0.20/0.41 % --dbg_out_stat false
% 0.20/0.41
% 0.20/0.41 % ------ General Options
% 0.20/0.41
% 0.20/0.41 % --fof false
% 0.20/0.41 % --time_out_real 150.
% 0.20/0.41 % --time_out_prep_mult 0.2
% 0.20/0.41 % --time_out_virtual -1.
% 0.20/0.41 % --schedule none
% 0.20/0.41 % --ground_splitting input
% 0.20/0.41 % --splitting_nvd 16
% 0.20/0.41 % --non_eq_to_eq false
% 0.20/0.41 % --prep_gs_sim true
% 0.20/0.41 % --prep_unflatten false
% 0.20/0.41 % --prep_res_sim true
% 0.20/0.41 % --prep_upred true
% 0.20/0.41 % --res_sim_input true
% 0.20/0.41 % --clause_weak_htbl true
% 0.20/0.41 % --gc_record_bc_elim false
% 0.20/0.41 % --symbol_type_check false
% 0.20/0.41 % --clausify_out false
% 0.20/0.41 % --large_theory_mode false
% 0.20/0.41 % --prep_sem_filter none
% 0.20/0.41 % --prep_sem_filter_out false
% 0.20/0.41 % --preprocessed_out false
% 0.20/0.41 % --sub_typing false
% 0.20/0.41 % --brand_transform false
% 0.20/0.41 % --pure_diseq_elim true
% 0.20/0.41 % --min_unsat_core false
% 0.20/0.41 % --pred_elim true
% 0.20/0.41 % --add_important_lit false
% 0.20/0.41 % --soft_assumptions false
% 0.20/0.41 % --reset_solvers false
% 0.20/0.41 % --bc_imp_inh []
% 0.20/0.41 % --conj_cone_tolerance 1.5
% 0.20/0.41 % --prolific_symb_bound 500
% 0.20/0.41 % --lt_threshold 2000
% 0.20/0.41
% 0.20/0.41 % ------ SAT Options
% 0.20/0.41
% 0.20/0.41 % --sat_mode false
% 0.20/0.41 % --sat_fm_restart_options ""
% 0.20/0.41 % --sat_gr_def false
% 0.20/0.41 % --sat_epr_types true
% 0.20/0.41 % --sat_non_cyclic_types false
% 0.20/0.41 % --sat_finite_models false
% 0.20/0.41 % --sat_fm_lemmas false
% 0.20/0.41 % --sat_fm_prep false
% 0.20/0.41 % --sat_fm_uc_incr true
% 0.20/0.41 % --sat_out_model small
% 0.20/0.41 % --sat_out_clauses false
% 0.20/0.41
% 0.20/0.41 % ------ QBF Options
% 0.20/0.41
% 0.20/0.41 % --qbf_mode false
% 0.20/0.41 % --qbf_elim_univ true
% 0.20/0.41 % --qbf_sk_in true
% 0.20/0.41 % --qbf_pred_elim true
% 0.20/0.41 % --qbf_split 32
% 0.20/0.41
% 0.20/0.41 % ------ BMC1 Options
% 0.20/0.41
% 0.20/0.41 % --bmc1_incremental false
% 0.20/0.41 % --bmc1_axioms reachable_all
% 0.20/0.41 % --bmc1_min_bound 0
% 0.20/0.41 % --bmc1_max_bound -1
% 0.20/0.41 % --bmc1_max_bound_default -1
% 0.20/0.41 % --bmc1_symbol_reachability true
% 0.20/0.41 % --bmc1_property_lemmas false
% 0.20/0.41 % --bmc1_k_induction false
% 0.20/0.41 % --bmc1_non_equiv_states false
% 0.20/0.41 % --bmc1_deadlock false
% 0.20/0.41 % --bmc1_ucm false
% 0.20/0.41 % --bmc1_add_unsat_core none
% 0.20/0.41 % --bmc1_unsat_core_children false
% 0.20/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.41 % --bmc1_out_stat full
% 0.20/0.41 % --bmc1_ground_init false
% 0.20/0.41 % --bmc1_pre_inst_next_state false
% 0.20/0.41 % --bmc1_pre_inst_state false
% 0.20/0.41 % --bmc1_pre_inst_reach_state false
% 0.20/0.41 % --bmc1_out_unsat_core false
% 0.20/0.41 % --bmc1_aig_witness_out false
% 0.20/0.41 % --bmc1_verbose false
% 0.20/0.41 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_83f5bb.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42 % ------ Parsing...% successful
% 0.20/0.42
% 0.20/0.42 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % ------ Problem Properties
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % EPR false
% 0.20/0.42 % Horn true
% 0.20/0.42 % Has equality false
% 0.20/0.42
% 0.20/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % % ------ Current options:
% 0.20/0.42
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 2.42/2.62 % --inst_prop_sim_new false
% 2.42/2.62 % --inst_orphan_elimination true
% 2.42/2.62 % --inst_learning_loop_flag true
% 2.42/2.62 % --inst_learning_start 3000
% 2.42/2.62 % --inst_learning_factor 2
% 2.42/2.62 % --inst_start_prop_sim_after_learn 3
% 2.42/2.62 % --inst_sel_renew solver
% 2.42/2.62 % --inst_lit_activity_flag true
% 2.42/2.62 % --inst_out_proof true
% 2.42/2.62
% 2.42/2.62 % ------ Resolution Options
% 2.42/2.62
% 2.42/2.62 % --resolution_flag true
% 2.42/2.62 % --res_lit_sel kbo_max
% 2.42/2.62 % --res_to_prop_solver none
% 2.42/2.62 % --res_prop_simpl_new false
% 2.42/2.62 % --res_prop_simpl_given false
% 2.42/2.62 % --res_passive_queue_type priority_queues
% 2.42/2.62 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.42/2.62 % --res_passive_queues_freq [15;5]
% 2.42/2.62 % --res_forward_subs full
% 2.42/2.62 % --res_backward_subs full
% 2.42/2.62 % --res_forward_subs_resolution true
% 2.42/2.62 % --res_backward_subs_resolution true
% 2.42/2.62 % --res_orphan_elimination false
% 2.42/2.62 % --res_time_limit 1000.
% 2.42/2.62 % --res_out_proof true
% 2.42/2.62 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_83f5bb.s
% 2.42/2.62 % --modulo true
% 2.42/2.62
% 2.42/2.62 % ------ Combination Options
% 2.42/2.62
% 2.42/2.62 % --comb_res_mult 1000
% 2.42/2.62 % --comb_inst_mult 300
% 2.42/2.62 % ------
% 2.42/2.62
% 2.42/2.62
% 2.42/2.62
% 2.42/2.62 % ------ Proving...
% 2.42/2.62 %
% 2.42/2.62
% 2.42/2.62
% 2.42/2.62 % Resolution empty clause
% 2.42/2.62
% 2.42/2.62 % ------ Statistics
% 2.42/2.62
% 2.42/2.62 % ------ General
% 2.42/2.62
% 2.42/2.62 % num_of_input_clauses: 10
% 2.42/2.62 % num_of_input_neg_conjectures: 10
% 2.42/2.62 % num_of_splits: 0
% 2.42/2.62 % num_of_split_atoms: 0
% 2.42/2.62 % num_of_sem_filtered_clauses: 0
% 2.42/2.62 % num_of_subtypes: 0
% 2.42/2.62 % monotx_restored_types: 0
% 2.42/2.62 % sat_num_of_epr_types: 0
% 2.42/2.62 % sat_num_of_non_cyclic_types: 0
% 2.42/2.62 % sat_guarded_non_collapsed_types: 0
% 2.42/2.62 % is_epr: 0
% 2.42/2.62 % is_horn: 1
% 2.42/2.62 % has_eq: 0
% 2.42/2.62 % num_pure_diseq_elim: 0
% 2.42/2.62 % simp_replaced_by: 0
% 2.42/2.62 % res_preprocessed: 20
% 2.42/2.62 % prep_upred: 0
% 2.42/2.62 % prep_unflattend: 0
% 2.42/2.62 % pred_elim_cands: 0
% 2.42/2.62 % pred_elim: 0
% 2.42/2.62 % pred_elim_cl: 0
% 2.42/2.62 % pred_elim_cycles: 0
% 2.42/2.62 % forced_gc_time: 0
% 2.42/2.62 % gc_basic_clause_elim: 0
% 2.42/2.62 % parsing_time: 0.
% 2.42/2.62 % sem_filter_time: 0.
% 2.42/2.62 % pred_elim_time: 0.
% 2.42/2.62 % out_proof_time: 0.001
% 2.42/2.62 % monotx_time: 0.
% 2.42/2.62 % subtype_inf_time: 0.
% 2.42/2.62 % unif_index_cands_time: 0.02
% 2.42/2.62 % unif_index_add_time: 0.002
% 2.42/2.62 % total_time: 2.217
% 2.42/2.62 % num_of_symbols: 33
% 2.42/2.62 % num_of_terms: 50105
% 2.42/2.62
% 2.42/2.62 % ------ Propositional Solver
% 2.42/2.62
% 2.42/2.62 % prop_solver_calls: 1
% 2.42/2.62 % prop_fast_solver_calls: 48
% 2.42/2.62 % prop_num_of_clauses: 14
% 2.42/2.62 % prop_preprocess_simplified: 156
% 2.42/2.62 % prop_fo_subsumed: 0
% 2.42/2.62 % prop_solver_time: 0.
% 2.42/2.62 % prop_fast_solver_time: 0.
% 2.42/2.62 % prop_unsat_core_time: 0.
% 2.42/2.62
% 2.42/2.62 % ------ QBF
% 2.42/2.62
% 2.42/2.62 % qbf_q_res: 0
% 2.42/2.62 % qbf_num_tautologies: 0
% 2.42/2.62 % qbf_prep_cycles: 0
% 2.42/2.62
% 2.42/2.62 % ------ BMC1
% 2.42/2.62
% 2.42/2.62 % bmc1_current_bound: -1
% 2.42/2.62 % bmc1_last_solved_bound: -1
% 2.42/2.62 % bmc1_unsat_core_size: -1
% 2.42/2.62 % bmc1_unsat_core_parents_size: -1
% 2.42/2.62 % bmc1_merge_next_fun: 0
% 2.42/2.62 % bmc1_unsat_core_clauses_time: 0.
% 2.42/2.62
% 2.42/2.62 % ------ Instantiation
% 2.42/2.62
% 2.42/2.62 % inst_num_of_clauses: 10
% 2.42/2.62 % inst_num_in_passive: 0
% 2.42/2.62 % inst_num_in_active: 0
% 2.42/2.62 % inst_num_in_unprocessed: 10
% 2.42/2.62 % inst_num_of_loops: 0
% 2.42/2.62 % inst_num_of_learning_restarts: 0
% 2.42/2.62 % inst_num_moves_active_passive: 0
% 2.42/2.62 % inst_lit_activity: 0
% 2.42/2.62 % inst_lit_activity_moves: 0
% 2.42/2.62 % inst_num_tautologies: 0
% 2.42/2.62 % inst_num_prop_implied: 0
% 2.42/2.62 % inst_num_existing_simplified: 0
% 2.42/2.62 % inst_num_eq_res_simplified: 0
% 2.42/2.62 % inst_num_child_elim: 0
% 2.42/2.62 % inst_num_of_dismatching_blockings: 0
% 2.42/2.62 % inst_num_of_non_proper_insts: 0
% 2.42/2.62 % inst_num_of_duplicates: 0
% 2.42/2.62 % inst_inst_num_from_inst_to_res: 0
% 2.42/2.62 % inst_dismatching_checking_time: 0.
% 2.42/2.62
% 2.42/2.62 % ------ Resolution
% 2.42/2.62
% 2.42/2.62 % res_num_of_clauses: 69205
% 2.42/2.62 % res_num_in_passive: 68397
% 2.42/2.62 % res_num_in_active: 807
% 2.42/2.62 % res_num_of_loops: 848
% 2.42/2.62 % res_forward_subset_subsumed: 3674
% 2.42/2.62 % res_backward_subset_subsumed: 0
% 2.42/2.62 % res_forward_subsumed: 28
% 2.42/2.62 % res_backward_subsumed: 12
% 2.42/2.62 % res_forward_subsumption_resolution: 1
% 2.42/2.62 % res_backward_subsumption_resolution: 0
% 2.42/2.62 % res_clause_to_clause_subsumption: 27019
% 2.42/2.62 % res_orphan_elimination: 0
% 2.42/2.62 % res_tautology_del: 90
% 2.42/2.62 % res_num_eq_res_simplified: 0
% 2.42/2.62 % res_num_sel_changes: 0
% 2.42/2.62 % res_moves_from_active_to_pass: 0
% 2.42/2.62
% 2.42/2.62 % Status Unsatisfiable
% 2.42/2.62 % SZS status Theorem
% 2.42/2.62 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------