%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO332+1 : 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 : n010.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:09 PM UTC 2026
% Result : Theorem 0.20s 5.93s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 53 ( 20 unt; 0 def)
% Number of atoms : 252 ( 122 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 323 ( 124 ~; 119 |; 73 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-8 aty)
% Number of variables : 137 ( 0 sgn 79 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(goal(238), 0), 1)',axiom,
! [X28,X29,X30,X31,X32,X33,X34,X35] :
( ( rpoint(X29)
& X28 = X29
& rpoint(X31)
& X30 = X31
& rpoint(X33)
& X32 = X33
& rpoint(X35)
& X34 = X35
& X28 != X30
& X32 != X34
& rless(vf(X32,X34),vf(X28,X30)) )
=> rR(vskolem1120(X28,X29,X30,X31,X32,X33,X34,X35),X28,X30) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(238), 0), 1)') ).
fof('qe(390)',conjecture,
? [X1] :
( rpoint(X1)
& rR(X1,vd1362,vd1361)
& vf(vd1362,X1) = vf(vd1361,vd1363) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(390)') ).
fof('qe(s2(plural(386)))',axiom,
? [X3] :
( rpoint(X3)
& vd1362 = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s2(plural(386)))') ).
fof('qe(s1(plural(386)))',axiom,
? [X4] :
( rpoint(X4)
& vd1361 = X4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s1(plural(386)))') ).
fof('pred(386, 7)',axiom,
vd1361 != vd1362,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(386, 7)') ).
fof('ass(cond(goal(238), 0), 0)',axiom,
! [X28,X29,X30,X31,X32,X33,X34,X35] :
( ( rpoint(X29)
& X28 = X29
& rpoint(X31)
& X30 = X31
& rpoint(X33)
& X32 = X33
& rpoint(X35)
& X34 = X35
& X28 != X30
& X32 != X34
& rless(vf(X32,X34),vf(X28,X30)) )
=> vf(X28,vskolem1120(X28,X29,X30,X31,X32,X33,X34,X35)) = vf(X32,X34) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(238), 0), 0)') ).
fof('ass(cond(goal(238), 0), 2)',axiom,
! [X28,X29,X30,X31,X32,X33,X34,X35] :
( ( rpoint(X29)
& X28 = X29
& rpoint(X31)
& X30 = X31
& rpoint(X33)
& X32 = X33
& rpoint(X35)
& X34 = X35
& X28 != X30
& X32 != X34
& rless(vf(X32,X34),vf(X28,X30)) )
=> rpoint(vskolem1120(X28,X29,X30,X31,X32,X33,X34,X35)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(238), 0), 2)') ).
fof('qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))',axiom,
! [X74,X75] :
( ( ? [X77] :
( rpoint(X77)
& X74 = X77 )
& ? [X76] :
( rpoint(X76)
& X75 = X76 ) )
=> vf(X74,X75) = vf(X75,X74) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))') ).
fof('qe(s3(plural(386)))',axiom,
? [X2] :
( rpoint(X2)
& vd1363 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s3(plural(386)))') ).
fof('pred(386, 8)',axiom,
vd1361 != vd1363,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(386, 8)') ).
fof('holds(389, 1370, 0)',axiom,
rless(vf(vd1361,vd1363),vf(vd1361,vd1362)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(389, 1370, 0)') ).
fof(c_0_11,plain,
! [X28,X29,X30,X31,X32,X33,X34,X35] :
( ( rpoint(X29)
& X28 = X29
& rpoint(X31)
& X30 = X31
& rpoint(X33)
& X32 = X33
& rpoint(X35)
& X34 = X35
& X28 != X30
& X32 != X34
& rless(vf(X32,X34),vf(X28,X30)) )
=> rR(vskolem1120(X28,X29,X30,X31,X32,X33,X34,X35),X28,X30) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(238), 0), 1)']) ).
fof(c_0_12,negated_conjecture,
~ ? [X1] :
( rpoint(X1)
& rR(X1,vd1362,vd1361)
& vf(vd1362,X1) = vf(vd1361,vd1363) ),
inference(assume_negation,[status(cth)],['qe(390)']) ).
fof(c_0_13,plain,
! [X843,X844,X845,X846,X847,X848,X849,X850] :
( rR(vskolem1120(X843,X844,X845,X846,X847,X848,X849,X850),X843,X845)
| ~ rpoint(X844)
| X843 != X844
| ~ rpoint(X846)
| X845 != X846
| ~ rpoint(X848)
| X847 != X848
| ~ rpoint(X850)
| X849 != X850
| X843 = X845
| X847 = X849
| ~ rless(vf(X847,X849),vf(X843,X845)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_14,plain,
( rpoint(esk2_0)
& vd1362 = esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s2(plural(386)))'])]) ).
fof(c_0_15,plain,
( rpoint(esk3_0)
& vd1361 = esk3_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(386)))'])]) ).
fof(c_0_16,plain,
vd1361 != vd1362,
inference(fof_simplification,[status(thm)],['pred(386, 7)']) ).
fof(c_0_17,plain,
! [X28,X29,X30,X31,X32,X33,X34,X35] :
( ( rpoint(X29)
& X28 = X29
& rpoint(X31)
& X30 = X31
& rpoint(X33)
& X32 = X33
& rpoint(X35)
& X34 = X35
& X28 != X30
& X32 != X34
& rless(vf(X32,X34),vf(X28,X30)) )
=> vf(X28,vskolem1120(X28,X29,X30,X31,X32,X33,X34,X35)) = vf(X32,X34) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(238), 0), 0)']) ).
fof(c_0_18,negated_conjecture,
! [X772] :
( ~ rpoint(X772)
| ~ rR(X772,vd1362,vd1361)
| vf(vd1362,X772) != vf(vd1361,vd1363) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_19,plain,
( ~ rpoint(X8)
| X3 != X8
| ~ rpoint(X7)
| X4 != X7
| ~ rpoint(X6)
| X1 != X6
| ~ rpoint(X5)
| X2 != X5
| ~ rless(vf(X1,X2),vf(X3,X4))
| rR(vskolem1120(X3,X8,X4,X7,X1,X6,X2,X5),X3,X4)
| X3 = X4
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
vd1362 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
rpoint(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
vd1361 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_24,plain,
vd1361 != vd1362,
inference(fof_nnf,[status(thm)],[c_0_16]) ).
fof(c_0_25,plain,
! [X835,X836,X837,X838,X839,X840,X841,X842] :
( vf(X835,vskolem1120(X835,X836,X837,X838,X839,X840,X841,X842)) = vf(X839,X841)
| ~ rpoint(X836)
| X835 != X836
| ~ rpoint(X838)
| X837 != X838
| ~ rpoint(X840)
| X839 != X840
| ~ rpoint(X842)
| X841 != X842
| X835 = X837
| X839 = X841
| ~ rless(vf(X839,X841),vf(X835,X837)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
fof(c_0_26,plain,
! [X28,X29,X30,X31,X32,X33,X34,X35] :
( ( rpoint(X29)
& X28 = X29
& rpoint(X31)
& X30 = X31
& rpoint(X33)
& X32 = X33
& rpoint(X35)
& X34 = X35
& X28 != X30
& X32 != X34
& rless(vf(X32,X34),vf(X28,X30)) )
=> rpoint(vskolem1120(X28,X29,X30,X31,X32,X33,X34,X35)) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(238), 0), 2)']) ).
cnf(c_0_27,negated_conjecture,
( ~ rpoint(X1)
| ~ rR(X1,vd1362,vd1361)
| vf(vd1362,X1) != vf(vd1361,vd1363) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
( ~ rpoint(X4)
| ~ rpoint(X3)
| ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rless(vf(X3,X4),vf(X1,X2))
| rR(vskolem1120(X1,X1,X2,X2,X3,X3,X4,X4),X1,X2)
| X3 = X4
| X1 = X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_19])])])]) ).
cnf(c_0_29,plain,
rpoint(vd1362),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
rpoint(vd1361),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
vd1361 != vd1362,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
( ~ rpoint(X8)
| X3 != X8
| ~ rpoint(X7)
| X4 != X7
| ~ rpoint(X6)
| X1 != X6
| ~ rpoint(X5)
| X2 != X5
| ~ rless(vf(X1,X2),vf(X3,X4))
| vf(X3,vskolem1120(X3,X8,X4,X7,X1,X6,X2,X5)) = vf(X1,X2)
| X3 = X4
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_33,plain,
! [X851,X852,X853,X854,X855,X856,X857,X858] :
( rpoint(vskolem1120(X851,X852,X853,X854,X855,X856,X857,X858))
| ~ rpoint(X852)
| X851 != X852
| ~ rpoint(X854)
| X853 != X854
| ~ rpoint(X856)
| X855 != X856
| ~ rpoint(X858)
| X857 != X858
| X851 = X853
| X855 = X857
| ~ rless(vf(X855,X857),vf(X851,X853)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).
cnf(c_0_34,negated_conjecture,
( ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rpoint(vskolem1120(vd1362,vd1362,vd1361,vd1361,X1,X1,X2,X2))
| ~ rless(vf(X1,X2),vf(vd1362,vd1361))
| vf(vd1362,vskolem1120(vd1362,vd1362,vd1361,vd1361,X1,X1,X2,X2)) != vf(vd1361,vd1363)
| X1 = X2 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]),c_0_31]) ).
cnf(c_0_35,plain,
( ~ rpoint(X4)
| ~ rpoint(X3)
| ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rless(vf(X3,X4),vf(X1,X2))
| X3 = X4
| X1 = X2
| vf(X1,vskolem1120(X1,X1,X2,X2,X3,X3,X4,X4)) = vf(X3,X4) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_32])])])]) ).
cnf(c_0_36,plain,
( ~ rpoint(X8)
| X3 != X8
| ~ rpoint(X7)
| X4 != X7
| ~ rpoint(X6)
| X1 != X6
| ~ rpoint(X5)
| X2 != X5
| ~ rless(vf(X1,X2),vf(X3,X4))
| rpoint(vskolem1120(X3,X8,X4,X7,X1,X6,X2,X5))
| X3 = X4
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_37,plain,
! [X903,X904,X905,X906] :
( vf(X903,X904) = vf(X904,X903)
| ~ rpoint(X906)
| X903 != X906
| ~ rpoint(X905)
| X904 != X905 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))'])])])]) ).
cnf(c_0_38,negated_conjecture,
( ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rpoint(vskolem1120(vd1362,vd1362,vd1361,vd1361,X1,X1,X2,X2))
| ~ rless(vf(X1,X2),vf(vd1362,vd1361))
| vf(X1,X2) != vf(vd1361,vd1363)
| X1 = X2 ),
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_29]),c_0_30])]),c_0_31]) ).
cnf(c_0_39,plain,
( ~ rpoint(X4)
| ~ rpoint(X3)
| ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rless(vf(X3,X4),vf(X1,X2))
| rpoint(vskolem1120(X1,X1,X2,X2,X3,X3,X4,X4))
| X3 = X4
| X1 = X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_36])])])]) ).
cnf(c_0_40,plain,
( ~ rpoint(X4)
| X3 != X4
| ~ rpoint(X2)
| X1 != X2
| vf(X3,X1) = vf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_41,plain,
( rpoint(esk1_0)
& vd1363 = esk1_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s3(plural(386)))'])]) ).
fof(c_0_42,plain,
vd1361 != vd1363,
inference(fof_simplification,[status(thm)],['pred(386, 8)']) ).
cnf(c_0_43,negated_conjecture,
( ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rless(vf(X1,X2),vf(vd1362,vd1361))
| vf(X1,X2) != vf(vd1361,vd1363)
| X1 = X2 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_29]),c_0_30])]),c_0_31]) ).
cnf(c_0_44,plain,
( ~ rpoint(X1)
| ~ rpoint(X2)
| vf(X1,X2) = vf(X2,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_40])]) ).
cnf(c_0_45,plain,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_46,plain,
vd1363 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_47,plain,
vd1361 != vd1363,
inference(fof_nnf,[status(thm)],[c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rless(vf(X1,X2),vf(vd1361,vd1362))
| vf(X1,X2) != vf(vd1361,vd1363)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_30]),c_0_29])]) ).
cnf(c_0_49,plain,
rless(vf(vd1361,vd1363),vf(vd1361,vd1362)),
inference(split_conjunct,[status(thm)],['holds(389, 1370, 0)']) ).
cnf(c_0_50,plain,
rpoint(vd1363),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
vd1361 != vd1363,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_30]),c_0_50])]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO332+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 % Computer : n010.cluster.edu
% 0.15/5.43 % Model : x86_64 x86_64
% 0.15/5.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/5.43 % Memory : 8046.5625MB
% 0.15/5.43 % OS : Linux 6.8.0-71-generic
% 0.15/5.43 % CPULimit : 300
% 0.15/5.43 % WCLimit : 300
% 0.15/5.43 % DateTime : Sun Sep 20 15:25:07 UTC 2026
% 0.15/5.43 % CPUTime :
% 0.15/5.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.48 Running first-order theorem proving
% 0.15/5.48 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
% 0.20/5.93 % Version: 3.5.1
% 0.20/5.93 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/5.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.93 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/5.93 % Starting new_bool_3 with 300s (1) cores
% 0.20/5.93 % Starting new_bool_1 with 300s (1) cores
% 0.20/5.93 % Starting sh5l with 300s (1) cores
% 0.20/5.93 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3050103 completed with status 0
% 0.20/5.93 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/5.93 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/5.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.93 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/5.93 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/5.93 % No SInE strategy applied
% 0.20/5.93 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.20/5.93 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/5.93 % Starting SubtermCWHack with 136s (1) cores
% 0.20/5.93 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/5.93 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.20/5.93 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/5.93 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.20/5.93 % G-E--_302_C18_F1_URBAN_S0Y with pid 3050112 completed with status 0
% 0.20/5.93 % Result found by G-E--_302_C18_F1_URBAN_S0Y
% 0.20/5.93 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/5.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.93 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/5.93 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/5.93 % No SInE strategy applied
% 0.20/5.93 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.20/5.93 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/5.93 % Starting SubtermCWHack with 136s (1) cores
% 0.20/5.93 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/5.93 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.20/5.93 % Preprocessing time : 0.019 s
% 0.20/5.93
% 0.20/5.93 % Proof found!
% 0.20/5.93 % SZS status Theorem
% 0.20/5.93 % SZS output start CNFRefutation
% See solution above
% 0.20/5.93 % Parsed axioms : 125
% 0.20/5.93 % Removed by relevancy pruning/SinE : 0
% 0.20/5.93 % Initial clauses : 283
% 0.20/5.93 % Removed in clause preprocessing : 2
% 0.20/5.93 % Initial clauses in saturation : 281
% 0.20/5.93 % Processed clauses : 1030
% 0.20/5.93 % ...of these trivial : 0
% 0.20/5.93 % ...subsumed : 265
% 0.20/5.93 % ...remaining for further processing : 765
% 0.20/5.93 % Other redundant clauses eliminated : 1194
% 0.20/5.93 % Clauses deleted for lack of memory : 0
% 0.20/5.93 % Backward-subsumed : 10
% 0.20/5.93 % Backward-rewritten : 2
% 0.20/5.93 % Generated clauses : 3662
% 0.20/5.93 % ...of the previous two non-redundant : 3599
% 0.20/5.93 % ...aggressively subsumed : 0
% 0.20/5.93 % Contextual simplify-reflections : 87
% 0.20/5.93 % Paramodulations : 3393
% 0.20/5.93 % Factorizations : 0
% 0.20/5.93 % NegExts : 0
% 0.20/5.93 % Equation resolutions : 1209
% 0.20/5.93 % Disequality decompositions : 0
% 0.20/5.93 % Total rewrite steps : 408
% 0.20/5.93 % ...of those cached : 397
% 0.20/5.93 % Propositional unsat checks : 0
% 0.20/5.93 % Propositional check models : 0
% 0.20/5.93 % Propositional check unsatisfiable : 0
% 0.20/5.93 % Propositional clauses : 0
% 0.20/5.93 % Propositional clauses after purity: 0
% 0.20/5.93 % Propositional unsat core size : 0
% 0.20/5.93 % Propositional preprocessing time : 0.000
% 0.20/5.93 % Propositional encoding time : 0.000
% 0.20/5.93 % Propositional solver time : 0.000
% 0.20/5.93 % Success case prop preproc time : 0.000
% 0.20/5.93 % Success case prop encoding time : 0.000
% 0.20/5.93 % Success case prop solver time : 0.000
% 0.20/5.93 % Current number of processed clauses : 499
% 0.20/5.93 % Positive orientable unit clauses : 15
% 0.20/5.93 % Positive unorientable unit clauses: 0
% 0.20/5.93 % Negative unit clauses : 9
% 0.20/5.93 % Non-unit-clauses : 475
% 0.20/5.93 % Current number of unprocessed clauses: 2788
% 0.20/5.93 % ...number of literals in the above : 40464
% 0.20/5.93 % Current number of archived formulas : 0
% 0.20/5.93 % Current number of archived clauses : 12
% 0.20/5.93 % Clause-clause subsumption calls (NU) : 163514
% 0.20/5.93 % Rec. Clause-clause subsumption calls : 6438
% 0.20/5.93 % Non-unit clause-clause subsumptions : 355
% 0.20/5.93 % Unit Clause-clause subsumption calls : 437
% 0.20/5.93 % Rewrite failures with RHS unbound : 0
% 0.20/5.93 % BW rewrite match attempts : 2
% 0.20/5.93 % BW rewrite match successes : 2
% 0.20/5.93 % Condensation attempts : 0
% 0.20/5.93 % Condensation successes : 0
% 0.20/5.93 % Termbank termtop insertions : 178902
% 0.20/5.93 % Search garbage collected termcells : 15385
% 0.20/5.93
% 0.20/5.93 % -------------------------------------------------
% 0.20/5.93 % User time : 0.405 s
% 0.20/5.93 % System time : 0.017 s
% 0.20/5.93 % Total time : 0.422 s
% 0.20/5.93 % Maximum resident set size: 6244 pages
% 0.20/5.93
% 0.20/5.93 % -------------------------------------------------
% 0.20/5.93 % User time : 1.884 s
% 0.20/5.93 % System time : 0.055 s
% 0.20/5.93 % Total time : 1.939 s
% 0.20/5.93 % Maximum resident set size: 5632 pages
% 0.20/5.93 % E exiting
%------------------------------------------------------------------------------