%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD063-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 : n007.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:23 PM UTC 2026
% Result : Unsatisfiable 104.87s 15.61s
% Output : CNFRefutation 104.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 18
% Syntax : Number of clauses : 89 ( 15 unt; 3 nHn; 89 RR)
% Number of literals : 224 ( 0 equ; 135 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 146 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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_identity_addition,axiom,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).
cnf(compatibility_of_equality_and_addition,axiom,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_addition) ).
cnf(existence_of_inverse_addition,axiom,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(associativity_addition,axiom,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',associativity_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
cnf(commutativity_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
cnf(totality_of_order_relation,axiom,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
cnf(well_definedness_of_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_addition) ).
cnf(transitivity_of_order_relation,axiom,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_order_relation) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(additive_inverse(b),additive_inverse(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(not_less_or_equal_4,negated_conjecture,
~ less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_4) ).
cnf(c_0_18,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_19,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_20,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_addition]) ).
cnf(c_0_21,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_22,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_18 ).
cnf(c_0_23,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_19 ).
cnf(c_0_24,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
c_0_20 ).
cnf(c_0_25,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_21 ).
cnf(c_0_26,plain,
( ~ equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(X1,additive_inverse(X1)),X2),add(additive_identity,X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_29,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(X1,additive_inverse(X1)),X2),X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
inference(fof_simplification,[status(thm)],[associativity_addition]) ).
cnf(c_0_31,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_32,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_33,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_order_relation]) ).
cnf(c_0_34,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_28 ).
cnf(c_0_35,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[totality_of_order_relation]) ).
cnf(c_0_36,plain,
( ~ equalish(X1,add(add(X3,additive_inverse(X3)),X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_37,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
c_0_30 ).
cnf(c_0_38,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_31 ).
cnf(c_0_39,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_32 ).
cnf(c_0_40,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_addition]) ).
cnf(c_0_41,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_33 ).
cnf(c_0_42,plain,
( ~ defined(X1)
| equalish(additive_identity,add(X1,additive_inverse(X1))) ),
inference(spm,[status(thm)],[c_0_34,c_0_25]) ).
cnf(c_0_43,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_35 ).
cnf(c_0_44,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(X1,add(additive_inverse(X1),X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_45,plain,
( ~ equalish(X1,add(X3,X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_22,c_0_39]) ).
cnf(c_0_46,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(add(X1,X2),X3),add(add(X2,X1),X3)) ),
inference(spm,[status(thm)],[c_0_24,c_0_39]) ).
cnf(c_0_47,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
c_0_40 ).
cnf(c_0_48,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_order_relation]) ).
cnf(c_0_49,plain,
( ~ defined(X1)
| ~ less_or_equal(additive_identity,X2)
| less_or_equal(add(X1,additive_inverse(X1)),X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,plain,
( ~ defined(X1)
| less_or_equal(X1,X1) ),
inference(ef,[status(thm)],[c_0_43]) ).
cnf(c_0_51,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_52,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
cnf(c_0_53,plain,
( ~ equalish(X1,add(X3,add(additive_inverse(X3),X2)))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_44]) ).
cnf(c_0_54,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(add(X1,X2),X3),add(X3,add(X2,X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_55,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
c_0_48 ).
cnf(c_0_56,plain,
( ~ defined(X1)
| less_or_equal(add(X1,additive_inverse(X1)),additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_57,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
c_0_52 ).
cnf(c_0_58,negated_conjecture,
less_or_equal(additive_inverse(b),additive_inverse(a)),
less_or_equal_3 ).
cnf(c_0_59,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(add(X1,additive_inverse(X2)),X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_38]) ).
cnf(c_0_60,plain,
( ~ defined(X1)
| equalish(additive_identity,add(additive_inverse(X1),X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_42]),c_0_38]) ).
cnf(c_0_61,plain,
( ~ defined(X2)
| ~ less_or_equal(X1,add(X2,additive_inverse(X2)))
| less_or_equal(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,negated_conjecture,
( ~ defined(X1)
| less_or_equal(add(additive_inverse(b),X1),add(additive_inverse(a),X1)) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,plain,
( ~ equalish(X1,add(add(X2,additive_inverse(X3)),X3))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_59]) ).
cnf(c_0_64,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(additive_identity,X1),add(add(additive_inverse(X2),X2),X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_60]) ).
cnf(c_0_65,negated_conjecture,
( ~ defined(additive_inverse(a))
| less_or_equal(add(additive_inverse(b),additive_inverse(additive_inverse(a))),additive_identity) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_38]) ).
cnf(c_0_66,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_67,plain,
( ~ defined(X1)
| ~ defined(additive_inverse(additive_inverse(X1)))
| equalish(add(additive_identity,X1),additive_inverse(additive_inverse(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_38]) ).
cnf(c_0_68,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(additive_inverse(X1),X2),X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_46]),c_0_38]) ).
cnf(c_0_69,negated_conjecture,
less_or_equal(add(additive_inverse(b),additive_inverse(additive_inverse(a))),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_38]),c_0_66])]) ).
cnf(c_0_70,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),additive_inverse(additive_inverse(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_38]),c_0_38]) ).
cnf(c_0_71,plain,
( ~ defined(X1)
| equalish(X1,add(additive_identity,X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_23]) ).
cnf(c_0_72,plain,
( ~ defined(X3)
| ~ defined(X1)
| ~ less_or_equal(add(add(additive_inverse(X3),X1),X3),X2)
| less_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_68]) ).
cnf(c_0_73,negated_conjecture,
( ~ defined(X1)
| less_or_equal(add(add(additive_inverse(b),additive_inverse(additive_inverse(a))),X1),add(additive_identity,X1)) ),
inference(spm,[status(thm)],[c_0_57,c_0_69]) ).
cnf(c_0_74,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_75,plain,
( ~ equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| equalish(X1,additive_inverse(additive_inverse(X2))) ),
inference(spm,[status(thm)],[c_0_22,c_0_70]) ).
cnf(c_0_76,plain,
( ~ defined(X1)
| ~ less_or_equal(X1,X2)
| less_or_equal(add(additive_identity,X1),X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_71]) ).
cnf(c_0_77,negated_conjecture,
( ~ defined(additive_inverse(additive_inverse(a)))
| less_or_equal(additive_inverse(additive_inverse(a)),add(additive_identity,b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).
cnf(c_0_78,plain,
( ~ defined(X1)
| equalish(X1,additive_inverse(additive_inverse(X1))) ),
inference(spm,[status(thm)],[c_0_75,c_0_71]) ).
cnf(c_0_79,plain,
( ~ defined(X1)
| less_or_equal(add(additive_identity,X1),X1) ),
inference(spm,[status(thm)],[c_0_76,c_0_50]) ).
cnf(c_0_80,negated_conjecture,
( ~ defined(additive_inverse(a))
| less_or_equal(additive_inverse(additive_inverse(a)),add(additive_identity,b)) ),
inference(spm,[status(thm)],[c_0_77,c_0_38]) ).
cnf(c_0_81,plain,
( ~ defined(X1)
| equalish(additive_inverse(additive_inverse(X1)),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_78]) ).
cnf(c_0_82,plain,
( ~ defined(X2)
| ~ less_or_equal(X1,add(additive_identity,X2))
| less_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_79]) ).
cnf(c_0_83,negated_conjecture,
less_or_equal(additive_inverse(additive_inverse(a)),add(additive_identity,b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_38]),c_0_66])]) ).
cnf(c_0_84,negated_conjecture,
~ less_or_equal(a,b),
inference(fof_simplification,[status(thm)],[not_less_or_equal_4]) ).
cnf(c_0_85,plain,
( ~ defined(X1)
| ~ less_or_equal(additive_inverse(additive_inverse(X1)),X2)
| less_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_81]) ).
cnf(c_0_86,negated_conjecture,
less_or_equal(additive_inverse(additive_inverse(a)),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_74])]) ).
cnf(c_0_87,negated_conjecture,
~ less_or_equal(a,b),
c_0_84 ).
cnf(c_0_88,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_66])]),c_0_87]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD063-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 15:42:05 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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
% 104.87/15.61 % Version: 3.5.1
% 104.87/15.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 104.87/15.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 104.87/15.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 104.87/15.61 % Starting new_bool_3 with 300s (1) cores
% 104.87/15.61 % Starting new_bool_1 with 300s (1) cores
% 104.87/15.61 % Starting sh5l with 300s (1) cores
% 104.87/15.61 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1452682 completed with status 0
% 104.87/15.61 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 104.87/15.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 104.87/15.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 104.87/15.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 104.87/15.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 104.87/15.61 % No SInE strategy applied
% 104.87/15.61 % Search class: FGUNF-FFMS21-SFFFFFNN
% 104.87/15.61 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 104.87/15.61 % Starting SubtermCWHack with 136s (1) cores
% 104.87/15.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 104.87/15.61 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 104.87/15.61 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 104.87/15.61 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 104.87/15.61 % G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 1452689 completed with status 0
% 104.87/15.61 % Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 104.87/15.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 104.87/15.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 104.87/15.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 104.87/15.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 104.87/15.61 % No SInE strategy applied
% 104.87/15.61 % Search class: FGUNF-FFMS21-SFFFFFNN
% 104.87/15.61 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 104.87/15.61 % Starting SubtermCWHack with 136s (1) cores
% 104.87/15.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 104.87/15.61 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 104.87/15.61 % Preprocessing time : 0.001 s
% 104.87/15.61 % Presaturation interreduction done
% 104.87/15.61
% 104.87/15.61 % Proof found!
% 104.87/15.61 % SZS status Unsatisfiable
% 104.87/15.61 % SZS output start CNFRefutation
% See solution above
% 104.87/15.61 % Parsed axioms : 31
% 104.87/15.61 % Removed by relevancy pruning/SinE : 0
% 104.87/15.61 % Initial clauses : 31
% 104.87/15.61 % Removed in clause preprocessing : 0
% 104.87/15.61 % Initial clauses in saturation : 31
% 104.87/15.61 % Processed clauses : 40312
% 104.87/15.61 % ...of these trivial : 3080
% 104.87/15.61 % ...subsumed : 27074
% 104.87/15.61 % ...remaining for further processing : 10158
% 104.87/15.61 % Other redundant clauses eliminated : 0
% 104.87/15.61 % Clauses deleted for lack of memory : 0
% 104.87/15.61 % Backward-subsumed : 883
% 104.87/15.61 % Backward-rewritten : 575
% 104.87/15.61 % Generated clauses : 1165919
% 104.87/15.61 % ...of the previous two non-redundant : 1022836
% 104.87/15.61 % ...aggressively subsumed : 0
% 104.87/15.61 % Contextual simplify-reflections : 382
% 104.87/15.61 % Paramodulations : 1165847
% 104.87/15.61 % Factorizations : 72
% 104.87/15.61 % NegExts : 0
% 104.87/15.61 % Equation resolutions : 0
% 104.87/15.61 % Disequality decompositions : 0
% 104.87/15.61 % Total rewrite steps : 407987
% 104.87/15.61 % ...of those cached : 406914
% 104.87/15.61 % Propositional unsat checks : 0
% 104.87/15.61 % Propositional check models : 0
% 104.87/15.61 % Propositional check unsatisfiable : 0
% 104.87/15.61 % Propositional clauses : 0
% 104.87/15.61 % Propositional clauses after purity: 0
% 104.87/15.61 % Propositional unsat core size : 0
% 104.87/15.61 % Propositional preprocessing time : 0.000
% 104.87/15.61 % Propositional encoding time : 0.000
% 104.87/15.61 % Propositional solver time : 0.000
% 104.87/15.61 % Success case prop preproc time : 0.000
% 104.87/15.61 % Success case prop encoding time : 0.000
% 104.87/15.61 % Success case prop solver time : 0.000
% 104.87/15.61 % Current number of processed clauses : 8669
% 104.87/15.61 % Positive orientable unit clauses : 1074
% 104.87/15.61 % Positive unorientable unit clauses: 0
% 104.87/15.61 % Negative unit clauses : 2
% 104.87/15.61 % Non-unit-clauses : 7593
% 104.87/15.61 % Current number of unprocessed clauses: 981927
% 104.87/15.61 % ...number of literals in the above : 3386444
% 104.87/15.61 % Current number of archived formulas : 0
% 104.87/15.61 % Current number of archived clauses : 1489
% 104.87/15.61 % Clause-clause subsumption calls (NU) : 4277714
% 104.87/15.61 % Rec. Clause-clause subsumption calls : 2788359
% 104.87/15.61 % Non-unit clause-clause subsumptions : 28339
% 104.87/15.61 % Unit Clause-clause subsumption calls : 109898
% 104.87/15.61 % Rewrite failures with RHS unbound : 0
% 104.87/15.61 % BW rewrite match attempts : 2964
% 104.87/15.61 % BW rewrite match successes : 487
% 104.87/15.61 % Condensation attempts : 0
% 104.87/15.61 % Condensation successes : 0
% 104.87/15.61 % Termbank termtop insertions : 20182862
% 104.87/15.61 % Search garbage collected termcells : 71
% 104.87/15.61
% 104.87/15.61 % -------------------------------------------------
% 104.87/15.61 % User time : 14.037 s
% 104.87/15.61 % System time : 0.604 s
% 104.87/15.61 % Total time : 14.641 s
% 104.87/15.61 % Maximum resident set size: 3608 pages
% 104.87/15.61
% 104.87/15.61 % -------------------------------------------------
% 104.87/15.61 % User time : 72.129 s
% 104.87/15.61 % System time : 2.363 s
% 104.87/15.61 % Total time : 74.492 s
% 104.87/15.61 % Maximum resident set size: 4864 pages
% 104.87/15.61 % E exiting
%------------------------------------------------------------------------------