%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM842+2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 01:50:48 PM UTC 2026
% Result : Theorem 2.64s 0.96s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 15
% Syntax : Number of formulae : 83 ( 33 unt; 0 def)
% Number of atoms : 163 ( 47 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 143 ( 63 ~; 60 |; 11 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 156 ( 11 sgn 73 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(conseq(218), 361, 0)',conjecture,
greater(vplus(vd353,vd355),vplus(vd354,vd356)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conseq(218), 361, 0)') ).
fof('ass(cond(209, 0), 0)',axiom,
! [X1,X2,X3,X4] :
( ( greater(X1,X2)
& greater(X3,X4) )
=> greater(vplus(X1,X3),vplus(X2,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(209, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 16), 1)',axiom,
! [X28,X29] :
( geq(X29,X28)
<=> ( X29 = X28
| greater(X29,X28) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 16), 1)') ).
fof('dis(antec(218))',axiom,
( ( greater(vd353,vd354)
& geq(vd355,vd356) )
| ( geq(vd353,vd354)
& greater(vd355,vd356) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','dis(antec(218))') ).
fof('ass(cond(goal(202), 0), 2)',axiom,
! [X5,X6,X7] :
( greater(vplus(X5,X7),vplus(X6,X7))
=> greater(X5,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(202), 0), 2)') ).
fof('ass(cond(goal(88), 0), 1)',axiom,
! [X42,X43] :
( ~ ? [X45] : X43 = vplus(X42,X45)
| X42 != X43 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 1)') ).
fof('ass(cond(goal(193), 0), 2)',axiom,
! [X8,X9,X10] :
( greater(X8,X9)
=> greater(vplus(X8,X10),vplus(X9,X10)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(193), 0), 2)') ).
fof('ass(cond(168, 0), 0)',axiom,
! [X19,X20,X21] :
( ( less(X19,X20)
& less(X20,X21) )
=> less(X19,X21) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(168, 0), 0)') ).
fof('ass(cond(140, 0), 0)',axiom,
! [X32,X33] :
( greater(X32,X33)
=> less(X33,X32) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(140, 0), 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X56,X57,X58] : vplus(vplus(X56,X57),X58) = vplus(X56,vplus(X57,X58)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 12), 1)',axiom,
! [X36,X37] :
( less(X37,X36)
<=> ? [X38] : X36 = vplus(X37,X38) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 12), 1)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X51,X52] : vplus(X52,X51) = vplus(X51,X52),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof('ass(cond(147, 0), 0)',axiom,
! [X30,X31] :
( less(X30,X31)
=> greater(X31,X30) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(147, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X39,X40] :
( greater(X40,X39)
<=> ? [X41] : X40 = vplus(X39,X41) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X34,X35] :
( less(X34,X35)
| greater(X34,X35)
| X34 = X35 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof(c_0_15,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd356)),
inference(assume_negation,[status(cth)],['holds(conseq(218), 361, 0)']) ).
fof(c_0_16,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd356)),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_17,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd356)),
inference(fof_nnf,[status(thm)],[c_0_16]) ).
fof(c_0_18,plain,
! [X68,X69,X70,X71] :
( greater(vplus(X68,X70),vplus(X69,X71))
| ~ greater(X68,X69)
| ~ greater(X70,X71) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(209, 0), 0)'])])]) ).
fof(c_0_19,plain,
! [X107,X108] :
( ( geq(X108,X107)
| X108 != X107 )
& ( geq(X108,X107)
| ~ greater(X108,X107) )
& ( X108 = X107
| greater(X108,X107)
| ~ geq(X108,X107) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 16), 1)'])])])]) ).
fof(c_0_20,plain,
( ( geq(vd353,vd354)
| greater(vd353,vd354) )
& ( geq(vd353,vd354)
| geq(vd355,vd356) )
& ( greater(vd355,vd356)
| greater(vd353,vd354) )
& ( greater(vd355,vd356)
| geq(vd355,vd356) ) ),
inference(distribute,[status(thm)],['dis(antec(218))']) ).
cnf(c_0_21,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd356)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( ~ greater(X3,X4)
| ~ greater(X1,X2)
| greater(vplus(X3,X1),vplus(X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( ~ geq(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( greater(vd355,vd356)
| geq(vd355,vd356) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ greater(vd355,vd356)
| ~ greater(vd353,vd354) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( greater(vd355,vd356)
| vd356 = vd355 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_27,plain,
! [X78,X79,X80] :
( greater(X78,X79)
| ~ greater(vplus(X78,X80),vplus(X79,X80)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(202), 0), 2)'])])]) ).
fof(c_0_28,plain,
! [X42,X43] :
( ~ ? [X45] : X43 = vplus(X42,X45)
| X42 != X43 ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(88), 0), 1)']) ).
cnf(c_0_29,negated_conjecture,
( ~ greater(vd353,vd354)
| vd356 = vd355 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( ~ greater(vplus(X1,X2),vplus(X3,X2))
| greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_31,plain,
! [X87,X88,X89] :
( greater(vplus(X87,X89),vplus(X88,X89))
| ~ greater(X87,X88) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(193), 0), 2)'])])]) ).
fof(c_0_32,plain,
! [X137,X138,X139] :
( X138 != vplus(X137,X139)
| X137 != X138 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])]) ).
fof(c_0_33,plain,
! [X98,X99,X100] :
( less(X98,X100)
| ~ less(X98,X99)
| ~ less(X99,X100) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(168, 0), 0)'])])]) ).
fof(c_0_34,plain,
! [X111,X112] :
( less(X112,X111)
| ~ greater(X111,X112) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])])]) ).
cnf(c_0_35,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd355)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_29]),c_0_30]) ).
cnf(c_0_36,plain,
( ~ greater(X1,X2)
| greater(vplus(X1,X3),vplus(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
( X2 != vplus(X1,X3)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_38,plain,
! [X157,X158,X159] : vplus(vplus(X157,X158),X159) = vplus(X157,vplus(X158,X159)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
cnf(c_0_39,plain,
( ~ less(X3,X1)
| ~ less(X1,X2)
| less(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
( ~ greater(X1,X2)
| less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( greater(vd355,vd356)
| greater(vd353,vd354) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_42,negated_conjecture,
~ greater(vd353,vd354),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_43,plain,
! [X121,X122,X124,X125,X126] :
( ( less(X125,X124)
| X124 != vplus(X125,X126) )
& ( X121 = vplus(X122,esk1_2(X121,X122))
| ~ less(X122,X121) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 12), 1)'])])])])])]) ).
cnf(c_0_44,plain,
vplus(X1,X2) != X1,
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_45,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_46,plain,
! [X152,X153] : vplus(X153,X152) = vplus(X152,X153),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_47,plain,
! [X109,X110] :
( greater(X110,X109)
| ~ less(X109,X110) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(147, 0), 0)'])])]) ).
cnf(c_0_48,plain,
( ~ greater(X3,X1)
| ~ less(X3,X2)
| less(X1,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_49,plain,
greater(vd355,vd356),
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,plain,
( X1 != vplus(X2,X3)
| less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,plain,
vplus(X1,vplus(X2,X3)) != vplus(X1,X2),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
fof(c_0_53,plain,
! [X127,X128,X130,X131,X132] :
( ( greater(X131,X130)
| X131 != vplus(X130,X132) )
& ( X128 = vplus(X127,esk2_2(X127,X128))
| ~ greater(X128,X127) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 11), 1)'])])])])])]) ).
cnf(c_0_54,plain,
( ~ less(X1,X2)
| greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,plain,
( ~ less(vd355,X1)
| less(vd356,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,plain,
less(X1,vplus(X1,X2)),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_57,plain,
vplus(X1,vplus(X2,X3)) != vplus(X3,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_45]) ).
cnf(c_0_58,plain,
( ~ greater(X1,X2)
| X1 = vplus(X2,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_59,plain,
( ~ less(vd355,X1)
| greater(X1,vd356) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,plain,
less(X1,vplus(X2,X1)),
inference(spm,[status(thm)],[c_0_56,c_0_52]) ).
cnf(c_0_61,plain,
vplus(X1,vplus(X2,X3)) != vplus(X2,X1),
inference(spm,[status(thm)],[c_0_57,c_0_52]) ).
cnf(c_0_62,plain,
( ~ greater(X2,X3)
| vplus(X1,X2) != vplus(X1,X3) ),
inference(spm,[status(thm)],[c_0_51,c_0_58]) ).
cnf(c_0_63,plain,
greater(vplus(X1,vd355),vd356),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,plain,
( ~ greater(X2,X3)
| vplus(X1,X2) != vplus(X3,X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_58]) ).
cnf(c_0_65,plain,
vplus(X1,vplus(X2,vd355)) != vplus(X1,vd356),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
vplus(X1,vplus(X2,X3)) = vplus(X3,vplus(X1,X2)),
inference(spm,[status(thm)],[c_0_52,c_0_45]) ).
fof(c_0_67,plain,
! [X113,X114] :
( less(X113,X114)
| greater(X113,X114)
| X113 = X114 ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
cnf(c_0_68,plain,
vplus(X1,vd355) != vplus(vd356,X1),
inference(spm,[status(thm)],[c_0_64,c_0_49]) ).
cnf(c_0_69,plain,
( geq(vd353,vd354)
| greater(vd353,vd354) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_70,plain,
vplus(vd355,vplus(X1,X2)) != vplus(X1,vd356),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,plain,
( ~ greater(X3,vplus(X1,X2))
| vplus(X1,vplus(X2,esk2_2(vplus(X1,X2),X3))) = X3 ),
inference(spm,[status(thm)],[c_0_45,c_0_58]) ).
cnf(c_0_72,plain,
( less(X1,X2)
| greater(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_73,plain,
vplus(vd356,X1) != vplus(vd355,X1),
inference(spm,[status(thm)],[c_0_68,c_0_52]) ).
cnf(c_0_74,plain,
( greater(vd353,vd354)
| vd354 = vd353 ),
inference(spm,[status(thm)],[c_0_23,c_0_69]) ).
cnf(c_0_75,plain,
~ greater(vplus(X1,vd356),vplus(vd355,X1)),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71])]) ).
cnf(c_0_76,plain,
( greater(X2,X1)
| greater(X1,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_54,c_0_72]) ).
cnf(c_0_77,plain,
vplus(X1,vd356) != vplus(vd355,X1),
inference(spm,[status(thm)],[c_0_73,c_0_52]) ).
cnf(c_0_78,plain,
vd354 = vd353,
inference(sr,[status(thm)],[c_0_74,c_0_42]) ).
cnf(c_0_79,plain,
greater(vplus(vd355,X1),vplus(X1,vd356)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).
cnf(c_0_80,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd353,vd356)),
inference(spm,[status(thm)],[c_0_21,c_0_78]) ).
cnf(c_0_81,plain,
greater(vplus(X1,vd355),vplus(X1,vd356)),
inference(spm,[status(thm)],[c_0_79,c_0_52]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM842+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 03:12:42 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/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
% 2.64/0.96 % Version: 3.5.1
% 2.64/0.96 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.64/0.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.64/0.96 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.64/0.96 % Starting new_bool_3 with 300s (1) cores
% 2.64/0.96 % Starting new_bool_1 with 300s (1) cores
% 2.64/0.96 % Starting sh5l with 300s (1) cores
% 2.64/0.96 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1878793 completed with status 0
% 2.64/0.96 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.64/0.96 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.64/0.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.64/0.96 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.64/0.96 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.64/0.96 % No SInE strategy applied
% 2.64/0.96 % Search class: FGHSM-FFMS21-SFFFFFNN
% 2.64/0.96 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.64/0.96 % Starting SubtermCWHack with 136s (1) cores
% 2.64/0.96 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.64/0.96 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 2.64/0.96 % Starting new_bool_3 with 136s (1) cores
% 2.64/0.96 % Starting new_bool_1 with 136s (1) cores
% 2.64/0.96 % G-E--_208_B07_F1_SE_CS_SP_PS_S0Y with pid 1878802 completed with status 0
% 2.64/0.96 % Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S0Y
% 2.64/0.96 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.64/0.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.64/0.96 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.64/0.96 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.64/0.96 % No SInE strategy applied
% 2.64/0.96 % Search class: FGHSM-FFMS21-SFFFFFNN
% 2.64/0.96 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.64/0.96 % Starting SubtermCWHack with 136s (1) cores
% 2.64/0.96 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.64/0.96 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 2.64/0.96 % Preprocessing time : 0.003 s
% 2.64/0.96 % Presaturation interreduction done
% 2.64/0.96
% 2.64/0.96 % Proof found!
% 2.64/0.96 % SZS status Theorem
% 2.64/0.96 % SZS output start CNFRefutation
% See solution above
% 2.64/0.96 % Parsed axioms : 41
% 2.64/0.96 % Removed by relevancy pruning/SinE : 0
% 2.64/0.96 % Initial clauses : 52
% 2.64/0.96 % Removed in clause preprocessing : 2
% 2.64/0.96 % Initial clauses in saturation : 50
% 2.64/0.96 % Processed clauses : 1635
% 2.64/0.96 % ...of these trivial : 45
% 2.64/0.96 % ...subsumed : 1149
% 2.64/0.96 % ...remaining for further processing : 441
% 2.64/0.96 % Other redundant clauses eliminated : 84
% 2.64/0.96 % Clauses deleted for lack of memory : 0
% 2.64/0.96 % Backward-subsumed : 35
% 2.64/0.96 % Backward-rewritten : 19
% 2.64/0.96 % Generated clauses : 6443
% 2.64/0.96 % ...of the previous two non-redundant : 6148
% 2.64/0.96 % ...aggressively subsumed : 0
% 2.64/0.96 % Contextual simplify-reflections : 6
% 2.64/0.96 % Paramodulations : 6347
% 2.64/0.96 % Factorizations : 4
% 2.64/0.96 % NegExts : 0
% 2.64/0.96 % Equation resolutions : 88
% 2.64/0.96 % Disequality decompositions : 0
% 2.64/0.96 % Total rewrite steps : 1335
% 2.64/0.96 % ...of those cached : 1020
% 2.64/0.96 % Propositional unsat checks : 0
% 2.64/0.96 % Propositional check models : 0
% 2.64/0.96 % Propositional check unsatisfiable : 0
% 2.64/0.96 % Propositional clauses : 0
% 2.64/0.96 % Propositional clauses after purity: 0
% 2.64/0.96 % Propositional unsat core size : 0
% 2.64/0.96 % Propositional preprocessing time : 0.000
% 2.64/0.96 % Propositional encoding time : 0.000
% 2.64/0.96 % Propositional solver time : 0.000
% 2.64/0.96 % Success case prop preproc time : 0.000
% 2.64/0.96 % Success case prop encoding time : 0.000
% 2.64/0.96 % Success case prop solver time : 0.000
% 2.64/0.96 % Current number of processed clauses : 334
% 2.64/0.96 % Positive orientable unit clauses : 37
% 2.64/0.96 % Positive unorientable unit clauses: 3
% 2.64/0.96 % Negative unit clauses : 106
% 2.64/0.96 % Non-unit-clauses : 188
% 2.64/0.96 % Current number of unprocessed clauses: 4510
% 2.64/0.96 % ...number of literals in the above : 9126
% 2.64/0.96 % Current number of archived formulas : 0
% 2.64/0.96 % Current number of archived clauses : 99
% 2.64/0.96 % Clause-clause subsumption calls (NU) : 6922
% 2.64/0.96 % Rec. Clause-clause subsumption calls : 6011
% 2.64/0.96 % Non-unit clause-clause subsumptions : 359
% 2.64/0.96 % Unit Clause-clause subsumption calls : 1598
% 2.64/0.96 % Rewrite failures with RHS unbound : 0
% 2.64/0.96 % BW rewrite match attempts : 77
% 2.64/0.96 % BW rewrite match successes : 60
% 2.64/0.96 % Condensation attempts : 0
% 2.64/0.96 % Condensation successes : 0
% 2.64/0.96 % Termbank termtop insertions : 48732
% 2.64/0.96 % Search garbage collected termcells : 580
% 2.64/0.96
% 2.64/0.96 % -------------------------------------------------
% 2.64/0.96 % User time : 0.190 s
% 2.64/0.96 % System time : 0.017 s
% 2.64/0.96 % Total time : 0.207 s
% 2.64/0.96 % Maximum resident set size: 3700 pages
% 2.64/0.96
% 2.64/0.96 % -------------------------------------------------
% 2.64/0.96 % User time : 1.563 s
% 2.64/0.96 % System time : 0.078 s
% 2.64/0.96 % Total time : 1.640 s
% 2.64/0.96 % Maximum resident set size: 4608 pages
% 2.64/0.96 % E exiting
%------------------------------------------------------------------------------