%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD035-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:22:47 PM UTC 2026
% Result : Unsatisfiable 215.32s 31.88s
% Output : CNFRefutation 215.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 15
% Syntax : Number of clauses : 89 ( 36 unt; 20 nHn; 89 RR)
% Number of literals : 208 ( 0 equ; 105 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 107 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_multiplication,axiom,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',associativity_multiplication) ).
cnf(compatibility_of_equality_and_multiplication,axiom,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).
cnf(existence_of_inverse_multiplication,axiom,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_multiplication) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined) ).
cnf(existence_of_identity_multiplication,axiom,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_multiplication) ).
cnf(transitivity_of_equality,axiom,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(well_definedness_of_multiplicative_inverse,axiom,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse) ).
cnf(c_not_equal_to_additive_identity_5,negated_conjecture,
~ equalish(c,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_not_equal_to_additive_identity_5) ).
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(commutativity_multiplication,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',commutativity_multiplication) ).
cnf(well_definedness_of_multiplication,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplication) ).
cnf(multiply_equals_multiply_4,negated_conjecture,
equalish(multiply(a,c),multiply(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_equals_multiply_4) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(a_not_equal_to_b_6,negated_conjecture,
~ equalish(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_equal_to_b_6) ).
cnf(c_0_15,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_16,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_17,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_18,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3)) ),
c_0_15 ).
cnf(c_0_19,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_20,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_21,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_22,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
c_0_16 ).
cnf(c_0_23,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
c_0_17 ).
cnf(c_0_24,hypothesis,
( ~ defined(X1)
| ~ defined(X2)
| equalish(multiply(c,multiply(X1,X2)),multiply(multiply(c,X1),X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_26,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplicative_inverse]) ).
cnf(c_0_27,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
c_0_20 ).
cnf(c_0_28,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_21 ).
cnf(c_0_29,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(X1,additive_identity)
| equalish(multiply(multiply(X1,multiplicative_inverse(X1)),X2),multiply(multiplicative_identity,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,hypothesis,
( ~ defined(X1)
| equalish(multiply(c,multiply(X1,b)),multiply(multiply(c,X1),b)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
~ equalish(c,additive_identity),
inference(fof_simplification,[status(thm)],[c_not_equal_to_additive_identity_5]) ).
cnf(c_0_33,hypothesis,
equalish(multiply(multiplicative_identity,b),b),
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_34,plain,
( ~ equalish(X1,multiply(multiply(X3,multiplicative_inverse(X3)),X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X3,additive_identity)
| equalish(X1,multiply(multiplicative_identity,X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,hypothesis,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(c,multiply(multiplicative_inverse(X1),b)),multiply(multiply(c,multiplicative_inverse(X1)),b)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
~ equalish(c,additive_identity),
c_0_32 ).
cnf(c_0_37,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_38,hypothesis,
( ~ equalish(X1,multiply(multiplicative_identity,b))
| equalish(X1,b) ),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_39,hypothesis,
equalish(multiply(c,multiply(multiplicative_inverse(c),b)),multiply(multiplicative_identity,b)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_25]),c_0_19])]),c_0_36]) ).
cnf(c_0_40,plain,
( ~ defined(X2)
| ~ defined(X1)
| ~ defined(X3)
| equalish(X2,additive_identity)
| equalish(multiply(X1,multiply(multiplicative_inverse(X2),X3)),multiply(multiply(X1,multiplicative_inverse(X2)),X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_41,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_37 ).
cnf(c_0_42,hypothesis,
equalish(multiply(c,multiply(multiplicative_inverse(c),b)),b),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
( ~ equalish(X1,multiply(X2,multiply(multiplicative_inverse(X3),X4)))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X4)
| equalish(X3,additive_identity)
| equalish(X1,multiply(multiply(X2,multiplicative_inverse(X3)),X4)) ),
inference(spm,[status(thm)],[c_0_28,c_0_40]) ).
cnf(c_0_44,hypothesis,
equalish(b,multiply(c,multiply(multiplicative_inverse(c),b))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).
cnf(c_0_46,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplication]) ).
cnf(c_0_47,hypothesis,
equalish(b,multiply(multiply(c,multiplicative_inverse(c)),b)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_25]),c_0_19])]),c_0_36]) ).
cnf(c_0_48,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
c_0_45 ).
cnf(c_0_49,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
c_0_46 ).
cnf(c_0_50,hypothesis,
equalish(multiply(multiply(c,multiplicative_inverse(c)),b),b),
inference(spm,[status(thm)],[c_0_41,c_0_47]) ).
cnf(c_0_51,plain,
( ~ defined(X2)
| ~ defined(X3)
| ~ defined(X1)
| equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,hypothesis,
( ~ equalish(X1,multiply(multiply(c,multiplicative_inverse(c)),b))
| equalish(X1,b) ),
inference(spm,[status(thm)],[c_0_28,c_0_50]) ).
cnf(c_0_53,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(X3,additive_identity)
| equalish(multiply(X1,multiply(X2,multiplicative_inverse(X3))),multiply(multiply(X2,multiplicative_inverse(X3)),X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_31]) ).
cnf(c_0_54,plain,
( ~ defined(X3)
| ~ defined(X1)
| ~ defined(X2)
| equalish(X3,additive_identity)
| equalish(multiply(X1,multiply(X2,multiplicative_inverse(X3))),multiply(multiply(X1,X2),multiplicative_inverse(X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_55,hypothesis,
equalish(multiply(b,multiply(c,multiplicative_inverse(c))),b),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_25]),c_0_19])]),c_0_36]) ).
cnf(c_0_56,plain,
( ~ equalish(X1,multiply(X2,multiply(X3,multiplicative_inverse(X4))))
| ~ defined(X4)
| ~ defined(X2)
| ~ defined(X3)
| equalish(X4,additive_identity)
| equalish(X1,multiply(multiply(X2,X3),multiplicative_inverse(X4))) ),
inference(spm,[status(thm)],[c_0_28,c_0_54]) ).
cnf(c_0_57,hypothesis,
equalish(b,multiply(b,multiply(c,multiplicative_inverse(c)))),
inference(spm,[status(thm)],[c_0_41,c_0_55]) ).
cnf(c_0_58,hypothesis,
equalish(b,multiply(multiply(b,c),multiplicative_inverse(c))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_19]),c_0_25])]),c_0_36]) ).
cnf(c_0_59,negated_conjecture,
equalish(multiply(a,c),multiply(b,c)),
multiply_equals_multiply_4 ).
cnf(c_0_60,hypothesis,
equalish(multiply(multiply(b,c),multiplicative_inverse(c)),b),
inference(spm,[status(thm)],[c_0_41,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
( ~ defined(X1)
| equalish(multiply(multiply(a,c),X1),multiply(multiply(b,c),X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_59]) ).
cnf(c_0_62,hypothesis,
( ~ equalish(X1,multiply(multiply(b,c),multiplicative_inverse(c)))
| equalish(X1,b) ),
inference(spm,[status(thm)],[c_0_28,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(multiply(a,c),multiplicative_inverse(X1)),multiply(multiply(b,c),multiplicative_inverse(X1))) ),
inference(spm,[status(thm)],[c_0_61,c_0_31]) ).
cnf(c_0_64,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(X2,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X2)),multiply(multiplicative_inverse(X2),X1)) ),
inference(spm,[status(thm)],[c_0_48,c_0_31]) ).
cnf(c_0_65,negated_conjecture,
equalish(multiply(multiply(a,c),multiplicative_inverse(c)),b),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_19])]),c_0_36]) ).
cnf(c_0_66,plain,
( ~ equalish(X1,multiply(X3,multiplicative_inverse(X2)))
| ~ defined(X2)
| ~ defined(X3)
| equalish(X2,additive_identity)
| equalish(X1,multiply(multiplicative_inverse(X2),X3)) ),
inference(spm,[status(thm)],[c_0_28,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
equalish(b,multiply(multiply(a,c),multiplicative_inverse(c))),
inference(spm,[status(thm)],[c_0_41,c_0_65]) ).
cnf(c_0_68,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(X1,additive_identity)
| equalish(multiply(multiplicative_inverse(X1),multiply(X2,X3)),multiply(multiply(multiplicative_inverse(X1),X2),X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_69,negated_conjecture,
( ~ defined(multiply(a,c))
| equalish(b,multiply(multiplicative_inverse(c),multiply(a,c))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_19])]),c_0_36]) ).
cnf(c_0_70,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_71,plain,
( ~ equalish(X1,multiply(multiplicative_inverse(X2),multiply(X3,X4)))
| ~ defined(X2)
| ~ defined(X3)
| ~ defined(X4)
| equalish(X2,additive_identity)
| equalish(X1,multiply(multiply(multiplicative_inverse(X2),X3),X4)) ),
inference(spm,[status(thm)],[c_0_28,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
equalish(b,multiply(multiplicative_inverse(c),multiply(a,c))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_49]),c_0_19]),c_0_70])]) ).
cnf(c_0_73,negated_conjecture,
equalish(b,multiply(multiply(multiplicative_inverse(c),a),c)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_19]),c_0_70])]),c_0_36]) ).
cnf(c_0_74,hypothesis,
( ~ defined(X1)
| equalish(multiply(c,X1),multiply(X1,c)) ),
inference(spm,[status(thm)],[c_0_48,c_0_19]) ).
cnf(c_0_75,negated_conjecture,
equalish(multiply(multiply(multiplicative_inverse(c),a),c),b),
inference(spm,[status(thm)],[c_0_41,c_0_73]) ).
cnf(c_0_76,hypothesis,
( ~ defined(X1)
| ~ defined(X2)
| equalish(multiply(c,multiply(X1,X2)),multiply(multiply(X1,X2),c)) ),
inference(spm,[status(thm)],[c_0_74,c_0_49]) ).
cnf(c_0_77,negated_conjecture,
( ~ equalish(X1,multiply(multiply(multiplicative_inverse(c),a),c))
| equalish(X1,b) ),
inference(spm,[status(thm)],[c_0_28,c_0_75]) ).
cnf(c_0_78,hypothesis,
( ~ defined(X1)
| ~ defined(X2)
| equalish(X1,additive_identity)
| equalish(multiply(c,multiply(multiplicative_inverse(X1),X2)),multiply(multiply(multiplicative_inverse(X1),X2),c)) ),
inference(spm,[status(thm)],[c_0_76,c_0_31]) ).
cnf(c_0_79,hypothesis,
equalish(multiply(c,multiply(multiplicative_inverse(c),a)),b),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_70]),c_0_19])]),c_0_36]) ).
cnf(c_0_80,hypothesis,
equalish(b,multiply(c,multiply(multiplicative_inverse(c),a))),
inference(spm,[status(thm)],[c_0_41,c_0_79]) ).
cnf(c_0_81,hypothesis,
equalish(multiply(multiplicative_identity,a),a),
inference(spm,[status(thm)],[c_0_27,c_0_70]) ).
cnf(c_0_82,hypothesis,
equalish(b,multiply(multiply(c,multiplicative_inverse(c)),a)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_80]),c_0_70]),c_0_19])]),c_0_36]) ).
cnf(c_0_83,hypothesis,
( ~ equalish(X1,multiply(multiplicative_identity,a))
| equalish(X1,a) ),
inference(spm,[status(thm)],[c_0_28,c_0_81]) ).
cnf(c_0_84,hypothesis,
equalish(b,multiply(multiplicative_identity,a)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_82]),c_0_70]),c_0_19])]),c_0_36]) ).
cnf(c_0_85,negated_conjecture,
~ equalish(a,b),
inference(fof_simplification,[status(thm)],[a_not_equal_to_b_6]) ).
cnf(c_0_86,hypothesis,
equalish(b,a),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_87,negated_conjecture,
~ equalish(a,b),
c_0_85 ).
cnf(c_0_88,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_86]),c_0_87]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : FLD035-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n020.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 15:40:19 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.54 Running first-order theorem proving
% 0.27/0.54 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/benchmark/theBenchmark.p
% 215.32/31.88 % Version: 3.5.1
% 215.32/31.88 % Preprocessing class: FSMSSMSSSSSNFFN.
% 215.32/31.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 215.32/31.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 215.32/31.88 % Starting new_bool_3 with 300s (1) cores
% 215.32/31.88 % Starting new_bool_1 with 300s (1) cores
% 215.32/31.88 % Starting sh5l with 300s (1) cores
% 215.32/31.88 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3284467 completed with status 0
% 215.32/31.88 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 215.32/31.88 % Preprocessing class: FSMSSMSSSSSNFFN.
% 215.32/31.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 215.32/31.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 215.32/31.88 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 215.32/31.88 % No SInE strategy applied
% 215.32/31.88 % Search class: FGUNF-FFMM21-SFFFFFNN
% 215.32/31.88 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 215.32/31.88 % Starting SubtermCWHack with 136s (1) cores
% 215.32/31.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 215.32/31.88 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 215.32/31.88 % Starting new_bool_3 with 269s (1) cores
% 215.32/31.88 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 215.32/31.88 % G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with pid 3284478 completed with status 0
% 215.32/31.88 % Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN
% 215.32/31.88 % Preprocessing class: FSMSSMSSSSSNFFN.
% 215.32/31.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 215.32/31.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 215.32/31.88 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 215.32/31.88 % No SInE strategy applied
% 215.32/31.88 % Search class: FGUNF-FFMM21-SFFFFFNN
% 215.32/31.88 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 215.32/31.88 % Starting SubtermCWHack with 136s (1) cores
% 215.32/31.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 215.32/31.88 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 215.32/31.88 % Starting new_bool_3 with 269s (1) cores
% 215.32/31.88 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 215.32/31.88 % Preprocessing time : 0.001 s
% 215.32/31.88 % Presaturation interreduction done
% 215.32/31.88
% 215.32/31.88 % Proof found!
% 215.32/31.88 % SZS status Unsatisfiable
% 215.32/31.88 % SZS output start CNFRefutation
% See solution above
% 215.32/31.88 % Parsed axioms : 33
% 215.32/31.88 % Removed by relevancy pruning/SinE : 0
% 215.32/31.88 % Initial clauses : 33
% 215.32/31.88 % Removed in clause preprocessing : 0
% 215.32/31.88 % Initial clauses in saturation : 33
% 215.32/31.88 % Processed clauses : 104061
% 215.32/31.88 % ...of these trivial : 46091
% 215.32/31.88 % ...subsumed : 10512
% 215.32/31.88 % ...remaining for further processing : 47458
% 215.32/31.88 % Other redundant clauses eliminated : 0
% 215.32/31.88 % Clauses deleted for lack of memory : 0
% 215.32/31.88 % Backward-subsumed : 26
% 215.32/31.88 % Backward-rewritten : 299
% 215.32/31.88 % Generated clauses : 1295346
% 215.32/31.88 % ...of the previous two non-redundant : 1113821
% 215.32/31.88 % ...aggressively subsumed : 0
% 215.32/31.88 % Contextual simplify-reflections : 182
% 215.32/31.88 % Paramodulations : 1295336
% 215.32/31.88 % Factorizations : 10
% 215.32/31.88 % NegExts : 0
% 215.32/31.88 % Equation resolutions : 0
% 215.32/31.88 % Disequality decompositions : 0
% 215.32/31.88 % Total rewrite steps : 503887
% 215.32/31.88 % ...of those cached : 477461
% 215.32/31.88 % Propositional unsat checks : 0
% 215.32/31.88 % Propositional check models : 0
% 215.32/31.88 % Propositional check unsatisfiable : 0
% 215.32/31.88 % Propositional clauses : 0
% 215.32/31.88 % Propositional clauses after purity: 0
% 215.32/31.88 % Propositional unsat core size : 0
% 215.32/31.88 % Propositional preprocessing time : 0.000
% 215.32/31.88 % Propositional encoding time : 0.000
% 215.32/31.88 % Propositional solver time : 0.000
% 215.32/31.88 % Success case prop preproc time : 0.000
% 215.32/31.88 % Success case prop encoding time : 0.000
% 215.32/31.88 % Success case prop solver time : 0.000
% 215.32/31.88 % Current number of processed clauses : 47100
% 215.32/31.88 % Positive orientable unit clauses : 27977
% 215.32/31.88 % Positive unorientable unit clauses: 0
% 215.32/31.88 % Negative unit clauses : 3
% 215.32/31.88 % Non-unit-clauses : 19120
% 215.32/31.88 % Current number of unprocessed clauses: 1009823
% 215.32/31.88 % ...number of literals in the above : 2290039
% 215.32/31.88 % Current number of archived formulas : 0
% 215.32/31.88 % Current number of archived clauses : 358
% 215.32/31.88 % Clause-clause subsumption calls (NU) : 15553938
% 215.32/31.88 % Rec. Clause-clause subsumption calls : 12647869
% 215.32/31.88 % Non-unit clause-clause subsumptions : 10720
% 215.32/31.88 % Unit Clause-clause subsumption calls : 3589177
% 215.32/31.88 % Rewrite failures with RHS unbound : 0
% 215.32/31.88 % BW rewrite match attempts : 803304
% 215.32/31.88 % BW rewrite match successes : 277
% 215.32/31.88 % Condensation attempts : 0
% 215.32/31.88 % Condensation successes : 0
% 215.32/31.88 % Termbank termtop insertions : 23868328
% 215.32/31.88 % Search garbage collected termcells : 73
% 215.32/31.88
% 215.32/31.88 % -------------------------------------------------
% 215.32/31.88 % User time : 29.814 s
% 215.32/31.88 % System time : 0.898 s
% 215.32/31.88 % Total time : 30.711 s
% 215.32/31.88 % Maximum resident set size: 3660 pages
% 215.32/31.88
% 215.32/31.88 % -------------------------------------------------
% 215.32/31.88 % User time : 149.507 s
% 215.32/31.88 % System time : 5.506 s
% 215.32/31.88 % Total time : 155.013 s
% 215.32/31.88 % Maximum resident set size: 4864 pages
% 215.32/31.88 % E exiting
%------------------------------------------------------------------------------