TSTP Solution File: NUM007-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM007-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:58:10 EDT 2023
% Result : Unsatisfiable 799.82s 102.85s
% Output : CNFRefutation 799.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 20
% Syntax : Number of clauses : 92 ( 41 unt; 4 nHn; 50 RR)
% Number of literals : 187 ( 4 equ; 96 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 161 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(gcd_divides2,axiom,
( divides(X1,X2)
| ~ gcd(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',gcd_divides2) ).
cnf(c_is_gcd_of_a_and_b,negated_conjecture,
gcd(a,b,c),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',c_is_gcd_of_a_and_b) ).
cnf(operand_divides_product,axiom,
divides(X1,multiply(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',operand_divides_product) ).
cnf(commutativity_of_multiply,axiom,
multiply(X1,X2) = multiply(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',commutativity_of_multiply) ).
cnf(transitivity_of_divides,axiom,
( divides(X1,X2)
| ~ divides(X1,X3)
| ~ divides(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',transitivity_of_divides) ).
cnf(divides_quotient_multiply3,axiom,
( divides(quotient(X1,X2),X3)
| ~ divides(X2,X1)
| ~ divides(X1,multiply(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',divides_quotient_multiply3) ).
cnf(gcd_divides1,axiom,
( divides(X1,X2)
| ~ gcd(X3,X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',gcd_divides1) ).
cnf(divides_quotient_multiply1,axiom,
( divides(X1,multiply(X2,X3))
| ~ divides(X2,X1)
| ~ divides(quotient(X1,X2),X3) ),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',divides_quotient_multiply1) ).
cnf(one_divides_everything,axiom,
divides(quotient(X1,X1),X2),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',one_divides_everything) ).
cnf(divides_and_multiply,axiom,
( divides(multiply(X1,X2),multiply(X1,X3))
| ~ divides(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',divides_and_multiply) ).
cnf(prove_lcm,negated_conjecture,
~ lcm(a,b,quotient(multiply(a,b),c)),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',prove_lcm) ).
cnf(lcm2,axiom,
( lcm(X1,X2,X3)
| divides(X2,k(X2,X1,X3))
| ~ divides(X1,X3)
| ~ divides(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',lcm2) ).
cnf(commutativity_of_k,axiom,
k(X1,X2,X3) = k(X2,X1,X3),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',commutativity_of_k) ).
cnf(lcm1,axiom,
( lcm(X1,X2,X3)
| divides(X1,k(X2,X1,X3))
| ~ divides(X1,X3)
| ~ divides(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',lcm1) ).
cnf(property_of_gcd,axiom,
( gcd(multiply(X1,X2),multiply(X1,X3),multiply(X1,X4))
| ~ gcd(X2,X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',property_of_gcd) ).
cnf(commutativity_of_gcd,axiom,
( gcd(X2,X1,X3)
| ~ gcd(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',commutativity_of_gcd) ).
cnf(reflexivity_of_divides,axiom,
divides(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',reflexivity_of_divides) ).
cnf(divides_quotient_multiply2,axiom,
( divides(X1,quotient(X2,X3))
| ~ divides(X3,X2)
| ~ divides(multiply(X1,X3),X2) ),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',divides_quotient_multiply2) ).
cnf(lcm3,axiom,
( lcm(X1,X2,X3)
| ~ divides(X1,X3)
| ~ divides(X2,X3)
| ~ divides(X3,k(X2,X1,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',lcm3) ).
cnf(gcd1,axiom,
( divides(X1,X2)
| ~ divides(X1,X3)
| ~ divides(X1,X4)
| ~ gcd(X3,X4,X2) ),
file('/export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p',gcd1) ).
cnf(c_0_20,axiom,
( divides(X1,X2)
| ~ gcd(X2,X3,X1) ),
gcd_divides2 ).
cnf(c_0_21,negated_conjecture,
gcd(a,b,c),
c_is_gcd_of_a_and_b ).
cnf(c_0_22,axiom,
divides(X1,multiply(X1,X2)),
operand_divides_product ).
cnf(c_0_23,axiom,
multiply(X1,X2) = multiply(X2,X1),
commutativity_of_multiply ).
cnf(c_0_24,axiom,
( divides(X1,X2)
| ~ divides(X1,X3)
| ~ divides(X3,X2) ),
transitivity_of_divides ).
cnf(c_0_25,negated_conjecture,
divides(c,a),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,axiom,
( divides(quotient(X1,X2),X3)
| ~ divides(X2,X1)
| ~ divides(X1,multiply(X2,X3)) ),
divides_quotient_multiply3 ).
cnf(c_0_27,plain,
divides(X1,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( divides(X1,a)
| ~ divides(X1,c) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( divides(quotient(X1,X2),X1)
| ~ divides(X2,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,axiom,
( divides(X1,X2)
| ~ gcd(X3,X2,X1) ),
gcd_divides1 ).
cnf(c_0_31,axiom,
( divides(X1,multiply(X2,X3))
| ~ divides(X2,X1)
| ~ divides(quotient(X1,X2),X3) ),
divides_quotient_multiply1 ).
cnf(c_0_32,negated_conjecture,
( divides(quotient(c,X1),a)
| ~ divides(X1,c) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
divides(c,b),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_34,negated_conjecture,
( divides(c,multiply(X1,a))
| ~ divides(X1,c) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,axiom,
divides(quotient(X1,X1),X2),
one_divides_everything ).
cnf(c_0_36,negated_conjecture,
( divides(X1,b)
| ~ divides(X1,c) ),
inference(spm,[status(thm)],[c_0_24,c_0_33]) ).
cnf(c_0_37,axiom,
( divides(multiply(X1,X2),multiply(X1,X3))
| ~ divides(X2,X3) ),
divides_and_multiply ).
cnf(c_0_38,negated_conjecture,
divides(c,multiply(quotient(X1,X1),a)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( divides(quotient(c,X1),b)
| ~ divides(X1,c) ),
inference(spm,[status(thm)],[c_0_36,c_0_29]) ).
cnf(c_0_40,negated_conjecture,
~ lcm(a,b,quotient(multiply(a,b),c)),
prove_lcm ).
cnf(c_0_41,axiom,
( lcm(X1,X2,X3)
| divides(X2,k(X2,X1,X3))
| ~ divides(X1,X3)
| ~ divides(X2,X3) ),
lcm2 ).
cnf(c_0_42,axiom,
k(X1,X2,X3) = k(X2,X1,X3),
commutativity_of_k ).
cnf(c_0_43,axiom,
( lcm(X1,X2,X3)
| divides(X1,k(X2,X1,X3))
| ~ divides(X1,X3)
| ~ divides(X2,X3) ),
lcm1 ).
cnf(c_0_44,axiom,
( gcd(multiply(X1,X2),multiply(X1,X3),multiply(X1,X4))
| ~ gcd(X2,X3,X4) ),
property_of_gcd ).
cnf(c_0_45,axiom,
( gcd(X2,X1,X3)
| ~ gcd(X1,X2,X3) ),
commutativity_of_gcd ).
cnf(c_0_46,plain,
( divides(X1,multiply(X2,X3))
| ~ divides(X1,multiply(X2,X4))
| ~ divides(X4,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_37]) ).
cnf(c_0_47,negated_conjecture,
divides(c,multiply(a,quotient(X1,X1))),
inference(spm,[status(thm)],[c_0_38,c_0_23]) ).
cnf(c_0_48,negated_conjecture,
( divides(c,multiply(X1,b))
| ~ divides(X1,c) ),
inference(spm,[status(thm)],[c_0_31,c_0_39]) ).
cnf(c_0_49,negated_conjecture,
( divides(b,k(a,b,quotient(multiply(a,b),c)))
| ~ divides(b,quotient(multiply(a,b),c))
| ~ divides(a,quotient(multiply(a,b),c)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( divides(a,k(a,b,quotient(multiply(a,b),c)))
| ~ divides(b,quotient(multiply(a,b),c))
| ~ divides(a,quotient(multiply(a,b),c)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_43]),c_0_42]) ).
cnf(c_0_51,axiom,
divides(X1,X1),
reflexivity_of_divides ).
cnf(c_0_52,plain,
( divides(multiply(X1,X2),multiply(X1,X3))
| ~ gcd(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_44]) ).
cnf(c_0_53,negated_conjecture,
gcd(b,a,c),
inference(spm,[status(thm)],[c_0_45,c_0_21]) ).
cnf(c_0_54,negated_conjecture,
divides(c,multiply(a,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_35])]) ).
cnf(c_0_55,negated_conjecture,
divides(c,multiply(quotient(X1,X1),b)),
inference(spm,[status(thm)],[c_0_48,c_0_35]) ).
cnf(c_0_56,negated_conjecture,
( divides(X1,k(a,b,quotient(multiply(a,b),c)))
| ~ divides(b,quotient(multiply(a,b),c))
| ~ divides(a,quotient(multiply(a,b),c))
| ~ divides(X1,b) ),
inference(spm,[status(thm)],[c_0_24,c_0_49]) ).
cnf(c_0_57,negated_conjecture,
( divides(X1,k(a,b,quotient(multiply(a,b),c)))
| ~ divides(b,quotient(multiply(a,b),c))
| ~ divides(a,quotient(multiply(a,b),c))
| ~ divides(X1,a) ),
inference(spm,[status(thm)],[c_0_24,c_0_50]) ).
cnf(c_0_58,plain,
divides(quotient(multiply(X1,X2),X1),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_51]),c_0_22])]) ).
cnf(c_0_59,axiom,
( divides(X1,quotient(X2,X3))
| ~ divides(X3,X2)
| ~ divides(multiply(X1,X3),X2) ),
divides_quotient_multiply2 ).
cnf(c_0_60,negated_conjecture,
divides(multiply(X1,c),multiply(X1,a)),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_61,negated_conjecture,
divides(c,multiply(X1,a)),
inference(spm,[status(thm)],[c_0_54,c_0_23]) ).
cnf(c_0_62,negated_conjecture,
divides(c,multiply(b,quotient(X1,X1))),
inference(spm,[status(thm)],[c_0_55,c_0_23]) ).
cnf(c_0_63,negated_conjecture,
( divides(X1,k(a,b,quotient(multiply(a,b),c)))
| ~ divides(b,quotient(multiply(a,b),c))
| ~ divides(a,quotient(multiply(a,b),c))
| ~ divides(X2,b)
| ~ divides(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_56]) ).
cnf(c_0_64,negated_conjecture,
( divides(X1,multiply(X2,k(a,b,quotient(multiply(a,b),c))))
| ~ divides(b,quotient(multiply(a,b),c))
| ~ divides(a,quotient(multiply(a,b),c))
| ~ divides(quotient(X1,X2),a)
| ~ divides(X2,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_57]) ).
cnf(c_0_65,plain,
divides(quotient(multiply(X1,X2),X2),X1),
inference(spm,[status(thm)],[c_0_58,c_0_23]) ).
cnf(c_0_66,negated_conjecture,
divides(X1,quotient(multiply(X1,a),c)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]) ).
cnf(c_0_67,negated_conjecture,
divides(c,multiply(b,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_62]),c_0_35])]) ).
cnf(c_0_68,negated_conjecture,
( divides(X1,k(a,b,quotient(multiply(a,b),c)))
| ~ divides(b,quotient(multiply(a,b),c))
| ~ divides(a,quotient(multiply(a,b),c))
| ~ divides(X1,quotient(multiply(X2,b),X2)) ),
inference(spm,[status(thm)],[c_0_63,c_0_58]) ).
cnf(c_0_69,plain,
( gcd(multiply(X1,X2),multiply(X1,X3),multiply(X1,X4))
| ~ gcd(X3,X2,X4) ),
inference(spm,[status(thm)],[c_0_45,c_0_44]) ).
cnf(c_0_70,negated_conjecture,
( divides(multiply(a,X1),multiply(X1,k(a,b,quotient(multiply(a,b),c))))
| ~ divides(b,quotient(multiply(a,b),c))
| ~ divides(a,quotient(multiply(a,b),c)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_27])]) ).
cnf(c_0_71,negated_conjecture,
divides(X1,quotient(multiply(a,X1),c)),
inference(spm,[status(thm)],[c_0_66,c_0_23]) ).
cnf(c_0_72,negated_conjecture,
divides(multiply(X1,c),multiply(X1,b)),
inference(spm,[status(thm)],[c_0_52,c_0_21]) ).
cnf(c_0_73,negated_conjecture,
divides(c,multiply(X1,b)),
inference(spm,[status(thm)],[c_0_67,c_0_23]) ).
cnf(c_0_74,negated_conjecture,
( divides(quotient(multiply(X1,b),X1),k(a,b,quotient(multiply(a,b),c)))
| ~ divides(b,quotient(multiply(a,b),c))
| ~ divides(a,quotient(multiply(a,b),c)) ),
inference(spm,[status(thm)],[c_0_68,c_0_51]) ).
cnf(c_0_75,negated_conjecture,
gcd(multiply(X1,a),multiply(X1,b),multiply(X1,c)),
inference(spm,[status(thm)],[c_0_69,c_0_53]) ).
cnf(c_0_76,negated_conjecture,
( divides(multiply(a,X1),multiply(X1,k(a,b,quotient(multiply(a,b),c))))
| ~ divides(a,quotient(multiply(a,b),c)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]) ).
cnf(c_0_77,negated_conjecture,
divides(X1,quotient(multiply(X1,b),c)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_72]),c_0_73])]) ).
cnf(c_0_78,negated_conjecture,
( divides(multiply(X1,b),multiply(X1,k(a,b,quotient(multiply(a,b),c))))
| ~ divides(b,quotient(multiply(a,b),c))
| ~ divides(a,quotient(multiply(a,b),c)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_74]),c_0_22])]) ).
cnf(c_0_79,axiom,
( lcm(X1,X2,X3)
| ~ divides(X1,X3)
| ~ divides(X2,X3)
| ~ divides(X3,k(X2,X1,X3)) ),
lcm3 ).
cnf(c_0_80,axiom,
( divides(X1,X2)
| ~ divides(X1,X3)
| ~ divides(X1,X4)
| ~ gcd(X3,X4,X2) ),
gcd1 ).
cnf(c_0_81,negated_conjecture,
gcd(multiply(X1,a),multiply(X1,b),multiply(c,X1)),
inference(spm,[status(thm)],[c_0_75,c_0_23]) ).
cnf(c_0_82,negated_conjecture,
divides(multiply(a,X1),multiply(X1,k(a,b,quotient(multiply(a,b),c)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]) ).
cnf(c_0_83,negated_conjecture,
( divides(multiply(X1,b),multiply(X1,k(a,b,quotient(multiply(a,b),c))))
| ~ divides(a,quotient(multiply(a,b),c)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_71])]) ).
cnf(c_0_84,negated_conjecture,
( ~ divides(quotient(multiply(a,b),c),k(a,b,quotient(multiply(a,b),c)))
| ~ divides(b,quotient(multiply(a,b),c))
| ~ divides(a,quotient(multiply(a,b),c)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_79]),c_0_42]) ).
cnf(c_0_85,negated_conjecture,
( divides(X1,multiply(c,X2))
| ~ divides(X1,multiply(X2,b))
| ~ divides(X1,multiply(X2,a)) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_86,negated_conjecture,
divides(multiply(a,X1),multiply(k(a,b,quotient(multiply(a,b),c)),X1)),
inference(spm,[status(thm)],[c_0_82,c_0_23]) ).
cnf(c_0_87,negated_conjecture,
divides(multiply(X1,b),multiply(X1,k(a,b,quotient(multiply(a,b),c)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_77])]) ).
cnf(c_0_88,negated_conjecture,
( ~ divides(quotient(multiply(a,b),c),k(a,b,quotient(multiply(a,b),c)))
| ~ divides(a,quotient(multiply(a,b),c)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_71])]) ).
cnf(c_0_89,negated_conjecture,
divides(multiply(a,b),multiply(c,k(a,b,quotient(multiply(a,b),c)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_23]),c_0_87])]) ).
cnf(c_0_90,negated_conjecture,
~ divides(quotient(multiply(a,b),c),k(a,b,quotient(multiply(a,b),c))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_77])]) ).
cnf(c_0_91,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_89]),c_0_73])]),c_0_90]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : NUM007-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 14:53:55 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.aOrDmKe4XD/E---3.1_1727.p
% 799.82/102.85 # Version: 3.1pre001
% 799.82/102.85 # Preprocessing class: FSMSSMSSSSSNFFN.
% 799.82/102.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 799.82/102.85 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 799.82/102.85 # Starting new_bool_3 with 300s (1) cores
% 799.82/102.85 # Starting new_bool_1 with 300s (1) cores
% 799.82/102.85 # Starting sh5l with 300s (1) cores
% 799.82/102.85 # new_bool_3 with pid 1811 completed with status 0
% 799.82/102.85 # Result found by new_bool_3
% 799.82/102.85 # Preprocessing class: FSMSSMSSSSSNFFN.
% 799.82/102.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 799.82/102.85 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 799.82/102.85 # Starting new_bool_3 with 300s (1) cores
% 799.82/102.85 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 799.82/102.85 # Search class: FGUSM-FFMF32-SFFFFFNN
% 799.82/102.85 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 799.82/102.85 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S070I with 100s (1) cores
% 799.82/102.85 # G-E--_208_B00_00_F1_SE_CS_SP_PS_S070I with pid 1815 completed with status 7
% 799.82/102.85 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 51s (1) cores
% 799.82/102.85 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 1830 completed with status 0
% 799.82/102.85 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 799.82/102.85 # Preprocessing class: FSMSSMSSSSSNFFN.
% 799.82/102.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 799.82/102.85 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 799.82/102.85 # Starting new_bool_3 with 300s (1) cores
% 799.82/102.85 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 799.82/102.85 # Search class: FGUSM-FFMF32-SFFFFFNN
% 799.82/102.85 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 799.82/102.85 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S070I with 100s (1) cores
% 799.82/102.85 # G-E--_208_B00_00_F1_SE_CS_SP_PS_S070I with pid 1815 completed with status 7
% 799.82/102.85 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 51s (1) cores
% 799.82/102.85 # Preprocessing time : 0.001 s
% 799.82/102.85 # Presaturation interreduction done
% 799.82/102.85
% 799.82/102.85 # Proof found!
% 799.82/102.85 # SZS status Unsatisfiable
% 799.82/102.85 # SZS output start CNFRefutation
% See solution above
% 799.82/102.86 # Parsed axioms : 25
% 799.82/102.86 # Removed by relevancy pruning/SinE : 4
% 799.82/102.86 # Initial clauses : 21
% 799.82/102.86 # Removed in clause preprocessing : 0
% 799.82/102.86 # Initial clauses in saturation : 21
% 799.82/102.86 # Processed clauses : 1495
% 799.82/102.86 # ...of these trivial : 367
% 799.82/102.86 # ...subsumed : 532
% 799.82/102.86 # ...remaining for further processing : 596
% 799.82/102.86 # Other redundant clauses eliminated : 0
% 799.82/102.86 # Clauses deleted for lack of memory : 0
% 799.82/102.86 # Backward-subsumed : 7
% 799.82/102.86 # Backward-rewritten : 136
% 799.82/102.86 # Generated clauses : 9333
% 799.82/102.86 # ...of the previous two non-redundant : 7018
% 799.82/102.86 # ...aggressively subsumed : 0
% 799.82/102.86 # Contextual simplify-reflections : 2
% 799.82/102.86 # Paramodulations : 9333
% 799.82/102.86 # Factorizations : 0
% 799.82/102.86 # NegExts : 0
% 799.82/102.86 # Equation resolutions : 0
% 799.82/102.86 # Total rewrite steps : 4230
% 799.82/102.86 # Propositional unsat checks : 0
% 799.82/102.86 # Propositional check models : 0
% 799.82/102.86 # Propositional check unsatisfiable : 0
% 799.82/102.86 # Propositional clauses : 0
% 799.82/102.86 # Propositional clauses after purity: 0
% 799.82/102.86 # Propositional unsat core size : 0
% 799.82/102.86 # Propositional preprocessing time : 0.000
% 799.82/102.86 # Propositional encoding time : 0.000
% 799.82/102.86 # Propositional solver time : 0.000
% 799.82/102.86 # Success case prop preproc time : 0.000
% 799.82/102.86 # Success case prop encoding time : 0.000
% 799.82/102.86 # Success case prop solver time : 0.000
% 799.82/102.86 # Current number of processed clauses : 432
% 799.82/102.86 # Positive orientable unit clauses : 212
% 799.82/102.86 # Positive unorientable unit clauses: 2
% 799.82/102.86 # Negative unit clauses : 7
% 799.82/102.86 # Non-unit-clauses : 211
% 799.82/102.86 # Current number of unprocessed clauses: 5492
% 799.82/102.86 # ...number of literals in the above : 10496
% 799.82/102.86 # Current number of archived formulas : 0
% 799.82/102.86 # Current number of archived clauses : 164
% 799.82/102.86 # Clause-clause subsumption calls (NU) : 28077
% 799.82/102.86 # Rec. Clause-clause subsumption calls : 25626
% 799.82/102.86 # Non-unit clause-clause subsumptions : 536
% 799.82/102.86 # Unit Clause-clause subsumption calls : 2088
% 799.82/102.86 # Rewrite failures with RHS unbound : 0
% 799.82/102.86 # BW rewrite match attempts : 768
% 799.82/102.86 # BW rewrite match successes : 34
% 799.82/102.86 # Condensation attempts : 0
% 799.82/102.86 # Condensation successes : 0
% 799.82/102.86 # Termbank termtop insertions : 162893
% 799.82/102.86
% 799.82/102.86 # -------------------------------------------------
% 799.82/102.86 # User time : 98.608 s
% 799.82/102.86 # System time : 1.582 s
% 799.82/102.86 # Total time : 100.190 s
% 799.82/102.86 # Maximum resident set size: 1752 pages
% 799.82/102.86
% 799.82/102.86 # -------------------------------------------------
% 799.82/102.86 # User time : 98.613 s
% 799.82/102.86 # System time : 1.584 s
% 799.82/102.86 # Total time : 100.197 s
% 799.82/102.86 # Maximum resident set size: 1692 pages
% 799.82/102.86 % E---3.1 exiting
%------------------------------------------------------------------------------