%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO494+1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:28:21 PM UTC 2026
% Result : Theorem 3.25s 0.95s
% Output : CNFRefutation 3.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 69 ( 19 unt; 0 def)
% Number of atoms : 171 ( 6 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 192 ( 90 ~; 86 |; 16 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-4 aty)
% Number of variables : 262 ( 6 sgn 144 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSatz2_2,axiom,
! [X12,X15,X14,X17] :
( s_e(X14,X17,X12,X15)
| ~ s_e(X12,X15,X14,X17) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz2_2) ).
fof(aSatz2_4,axiom,
! [X12,X15,X14,X17] :
( s_e(X15,X12,X14,X17)
| ~ s_e(X12,X15,X14,X17) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz2_4) ).
fof(aA4,axiom,
! [X1,X2,X7,X4] :
( s_e(X2,ext(X1,X2,X7,X4),X7,X4)
& s_t(X1,X2,ext(X1,X2,X7,X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO011+0.ax',aA4) ).
fof(d_Defn5_4,axiom,
! [X12,X15,X14,X17,X2] :
( ( le(X12,X15,X14,X17)
| ~ s_e(X12,X15,X14,X2)
| ~ s_t(X14,X2,X17) )
& ( s_e(X12,X15,X14,insert(X12,X15,X14,X17))
| ~ le(X12,X15,X14,X17) )
& ( s_t(X14,insert(X12,X15,X14,X17),X17)
| ~ le(X12,X15,X14,X17) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_Defn5_4) ).
fof(aSatz5_5b,axiom,
! [X12,X15,X14,X17,X18] :
( ~ s_e(X12,X18,X14,X17)
| ~ s_t(X12,X15,X18)
| le(X12,X15,X14,X17) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz5_5b) ).
fof(aSatz5_5a,axiom,
! [X12,X15,X14,X17] :
( ( ins(X14,X17,X12,X15) = ext(X12,X15,insert(X12,X15,X14,X17),X17)
| ~ le(X12,X15,X14,X17) )
& ( s_e(X12,ins(X14,X17,X12,X15),X14,X17)
| ~ le(X12,X15,X14,X17) )
& ( s_t(X12,X15,ins(X14,X17,X12,X15))
| ~ le(X12,X15,X14,X17) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz5_5a) ).
fof(aSatz3_6b,axiom,
! [X12,X15,X14,X17] :
( s_t(X12,X15,X17)
| ~ s_t(X12,X14,X17)
| ~ s_t(X12,X15,X14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz3_6b) ).
fof(d_insert,axiom,
! [X12,X15,X20,X22] : insert(X12,X15,X20,X22) = ext(ext(X22,X20,alpha,gamma),X20,X12,X15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_insert) ).
fof(aSatz5_8,conjecture,
! [X12,X15,X14,X17,X18,X19] :
( le(X12,X15,X18,X19)
| ~ le(X14,X17,X18,X19)
| ~ le(X12,X15,X14,X17) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz5_8) ).
fof(aSatz5_6,axiom,
! [X12,X15,X14,X17,X20,X21,X22,X26] :
( le(X20,X21,X22,X26)
| ~ s_e(X14,X17,X22,X26)
| ~ s_e(X12,X15,X20,X21)
| ~ le(X12,X15,X14,X17) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz5_6) ).
fof(aA1,axiom,
! [X1,X2] : s_e(X1,X2,X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO011+0.ax',aA1) ).
fof(aSatz2_1,axiom,
! [X12,X15] : s_e(X12,X15,X12,X15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz2_1) ).
fof(c_0_12,plain,
! [X12,X15,X14,X17] :
( s_e(X14,X17,X12,X15)
| ~ s_e(X12,X15,X14,X17) ),
inference(fof_simplification,[status(thm)],[aSatz2_2]) ).
fof(c_0_13,plain,
! [X12,X15,X14,X17] :
( s_e(X15,X12,X14,X17)
| ~ s_e(X12,X15,X14,X17) ),
inference(fof_simplification,[status(thm)],[aSatz2_4]) ).
fof(c_0_14,plain,
! [X67,X68,X69,X70] :
( s_e(X69,X70,X67,X68)
| ~ s_e(X67,X68,X69,X70) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])]) ).
fof(c_0_15,plain,
! [X46,X47,X48,X49] :
( s_e(X47,ext(X46,X47,X48,X49),X48,X49)
& s_t(X46,X47,ext(X46,X47,X48,X49)) ),
inference(variable_rename,[status(thm)],[aA4]) ).
fof(c_0_16,plain,
! [X12,X15,X14,X17,X2] :
( ( le(X12,X15,X14,X17)
| ~ s_e(X12,X15,X14,X2)
| ~ s_t(X14,X2,X17) )
& ( s_e(X12,X15,X14,insert(X12,X15,X14,X17))
| ~ le(X12,X15,X14,X17) )
& ( s_t(X14,insert(X12,X15,X14,X17),X17)
| ~ le(X12,X15,X14,X17) ) ),
inference(fof_simplification,[status(thm)],[d_Defn5_4]) ).
fof(c_0_17,plain,
! [X77,X78,X79,X80] :
( s_e(X78,X77,X79,X80)
| ~ s_e(X77,X78,X79,X80) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_13])]) ).
cnf(c_0_18,plain,
( ~ s_e(X1,X2,X3,X4)
| s_e(X3,X4,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
s_e(X1,ext(X2,X1,X3,X4),X3,X4),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X12,X15,X14,X17,X18] :
( ~ s_e(X12,X18,X14,X17)
| ~ s_t(X12,X15,X18)
| le(X12,X15,X14,X17) ),
inference(fof_simplification,[status(thm)],[aSatz5_5b]) ).
fof(c_0_21,plain,
! [X12,X15,X14,X17] :
( ( ins(X14,X17,X12,X15) = ext(X12,X15,insert(X12,X15,X14,X17),X17)
| ~ le(X12,X15,X14,X17) )
& ( s_e(X12,ins(X14,X17,X12,X15),X14,X17)
| ~ le(X12,X15,X14,X17) )
& ( s_t(X12,X15,ins(X14,X17,X12,X15))
| ~ le(X12,X15,X14,X17) ) ),
inference(fof_simplification,[status(thm)],[aSatz5_5a]) ).
fof(c_0_22,plain,
! [X12,X15,X14,X17] :
( s_t(X12,X15,X17)
| ~ s_t(X12,X14,X17)
| ~ s_t(X12,X15,X14) ),
inference(fof_simplification,[status(thm)],[aSatz3_6b]) ).
fof(c_0_23,plain,
! [X305,X306,X307,X308,X309] :
( ( le(X305,X306,X307,X308)
| ~ s_e(X305,X306,X307,X309)
| ~ s_t(X307,X309,X308) )
& ( s_e(X305,X306,X307,insert(X305,X306,X307,X308))
| ~ le(X305,X306,X307,X308) )
& ( s_t(X307,insert(X305,X306,X307,X308),X308)
| ~ le(X305,X306,X307,X308) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).
cnf(c_0_24,plain,
( ~ s_e(X1,X2,X3,X4)
| s_e(X2,X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
s_e(X1,X2,X3,ext(X4,X3,X1,X2)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_26,plain,
! [X268,X269,X270,X271] : insert(X268,X269,X270,X271) = ext(ext(X271,X270,alpha,gamma),X270,X268,X269),
inference(variable_rename,[status(thm)],[d_insert]) ).
fof(c_0_27,negated_conjecture,
~ ! [X12,X15,X14,X17,X18,X19] :
( le(X12,X15,X18,X19)
| ~ le(X14,X17,X18,X19)
| ~ le(X12,X15,X14,X17) ),
inference(assume_negation,[status(cth)],[aSatz5_8]) ).
fof(c_0_28,plain,
! [X12,X15,X14,X17,X20,X21,X22,X26] :
( le(X20,X21,X22,X26)
| ~ s_e(X14,X17,X22,X26)
| ~ s_e(X12,X15,X20,X21)
| ~ le(X12,X15,X14,X17) ),
inference(fof_simplification,[status(thm)],[aSatz5_6]) ).
fof(c_0_29,plain,
! [X247,X248,X249,X250,X251] :
( ~ s_e(X247,X251,X249,X250)
| ~ s_t(X247,X248,X251)
| le(X247,X248,X249,X250) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_20])]) ).
fof(c_0_30,plain,
! [X243,X244,X245,X246] :
( ( ins(X245,X246,X243,X244) = ext(X243,X244,insert(X243,X244,X245,X246),X246)
| ~ le(X243,X244,X245,X246) )
& ( s_e(X243,ins(X245,X246,X243,X244),X245,X246)
| ~ le(X243,X244,X245,X246) )
& ( s_t(X243,X244,ins(X245,X246,X243,X244))
| ~ le(X243,X244,X245,X246) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_21])]) ).
fof(c_0_31,plain,
! [X137,X138,X139,X140] :
( s_t(X137,X138,X140)
| ~ s_t(X137,X139,X140)
| ~ s_t(X137,X138,X139) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])]) ).
cnf(c_0_32,plain,
( ~ s_e(X4,X5,X1,X2)
| ~ s_t(X1,X2,X3)
| le(X4,X5,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
s_e(X1,X2,X3,ext(X4,X3,X2,X1)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_34,plain,
( ~ le(X1,X2,X3,X4)
| s_t(X3,insert(X1,X2,X3,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,plain,
insert(X1,X2,X3,X4) = ext(ext(X4,X3,alpha,gamma),X3,X1,X2),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_36,negated_conjecture,
~ ! [X12,X15,X14,X17,X18,X19] :
( le(X12,X15,X18,X19)
| ~ le(X14,X17,X18,X19)
| ~ le(X12,X15,X14,X17) ),
inference(fof_simplification,[status(thm)],[c_0_27]) ).
fof(c_0_37,plain,
! [X252,X253,X254,X255,X256,X257,X258,X259] :
( le(X256,X257,X258,X259)
| ~ s_e(X254,X255,X258,X259)
| ~ s_e(X252,X253,X256,X257)
| ~ le(X252,X253,X254,X255) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_28])]) ).
fof(c_0_38,plain,
! [X35,X36] : s_e(X35,X36,X36,X35),
inference(variable_rename,[status(thm)],[aA1]) ).
cnf(c_0_39,plain,
( ~ s_e(X1,X5,X3,X4)
| ~ s_t(X1,X2,X5)
| le(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,plain,
( ~ le(X1,X2,X3,X4)
| s_e(X1,ins(X3,X4,X1,X2),X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,plain,
( ~ s_t(X1,X3,X4)
| ~ s_t(X1,X2,X3)
| s_t(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,plain,
( ~ le(X1,X2,X3,X4)
| s_t(X1,X2,ins(X3,X4,X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_43,plain,
( ~ s_t(X3,ext(X5,X3,X2,X1),X4)
| le(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_44,plain,
( ~ le(X1,X2,X3,X4)
| s_t(X3,ext(ext(X4,X3,alpha,gamma),X3,X1,X2),X4) ),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_45,negated_conjecture,
( ~ le(esk1_0,esk2_0,esk5_0,esk6_0)
& le(esk3_0,esk4_0,esk5_0,esk6_0)
& le(esk1_0,esk2_0,esk3_0,esk4_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])]) ).
cnf(c_0_46,plain,
( ~ s_e(X3,X4,X7,X8)
| ~ s_e(X1,X2,X5,X6)
| ~ le(X1,X2,X3,X4)
| le(X5,X6,X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_47,plain,
s_e(X1,X2,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,plain,
( ~ s_t(X1,X2,ins(X3,X4,X1,X5))
| ~ le(X1,X5,X3,X4)
| le(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_49,plain,
( ~ s_t(X1,X2,X5)
| ~ le(X1,X5,X3,X4)
| s_t(X1,X2,ins(X3,X4,X1,X5)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,plain,
( ~ le(X2,X1,X3,X4)
| le(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,negated_conjecture,
le(esk3_0,esk4_0,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_52,plain,
( ~ s_e(X5,X6,X1,X2)
| ~ le(X5,X6,X4,X3)
| le(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,plain,
( ~ s_t(X1,X2,X5)
| ~ le(X1,X5,X3,X4)
| le(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
le(esk4_0,esk3_0,esk5_0,esk6_0),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
( ~ le(X5,ext(X6,X5,X1,X2),X4,X3)
| le(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_52,c_0_19]) ).
cnf(c_0_56,negated_conjecture,
( ~ s_t(esk4_0,X1,esk3_0)
| le(esk4_0,X1,esk5_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( ~ s_t(esk4_0,ext(X3,esk4_0,X1,X2),esk3_0)
| le(X1,X2,esk6_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
fof(c_0_58,plain,
! [X65,X66] : s_e(X65,X66,X65,X66),
inference(variable_rename,[status(thm)],[aSatz2_1]) ).
cnf(c_0_59,negated_conjecture,
( ~ le(X1,X2,esk4_0,esk3_0)
| le(X1,X2,esk6_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_44]) ).
cnf(c_0_60,plain,
( ~ le(X2,X1,X4,X3)
| le(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_52,c_0_47]) ).
cnf(c_0_61,negated_conjecture,
le(esk1_0,esk2_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_62,plain,
s_e(X1,X2,X1,X2),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_63,negated_conjecture,
( ~ le(X2,X1,esk4_0,esk3_0)
| le(X1,X2,esk6_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
le(esk2_0,esk1_0,esk4_0,esk3_0),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,plain,
( ~ le(X1,X2,X4,X3)
| le(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_52,c_0_62]) ).
cnf(c_0_66,negated_conjecture,
le(esk1_0,esk2_0,esk6_0,esk5_0),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
~ le(esk1_0,esk2_0,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO494+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 % Computer : n026.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Sun Sep 20 16:55:51 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.45 Running first-order theorem proving
% 0.14/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/benchmark/theBenchmark.p
% 3.25/0.95 % Version: 3.5.1
% 3.25/0.95 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.25/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.25/0.95 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.25/0.95 % Starting new_bool_3 with 300s (1) cores
% 3.25/0.95 % Starting new_bool_1 with 300s (1) cores
% 3.25/0.95 % Starting sh5l with 300s (1) cores
% 3.25/0.95 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 216254 completed with status 0
% 3.25/0.95 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 3.25/0.95 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.25/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.25/0.95 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.25/0.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.25/0.95 % No SInE strategy applied
% 3.25/0.95 % Search class: FGUSM-FFMF33-MFFFFFNN
% 3.25/0.95 % partial match(1): FGUSM-FFMF33-SFFFFFNN
% 3.25/0.95 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 3.25/0.95 % Starting SubtermCWHack with 151s (1) cores
% 3.25/0.95 % Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 901s (1) cores
% 3.25/0.95 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_S0a with 151s (1) cores
% 3.25/0.95 % Starting new_bool_3 with 151s (1) cores
% 3.25/0.95 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 146s (1) cores
% 3.25/0.95 % SubtermCWHack with pid 216261 completed with status 0
% 3.25/0.95 % Result found by SubtermCWHack
% 3.25/0.95 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.25/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.25/0.95 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.25/0.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.25/0.95 % No SInE strategy applied
% 3.25/0.95 % Search class: FGUSM-FFMF33-MFFFFFNN
% 3.25/0.95 % partial match(1): FGUSM-FFMF33-SFFFFFNN
% 3.25/0.95 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 3.25/0.95 % Starting SubtermCWHack with 151s (1) cores
% 3.25/0.95 % Preprocessing time : 0.002 s
% 3.25/0.95
% 3.25/0.95 % Proof found!
% 3.25/0.95 % SZS status Theorem
% 3.25/0.95 % SZS output start CNFRefutation
% See solution above
% 3.25/0.95 % Parsed axioms : 67
% 3.25/0.95 % Removed by relevancy pruning/SinE : 0
% 3.25/0.95 % Initial clauses : 101
% 3.25/0.95 % Removed in clause preprocessing : 1
% 3.25/0.95 % Initial clauses in saturation : 100
% 3.25/0.95 % Processed clauses : 3076
% 3.25/0.95 % ...of these trivial : 69
% 3.25/0.95 % ...subsumed : 2255
% 3.25/0.95 % ...remaining for further processing : 752
% 3.25/0.95 % Other redundant clauses eliminated : 8
% 3.25/0.95 % Clauses deleted for lack of memory : 0
% 3.25/0.95 % Backward-subsumed : 24
% 3.25/0.95 % Backward-rewritten : 1
% 3.25/0.95 % Generated clauses : 22722
% 3.25/0.95 % ...of the previous two non-redundant : 19638
% 3.25/0.95 % ...aggressively subsumed : 0
% 3.25/0.95 % Contextual simplify-reflections : 0
% 3.25/0.95 % Paramodulations : 22714
% 3.25/0.95 % Factorizations : 0
% 3.25/0.95 % NegExts : 0
% 3.25/0.95 % Equation resolutions : 8
% 3.25/0.95 % Disequality decompositions : 0
% 3.25/0.95 % Total rewrite steps : 5667
% 3.25/0.95 % ...of those cached : 5146
% 3.25/0.95 % Propositional unsat checks : 0
% 3.25/0.95 % Propositional check models : 0
% 3.25/0.95 % Propositional check unsatisfiable : 0
% 3.25/0.95 % Propositional clauses : 0
% 3.25/0.95 % Propositional clauses after purity: 0
% 3.25/0.95 % Propositional unsat core size : 0
% 3.25/0.95 % Propositional preprocessing time : 0.000
% 3.25/0.95 % Propositional encoding time : 0.000
% 3.25/0.95 % Propositional solver time : 0.000
% 3.25/0.95 % Success case prop preproc time : 0.000
% 3.25/0.95 % Success case prop encoding time : 0.000
% 3.25/0.95 % Success case prop solver time : 0.000
% 3.25/0.95 % Current number of processed clauses : 727
% 3.25/0.95 % Positive orientable unit clauses : 96
% 3.25/0.95 % Positive unorientable unit clauses: 0
% 3.25/0.95 % Negative unit clauses : 8
% 3.25/0.95 % Non-unit-clauses : 623
% 3.25/0.95 % Current number of unprocessed clauses: 16278
% 3.25/0.95 % ...number of literals in the above : 55908
% 3.25/0.95 % Current number of archived formulas : 0
% 3.25/0.95 % Current number of archived clauses : 26
% 3.25/0.95 % Clause-clause subsumption calls (NU) : 123695
% 3.25/0.95 % Rec. Clause-clause subsumption calls : 94367
% 3.25/0.95 % Non-unit clause-clause subsumptions : 2272
% 3.25/0.95 % Unit Clause-clause subsumption calls : 210
% 3.25/0.95 % Rewrite failures with RHS unbound : 0
% 3.25/0.95 % BW rewrite match attempts : 3660
% 3.25/0.95 % BW rewrite match successes : 3
% 3.25/0.95 % Condensation attempts : 0
% 3.25/0.95 % Condensation successes : 0
% 3.25/0.95 % Termbank termtop insertions : 208225
% 3.25/0.95 % Search garbage collected termcells : 692
% 3.25/0.95
% 3.25/0.95 % -------------------------------------------------
% 3.25/0.95 % User time : 0.427 s
% 3.25/0.95 % System time : 0.027 s
% 3.25/0.95 % Total time : 0.454 s
% 3.25/0.95 % Maximum resident set size: 3956 pages
% 3.25/0.95
% 3.25/0.95 % -------------------------------------------------
% 3.25/0.95 % User time : 1.924 s
% 3.25/0.95 % System time : 0.132 s
% 3.25/0.95 % Total time : 2.056 s
% 3.25/0.95 % Maximum resident set size: 4864 pages
% 3.25/0.95 % E exiting
%------------------------------------------------------------------------------