%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD026-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:23:12 PM UTC 2026
% Result : Unsatisfiable 203.86s 35.55s
% Output : CNFRefutation 203.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 14
% Syntax : Number of clauses : 80 ( 20 unt; 19 nHn; 80 RR)
% Number of literals : 185 ( 0 equ; 92 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(transitivity_of_equality,axiom,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(existence_of_inverse_multiplication,axiom,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_multiplication) ).
cnf(compatibility_of_equality_and_multiplication,axiom,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).
cnf(a_equals_b_4,negated_conjecture,
equalish(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_equals_b_4) ).
cnf(a_not_equal_to_additive_identity_3,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_3) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(well_definedness_of_multiplicative_inverse,axiom,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse) ).
cnf(commutativity_multiplication,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',commutativity_multiplication) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(existence_of_identity_multiplication,axiom,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_identity_multiplication) ).
cnf(associativity_multiplication,axiom,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',associativity_multiplication) ).
cnf(well_definedness_of_multiplication,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplication) ).
cnf(multiplicative_inverses_not_equal,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_inverse(b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_inverses_not_equal) ).
cnf(c_0_14,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_15,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_16,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_multiplication]) ).
cnf(c_0_17,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_multiplication]) ).
cnf(c_0_18,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_14 ).
cnf(c_0_19,negated_conjecture,
equalish(a,b),
a_equals_b_4 ).
cnf(c_0_20,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_15 ).
cnf(c_0_21,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
c_0_16 ).
cnf(c_0_22,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
equalish(b,a),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
~ equalish(a,additive_identity),
inference(fof_simplification,[status(thm)],[a_not_equal_to_additive_identity_3]) ).
cnf(c_0_25,plain,
( ~ equalish(X2,multiply(X1,multiplicative_inverse(X1)))
| ~ defined(X1)
| equalish(X2,multiplicative_identity)
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( ~ defined(X1)
| equalish(multiply(b,X1),multiply(a,X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_28,negated_conjecture,
~ equalish(a,additive_identity),
c_0_24 ).
cnf(c_0_29,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplicative_inverse]) ).
cnf(c_0_30,negated_conjecture,
( ~ defined(multiplicative_inverse(a))
| equalish(multiply(b,multiplicative_inverse(a)),multiplicative_identity) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_31,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
c_0_29 ).
cnf(c_0_32,negated_conjecture,
equalish(multiply(b,multiplicative_inverse(a)),multiplicative_identity),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27])]),c_0_28]) ).
cnf(c_0_33,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).
cnf(c_0_34,negated_conjecture,
( ~ equalish(X1,multiply(b,multiplicative_inverse(a)))
| equalish(X1,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_20,c_0_32]) ).
cnf(c_0_35,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
c_0_33 ).
cnf(c_0_36,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_37,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_38,negated_conjecture,
( ~ defined(multiplicative_inverse(a))
| equalish(multiply(multiplicative_inverse(a),b),multiplicative_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_39,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
c_0_37 ).
cnf(c_0_40,negated_conjecture,
equalish(multiply(multiplicative_inverse(a),b),multiplicative_identity),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_31]),c_0_27])]),c_0_28]) ).
cnf(c_0_41,plain,
( ~ equalish(X1,multiply(multiplicative_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
( ~ defined(X1)
| equalish(multiply(multiply(multiplicative_inverse(a),b),X1),multiply(multiplicative_identity,X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( ~ equalish(X1,a)
| equalish(X1,b) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_44,negated_conjecture,
( ~ defined(X1)
| equalish(multiply(multiply(multiplicative_inverse(a),b),X1),X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3)) ),
inference(fof_simplification,[status(thm)],[associativity_multiplication]) ).
cnf(c_0_46,negated_conjecture,
equalish(b,b),
inference(spm,[status(thm)],[c_0_43,c_0_23]) ).
cnf(c_0_47,negated_conjecture,
( ~ equalish(X1,multiply(multiply(multiplicative_inverse(a),b),X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_44]) ).
cnf(c_0_48,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3)) ),
c_0_45 ).
cnf(c_0_49,negated_conjecture,
( ~ defined(X1)
| equalish(multiply(b,X1),multiply(b,X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( ~ defined(X1)
| ~ defined(multiplicative_inverse(a))
| equalish(multiply(multiplicative_inverse(a),multiply(b,X1)),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_36])]) ).
cnf(c_0_51,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplication]) ).
cnf(c_0_52,negated_conjecture,
( ~ defined(multiplicative_inverse(b))
| equalish(b,additive_identity)
| equalish(multiply(b,multiplicative_inverse(b)),multiplicative_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_49]),c_0_36])]) ).
cnf(c_0_53,negated_conjecture,
( ~ defined(X1)
| equalish(multiply(multiplicative_inverse(a),multiply(b,X1)),X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_31]),c_0_27])]),c_0_28]) ).
cnf(c_0_54,plain,
( ~ equalish(X1,multiply(X3,X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,multiply(X2,X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_35]) ).
cnf(c_0_55,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(multiply(multiply(X1,X2),X3),multiply(multiply(X2,X1),X3)) ),
inference(spm,[status(thm)],[c_0_22,c_0_35]) ).
cnf(c_0_56,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
c_0_51 ).
cnf(c_0_57,negated_conjecture,
( equalish(b,additive_identity)
| equalish(multiply(b,multiplicative_inverse(b)),multiplicative_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_31]),c_0_36])]) ).
cnf(c_0_58,negated_conjecture,
( ~ equalish(X1,multiply(multiplicative_inverse(a),multiply(b,X2)))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_53]) ).
cnf(c_0_59,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(multiply(multiply(X1,X2),X3),multiply(X3,multiply(X2,X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( equalish(b,additive_identity)
| equalish(multiplicative_identity,multiply(b,multiplicative_inverse(b))) ),
inference(spm,[status(thm)],[c_0_18,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
( ~ defined(X1)
| ~ defined(multiplicative_inverse(a))
| equalish(multiply(multiply(X1,b),multiplicative_inverse(a)),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_36])]) ).
cnf(c_0_62,negated_conjecture,
( ~ defined(multiplicative_inverse(b))
| equalish(b,additive_identity)
| equalish(multiplicative_identity,multiply(multiplicative_inverse(b),b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_60]),c_0_36])]) ).
cnf(c_0_63,negated_conjecture,
( ~ defined(X1)
| equalish(multiply(multiply(X1,b),multiplicative_inverse(a)),X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_31]),c_0_27])]),c_0_28]) ).
cnf(c_0_64,negated_conjecture,
( equalish(b,additive_identity)
| equalish(multiplicative_identity,multiply(multiplicative_inverse(b),b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_31]),c_0_36])]) ).
cnf(c_0_65,negated_conjecture,
( ~ equalish(X1,multiply(multiply(X2,b),multiplicative_inverse(a)))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
( ~ defined(X1)
| equalish(b,additive_identity)
| equalish(multiply(multiplicative_identity,X1),multiply(multiply(multiplicative_inverse(b),b),X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
( ~ defined(multiplicative_inverse(a))
| ~ defined(multiplicative_inverse(b))
| equalish(b,additive_identity)
| equalish(multiply(multiplicative_identity,multiplicative_inverse(a)),multiplicative_inverse(b)) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_68,negated_conjecture,
( ~ defined(multiplicative_inverse(a))
| equalish(b,additive_identity)
| equalish(multiply(multiplicative_identity,multiplicative_inverse(a)),multiplicative_inverse(b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_31]),c_0_36])]) ).
cnf(c_0_69,negated_conjecture,
( equalish(b,additive_identity)
| equalish(multiply(multiplicative_identity,multiplicative_inverse(a)),multiplicative_inverse(b)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_31]),c_0_27])]),c_0_28]) ).
cnf(c_0_70,negated_conjecture,
( equalish(b,additive_identity)
| equalish(multiplicative_inverse(b),multiply(multiplicative_identity,multiplicative_inverse(a))) ),
inference(spm,[status(thm)],[c_0_18,c_0_69]) ).
cnf(c_0_71,negated_conjecture,
( ~ defined(multiplicative_inverse(a))
| equalish(b,additive_identity)
| equalish(multiplicative_inverse(b),multiplicative_inverse(a)) ),
inference(spm,[status(thm)],[c_0_41,c_0_70]) ).
cnf(c_0_72,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_inverse(b)),
inference(fof_simplification,[status(thm)],[multiplicative_inverses_not_equal]) ).
cnf(c_0_73,negated_conjecture,
( equalish(b,additive_identity)
| equalish(multiplicative_inverse(b),multiplicative_inverse(a)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_31]),c_0_27])]),c_0_28]) ).
cnf(c_0_74,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_inverse(b)),
c_0_72 ).
cnf(c_0_75,negated_conjecture,
equalish(b,additive_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_73]),c_0_74]) ).
cnf(c_0_76,negated_conjecture,
( ~ equalish(X1,b)
| equalish(X1,a) ),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_77,negated_conjecture,
equalish(additive_identity,b),
inference(spm,[status(thm)],[c_0_18,c_0_75]) ).
cnf(c_0_78,negated_conjecture,
equalish(additive_identity,a),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_79,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_78]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD026-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.55 % Computer : n008.cluster.edu
% 0.10/0.55 % Model : x86_64 x86_64
% 0.10/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.55 % Memory : 8046.5625MB
% 0.10/0.55 % OS : Linux 6.8.0-71-generic
% 0.10/0.55 % CPULimit : 300
% 0.10/0.55 % WCLimit : 300
% 0.10/0.55 % DateTime : Mon Sep 21 15:39:41 UTC 2026
% 0.10/0.56 % CPUTime :
% 0.10/0.56 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.60 Running first-order theorem proving
% 0.14/0.60 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 203.86/35.55 % Version: 3.5.1
% 203.86/35.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 203.86/35.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 203.86/35.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 203.86/35.55 % Starting new_bool_3 with 300s (1) cores
% 203.86/35.55 % Starting new_bool_1 with 300s (1) cores
% 203.86/35.55 % Starting sh5l with 300s (1) cores
% 203.86/35.55 % new_bool_3 with pid 1326860 completed with status 0
% 203.86/35.55 % Result found by new_bool_3
% 203.86/35.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 203.86/35.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 203.86/35.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 203.86/35.55 % Starting new_bool_3 with 300s (1) cores
% 203.86/35.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 203.86/35.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 203.86/35.55 % Search class: FGUNF-FFMS21-SFFFFFNN
% 203.86/35.55 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 203.86/35.55 % Starting SubtermCWHack with 28s (1) cores
% 203.86/35.55 % SubtermCWHack with pid 1326865 completed with status 8
% 203.86/35.55 % Starting new_bool_3 with 31s (1) cores
% 203.86/35.55 % new_bool_3 with pid 1327612 completed with status 0
% 203.86/35.55 % Result found by new_bool_3
% 203.86/35.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 203.86/35.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 203.86/35.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 203.86/35.55 % Starting new_bool_3 with 300s (1) cores
% 203.86/35.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 203.86/35.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 203.86/35.55 % Search class: FGUNF-FFMS21-SFFFFFNN
% 203.86/35.55 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 203.86/35.55 % Starting SubtermCWHack with 28s (1) cores
% 203.86/35.55 % SubtermCWHack with pid 1326865 completed with status 8
% 203.86/35.55 % Starting new_bool_3 with 31s (1) cores
% 203.86/35.55 % Preprocessing time : 0.002 s
% 203.86/35.55 % Presaturation interreduction done
% 203.86/35.55
% 203.86/35.55 % Proof found!
% 203.86/35.55 % SZS status Unsatisfiable
% 203.86/35.55 % SZS output start CNFRefutation
% See solution above
% 203.86/35.55 % Parsed axioms : 32
% 203.86/35.55 % Removed by relevancy pruning/SinE : 2
% 203.86/35.55 % Initial clauses : 30
% 203.86/35.55 % Removed in clause preprocessing : 0
% 203.86/35.55 % Initial clauses in saturation : 30
% 203.86/35.55 % Processed clauses : 16518
% 203.86/35.55 % ...of these trivial : 3408
% 203.86/35.55 % ...subsumed : 6729
% 203.86/35.55 % ...remaining for further processing : 6381
% 203.86/35.55 % Other redundant clauses eliminated : 0
% 203.86/35.55 % Clauses deleted for lack of memory : 0
% 203.86/35.55 % Backward-subsumed : 171
% 203.86/35.55 % Backward-rewritten : 1109
% 203.86/35.55 % Generated clauses : 247590
% 203.86/35.55 % ...of the previous two non-redundant : 205463
% 203.86/35.55 % ...aggressively subsumed : 0
% 203.86/35.55 % Contextual simplify-reflections : 55
% 203.86/35.55 % Paramodulations : 247570
% 203.86/35.55 % Factorizations : 20
% 203.86/35.55 % NegExts : 0
% 203.86/35.55 % Equation resolutions : 0
% 203.86/35.55 % Disequality decompositions : 0
% 203.86/35.55 % Total rewrite steps : 125608
% 203.86/35.55 % ...of those cached : 123971
% 203.86/35.55 % Propositional unsat checks : 1
% 203.86/35.55 % Propositional check models : 0
% 203.86/35.55 % Propositional check unsatisfiable : 0
% 203.86/35.55 % Propositional clauses : 0
% 203.86/35.55 % Propositional clauses after purity: 0
% 203.86/35.55 % Propositional unsat core size : 0
% 203.86/35.55 % Propositional preprocessing time : 0.000
% 203.86/35.55 % Propositional encoding time : 0.105
% 203.86/35.55 % Propositional solver time : 0.197
% 203.86/35.55 % Success case prop preproc time : 0.000
% 203.86/35.55 % Success case prop encoding time : 0.000
% 203.86/35.55 % Success case prop solver time : 0.000
% 203.86/35.55 % Current number of processed clauses : 5071
% 203.86/35.55 % Positive orientable unit clauses : 1668
% 203.86/35.55 % Positive unorientable unit clauses: 0
% 203.86/35.55 % Negative unit clauses : 3
% 203.86/35.55 % Non-unit-clauses : 3400
% 203.86/35.55 % Current number of unprocessed clauses: 188716
% 203.86/35.55 % ...number of literals in the above : 453765
% 203.86/35.55 % Current number of archived formulas : 0
% 203.86/35.55 % Current number of archived clauses : 1310
% 203.86/35.55 % Clause-clause subsumption calls (NU) : 889042
% 203.86/35.55 % Rec. Clause-clause subsumption calls : 765965
% 203.86/35.55 % Non-unit clause-clause subsumptions : 6955
% 203.86/35.55 % Unit Clause-clause subsumption calls : 119621
% 203.86/35.55 % Rewrite failures with RHS unbound : 0
% 203.86/35.55 % BW rewrite match attempts : 3181
% 203.86/35.55 % BW rewrite match successes : 498
% 203.86/35.55 % Condensation attempts : 0
% 203.86/35.55 % Condensation successes : 0
% 203.86/35.55 % Termbank termtop insertions : 4245374
% 203.86/35.55 % Search garbage collected termcells : 79
% 203.86/35.55
% 203.86/35.55 % -------------------------------------------------
% 203.86/35.55 % User time : 32.317 s
% 203.86/35.55 % System time : 1.373 s
% 203.86/35.55 % Total time : 33.691 s
% 203.86/35.55 % Maximum resident set size: 3660 pages
% 203.86/35.55
% 203.86/35.55 % -------------------------------------------------
% 203.86/35.55 % User time : 32.318 s
% 203.86/35.55 % System time : 1.379 s
% 203.86/35.55 % Total time : 33.697 s
% 203.86/35.55 % Maximum resident set size: 4864 pages
% 203.86/35.55 % E exiting
%------------------------------------------------------------------------------