TSTP Solution File: FLD068-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD068-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 17:30:16 EDT 2023
% Result : Unsatisfiable 87.12s 11.52s
% Output : CNFRefutation 87.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 20
% Syntax : Number of clauses : 99 ( 40 unt; 5 nHn; 99 RR)
% Number of literals : 202 ( 0 equ; 100 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 108 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(commutativity_addition,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',commutativity_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',a_is_defined) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',transitivity_of_equality) ).
cnf(existence_of_inverse_addition,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',existence_of_inverse_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',well_definedness_of_additive_inverse) ).
cnf(totality_of_order_relation,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',totality_of_order_relation) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',well_definedness_of_additive_identity) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',symmetry_of_equality) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',b_is_defined) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',compatibility_of_equality_and_order_relation) ).
cnf(not_less_or_equal_6,negated_conjecture,
~ less_or_equal(a,b),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',not_less_or_equal_6) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( less_or_equal(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ less_or_equal(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',compatibility_of_order_relation_and_addition) ).
cnf(transitivity_of_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',transitivity_of_order_relation) ).
cnf(less_or_equal_5,negated_conjecture,
less_or_equal(additive_identity,u),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',less_or_equal_5) ).
cnf(existence_of_identity_addition,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',existence_of_identity_addition) ).
cnf(add_equals_u_4,negated_conjecture,
equalish(add(b,additive_inverse(a)),u),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',add_equals_u_4) ).
cnf(antisymmetry_of_order_relation,axiom,
( equalish(X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',antisymmetry_of_order_relation) ).
cnf(compatibility_of_equality_and_addition,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',compatibility_of_equality_and_addition) ).
cnf(well_definedness_of_addition,axiom,
( defined(add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',well_definedness_of_addition) ).
cnf(associativity_addition,axiom,
( equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p',associativity_addition) ).
cnf(c_0_20,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
commutativity_addition ).
cnf(c_0_21,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_22,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_23,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_24,hypothesis,
( equalish(add(X1,a),add(a,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
well_definedness_of_additive_inverse ).
cnf(c_0_26,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_order_relation ).
cnf(c_0_27,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_28,plain,
( equalish(X1,additive_identity)
| ~ defined(X2)
| ~ equalish(X1,add(X2,additive_inverse(X2))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,hypothesis,
( equalish(add(additive_inverse(X1),a),add(a,additive_inverse(X1)))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( less_or_equal(additive_identity,X1)
| less_or_equal(X1,additive_identity)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( equalish(add(additive_inverse(X1),X2),add(X2,additive_inverse(X1)))
| ~ defined(X2)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_32,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_33,hypothesis,
equalish(add(additive_inverse(a),a),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21])]) ).
cnf(c_0_34,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_35,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
compatibility_of_equality_and_order_relation ).
cnf(c_0_36,plain,
less_or_equal(additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_37,plain,
( equalish(X1,add(X2,additive_inverse(X3)))
| ~ defined(X2)
| ~ defined(X3)
| ~ equalish(X1,add(additive_inverse(X3),X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_31]) ).
cnf(c_0_38,hypothesis,
equalish(additive_identity,add(additive_inverse(a),a)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,hypothesis,
( less_or_equal(b,X1)
| less_or_equal(X1,b)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
~ less_or_equal(a,b),
not_less_or_equal_6 ).
cnf(c_0_41,plain,
( less_or_equal(X1,additive_identity)
| ~ equalish(additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,hypothesis,
equalish(additive_identity,add(a,additive_inverse(a))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_21])]) ).
cnf(c_0_43,axiom,
( less_or_equal(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ less_or_equal(X1,X3) ),
compatibility_of_order_relation_and_addition ).
cnf(c_0_44,hypothesis,
less_or_equal(b,a),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_21]),c_0_40]) ).
cnf(c_0_45,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
transitivity_of_order_relation ).
cnf(c_0_46,hypothesis,
less_or_equal(add(a,additive_inverse(a)),additive_identity),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,hypothesis,
( less_or_equal(add(b,X1),add(a,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,hypothesis,
( less_or_equal(X1,additive_identity)
| ~ less_or_equal(X1,add(a,additive_inverse(a))) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,hypothesis,
( less_or_equal(add(b,additive_inverse(X1)),add(a,additive_inverse(X1)))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_25]) ).
cnf(c_0_50,negated_conjecture,
less_or_equal(additive_identity,u),
less_or_equal_5 ).
cnf(c_0_51,hypothesis,
( less_or_equal(a,X1)
| less_or_equal(X1,a)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_52,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_53,hypothesis,
less_or_equal(add(b,additive_inverse(a)),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_21])]) ).
cnf(c_0_54,negated_conjecture,
( less_or_equal(add(additive_identity,X1),add(u,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_50]) ).
cnf(c_0_55,hypothesis,
less_or_equal(a,a),
inference(spm,[status(thm)],[c_0_51,c_0_21]) ).
cnf(c_0_56,hypothesis,
equalish(add(additive_identity,a),a),
inference(spm,[status(thm)],[c_0_52,c_0_21]) ).
cnf(c_0_57,hypothesis,
( less_or_equal(X1,additive_identity)
| ~ equalish(add(b,additive_inverse(a)),X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
equalish(add(b,additive_inverse(a)),u),
add_equals_u_4 ).
cnf(c_0_59,hypothesis,
less_or_equal(add(additive_identity,a),add(u,a)),
inference(spm,[status(thm)],[c_0_54,c_0_21]) ).
cnf(c_0_60,hypothesis,
( less_or_equal(X1,a)
| ~ equalish(a,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_55]) ).
cnf(c_0_61,hypothesis,
equalish(a,add(additive_identity,a)),
inference(spm,[status(thm)],[c_0_32,c_0_56]) ).
cnf(c_0_62,negated_conjecture,
less_or_equal(u,additive_identity),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,hypothesis,
( less_or_equal(X1,add(u,a))
| ~ equalish(add(additive_identity,a),X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_59]) ).
cnf(c_0_64,hypothesis,
less_or_equal(add(additive_identity,a),a),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
( less_or_equal(add(u,X1),add(additive_identity,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_62]) ).
cnf(c_0_66,axiom,
( equalish(X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
antisymmetry_of_order_relation ).
cnf(c_0_67,hypothesis,
less_or_equal(a,add(u,a)),
inference(spm,[status(thm)],[c_0_63,c_0_56]) ).
cnf(c_0_68,hypothesis,
( less_or_equal(X1,a)
| ~ less_or_equal(X1,add(additive_identity,a)) ),
inference(spm,[status(thm)],[c_0_45,c_0_64]) ).
cnf(c_0_69,hypothesis,
less_or_equal(add(u,a),add(additive_identity,a)),
inference(spm,[status(thm)],[c_0_65,c_0_21]) ).
cnf(c_0_70,hypothesis,
( equalish(add(u,a),a)
| ~ less_or_equal(add(u,a),a) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,hypothesis,
less_or_equal(add(u,a),a),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_72,negated_conjecture,
( equalish(X1,u)
| ~ equalish(X1,add(b,additive_inverse(a))) ),
inference(spm,[status(thm)],[c_0_22,c_0_58]) ).
cnf(c_0_73,hypothesis,
equalish(add(u,a),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]) ).
cnf(c_0_74,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_addition ).
cnf(c_0_75,negated_conjecture,
equalish(add(additive_inverse(a),b),u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_31]),c_0_34]),c_0_21])]) ).
cnf(c_0_76,axiom,
( defined(add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
well_definedness_of_addition ).
cnf(c_0_77,hypothesis,
( equalish(X1,a)
| ~ equalish(X1,add(u,a)) ),
inference(spm,[status(thm)],[c_0_22,c_0_73]) ).
cnf(c_0_78,negated_conjecture,
( equalish(add(add(additive_inverse(a),b),X1),add(u,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,plain,
( equalish(add(add(X1,X2),X3),add(X3,add(X1,X2)))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_76]) ).
cnf(c_0_80,negated_conjecture,
equalish(add(add(additive_inverse(a),b),a),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_21])]) ).
cnf(c_0_81,axiom,
( equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
associativity_addition ).
cnf(c_0_82,plain,
( equalish(X1,add(X2,add(X3,X4)))
| ~ defined(X2)
| ~ defined(X4)
| ~ defined(X3)
| ~ equalish(X1,add(add(X3,X4),X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_79]) ).
cnf(c_0_83,negated_conjecture,
equalish(a,add(add(additive_inverse(a),b),a)),
inference(spm,[status(thm)],[c_0_32,c_0_80]) ).
cnf(c_0_84,plain,
( equalish(add(X1,add(additive_inverse(X2),X3)),add(add(X1,additive_inverse(X2)),X3))
| ~ defined(X3)
| ~ defined(X1)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_81,c_0_25]) ).
cnf(c_0_85,negated_conjecture,
( equalish(a,add(a,add(additive_inverse(a),b)))
| ~ defined(additive_inverse(a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_21]),c_0_34])]) ).
cnf(c_0_86,plain,
( equalish(add(add(X1,additive_inverse(X1)),X2),add(additive_identity,X2))
| ~ defined(X2)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_23]) ).
cnf(c_0_87,plain,
( equalish(X1,add(add(X2,additive_inverse(X3)),X4))
| ~ defined(X4)
| ~ defined(X2)
| ~ defined(X3)
| ~ equalish(X1,add(X2,add(additive_inverse(X3),X4))) ),
inference(spm,[status(thm)],[c_0_22,c_0_84]) ).
cnf(c_0_88,negated_conjecture,
equalish(a,add(a,add(additive_inverse(a),b))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_25]),c_0_21])]) ).
cnf(c_0_89,hypothesis,
equalish(add(additive_identity,b),b),
inference(spm,[status(thm)],[c_0_52,c_0_34]) ).
cnf(c_0_90,plain,
( equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| ~ defined(X3)
| ~ equalish(X1,add(add(X3,additive_inverse(X3)),X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_86]) ).
cnf(c_0_91,negated_conjecture,
equalish(a,add(add(a,additive_inverse(a)),b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_34]),c_0_21])]) ).
cnf(c_0_92,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,add(additive_identity,b)) ),
inference(spm,[status(thm)],[c_0_22,c_0_89]) ).
cnf(c_0_93,negated_conjecture,
equalish(a,add(additive_identity,b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_34]),c_0_21])]) ).
cnf(c_0_94,hypothesis,
less_or_equal(b,b),
inference(spm,[status(thm)],[c_0_39,c_0_34]) ).
cnf(c_0_95,hypothesis,
equalish(a,b),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_96,hypothesis,
( less_or_equal(X1,b)
| ~ equalish(b,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_94]) ).
cnf(c_0_97,hypothesis,
equalish(b,a),
inference(spm,[status(thm)],[c_0_32,c_0_95]) ).
cnf(c_0_98,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : FLD068-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n027.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 : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 23:45:01 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.SEzpCOM5HP/E---3.1_23722.p
% 87.12/11.52 # Version: 3.1pre001
% 87.12/11.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 87.12/11.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 87.12/11.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 87.12/11.52 # Starting new_bool_3 with 300s (1) cores
% 87.12/11.52 # Starting new_bool_1 with 300s (1) cores
% 87.12/11.52 # Starting sh5l with 300s (1) cores
% 87.12/11.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23800 completed with status 0
% 87.12/11.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 87.12/11.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 87.12/11.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 87.12/11.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 87.12/11.52 # No SInE strategy applied
% 87.12/11.52 # Search class: FGUNF-FFMM21-SFFFFFNN
% 87.12/11.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 87.12/11.52 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 589s (1) cores
% 87.12/11.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 87.12/11.52 # Starting new_bool_3 with 269s (1) cores
% 87.12/11.52 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 87.12/11.52 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 87.12/11.52 # G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with pid 23809 completed with status 0
% 87.12/11.52 # Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN
% 87.12/11.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 87.12/11.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 87.12/11.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 87.12/11.52 # No SInE strategy applied
% 87.12/11.52 # Search class: FGUNF-FFMM21-SFFFFFNN
% 87.12/11.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 87.12/11.52 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 589s (1) cores
% 87.12/11.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 87.12/11.52 # Starting new_bool_3 with 269s (1) cores
% 87.12/11.52 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 87.12/11.52 # Preprocessing time : 0.001 s
% 87.12/11.52 # Presaturation interreduction done
% 87.12/11.52
% 87.12/11.52 # Proof found!
% 87.12/11.52 # SZS status Unsatisfiable
% 87.12/11.52 # SZS output start CNFRefutation
% See solution above
% 87.12/11.52 # Parsed axioms : 33
% 87.12/11.52 # Removed by relevancy pruning/SinE : 0
% 87.12/11.52 # Initial clauses : 33
% 87.12/11.52 # Removed in clause preprocessing : 0
% 87.12/11.52 # Initial clauses in saturation : 33
% 87.12/11.52 # Processed clauses : 43828
% 87.12/11.52 # ...of these trivial : 7454
% 87.12/11.52 # ...subsumed : 21518
% 87.12/11.52 # ...remaining for further processing : 14856
% 87.12/11.52 # Other redundant clauses eliminated : 0
% 87.12/11.52 # Clauses deleted for lack of memory : 0
% 87.12/11.52 # Backward-subsumed : 10
% 87.12/11.52 # Backward-rewritten : 44
% 87.12/11.52 # Generated clauses : 507268
% 87.12/11.52 # ...of the previous two non-redundant : 438512
% 87.12/11.52 # ...aggressively subsumed : 0
% 87.12/11.52 # Contextual simplify-reflections : 78
% 87.12/11.52 # Paramodulations : 507258
% 87.12/11.52 # Factorizations : 10
% 87.12/11.52 # NegExts : 0
% 87.12/11.52 # Equation resolutions : 0
% 87.12/11.52 # Total rewrite steps : 150165
% 87.12/11.52 # Propositional unsat checks : 0
% 87.12/11.52 # Propositional check models : 0
% 87.12/11.52 # Propositional check unsatisfiable : 0
% 87.12/11.52 # Propositional clauses : 0
% 87.12/11.52 # Propositional clauses after purity: 0
% 87.12/11.52 # Propositional unsat core size : 0
% 87.12/11.52 # Propositional preprocessing time : 0.000
% 87.12/11.52 # Propositional encoding time : 0.000
% 87.12/11.52 # Propositional solver time : 0.000
% 87.12/11.52 # Success case prop preproc time : 0.000
% 87.12/11.52 # Success case prop encoding time : 0.000
% 87.12/11.52 # Success case prop solver time : 0.000
% 87.12/11.52 # Current number of processed clauses : 14769
% 87.12/11.52 # Positive orientable unit clauses : 5453
% 87.12/11.52 # Positive unorientable unit clauses: 0
% 87.12/11.52 # Negative unit clauses : 2
% 87.12/11.52 # Non-unit-clauses : 9314
% 87.12/11.52 # Current number of unprocessed clauses: 394713
% 87.12/11.52 # ...number of literals in the above : 1378906
% 87.12/11.52 # Current number of archived formulas : 0
% 87.12/11.52 # Current number of archived clauses : 87
% 87.12/11.52 # Clause-clause subsumption calls (NU) : 6969803
% 87.12/11.52 # Rec. Clause-clause subsumption calls : 5441709
% 87.12/11.52 # Non-unit clause-clause subsumptions : 21605
% 87.12/11.52 # Unit Clause-clause subsumption calls : 303057
% 87.12/11.52 # Rewrite failures with RHS unbound : 0
% 87.12/11.52 # BW rewrite match attempts : 13161
% 87.12/11.52 # BW rewrite match successes : 44
% 87.12/11.52 # Condensation attempts : 0
% 87.12/11.52 # Condensation successes : 0
% 87.12/11.52 # Termbank termtop insertions : 8637113
% 87.12/11.52
% 87.12/11.52 # -------------------------------------------------
% 87.12/11.52 # User time : 10.599 s
% 87.12/11.52 # System time : 0.237 s
% 87.12/11.52 # Total time : 10.837 s
% 87.12/11.52 # Maximum resident set size: 1652 pages
% 87.12/11.52
% 87.12/11.52 # -------------------------------------------------
% 87.12/11.52 # User time : 52.943 s
% 87.12/11.52 # System time : 1.082 s
% 87.12/11.52 # Total time : 54.025 s
% 87.12/11.52 # Maximum resident set size: 1700 pages
% 87.12/11.52 % E---3.1 exiting
% 87.12/11.52 % E---3.1 exiting
%------------------------------------------------------------------------------