%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO273+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:04 PM UTC 2026
% Result : Theorem 3.36s 0.97s
% Output : CNFRefutation 3.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 25 unt; 0 def)
% Number of atoms : 174 ( 119 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 210 ( 80 ~; 72 |; 34 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-8 aty)
% Number of variables : 94 ( 0 sgn 53 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(proof(223), 0), 0)',axiom,
! [X4,X5] :
( ( ? [X7] :
( rpoint(X7)
& X4 = X7 )
& ? [X6] :
( rpoint(X6)
& X5 = X6 )
& X4 != X5 )
=> ! [X8,X9] :
( ( rpoint(X9)
& X8 != X4
& X8 != X5
& X8 = X9 )
=> ! [X10] :
( X10 = vskolem1092(X8,X9,X4,X5)
=> ! [X11] :
( X11 = vskolem1095(X10,X8,X9,X4,X5)
=> ! [X12] :
( X12 = vskolem1099(X11,X10,X8,X9,X4,X5)
=> ! [X13] :
( X13 = vskolem1102(X12,X11,X10,X8,X9,X4,X5)
=> vf(X4,X5) = vf(X8,vskolem1103(X13,X12,X11,X10,X8,X9,X4,X5)) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(223), 0), 0)') ).
fof('qe(222)',conjecture,
? [X1] :
( rpoint(X1)
& vf(vd1069,vd1070) = vf(vd1074,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qe(222)') ).
fof('pred(221, 1)',axiom,
rpoint(vd1075),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(221, 1)') ).
fof('pred(221, 4)',axiom,
vd1074 = vd1075,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(221, 4)') ).
fof('qe(s1(plural(220)))',axiom,
? [X3] :
( rpoint(X3)
& vd1069 = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qe(s1(plural(220)))') ).
fof('qe(s2(plural(220)))',axiom,
? [X2] :
( rpoint(X2)
& vd1070 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qe(s2(plural(220)))') ).
fof('holds(conjunct2(221), 1077, 0)',axiom,
vd1074 != vd1070,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conjunct2(221), 1077, 0)') ).
fof('holds(conjunct1(221), 1076, 0)',axiom,
vd1074 != vd1069,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conjunct1(221), 1076, 0)') ).
fof('pred(220, 5)',axiom,
vd1069 != vd1070,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(220, 5)') ).
fof('ass(cond(proof(223), 0), 7)',axiom,
! [X4,X5] :
( ( ? [X7] :
( rpoint(X7)
& X4 = X7 )
& ? [X6] :
( rpoint(X6)
& X5 = X6 )
& X4 != X5 )
=> ! [X8,X9] :
( ( rpoint(X9)
& X8 != X4
& X8 != X5
& X8 = X9 )
=> ! [X10] :
( X10 = vskolem1092(X8,X9,X4,X5)
=> ! [X11] :
( X11 = vskolem1095(X10,X8,X9,X4,X5)
=> ! [X12] :
( X12 = vskolem1099(X11,X10,X8,X9,X4,X5)
=> ! [X13] :
( X13 = vskolem1102(X12,X11,X10,X8,X9,X4,X5)
=> rpoint(vskolem1103(X13,X12,X11,X10,X8,X9,X4,X5)) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(223), 0), 7)') ).
fof(c_0_10,plain,
! [X4,X5] :
( ( ? [X7] :
( rpoint(X7)
& X4 = X7 )
& ? [X6] :
( rpoint(X6)
& X5 = X6 )
& X4 != X5 )
=> ! [X8,X9] :
( ( rpoint(X9)
& X8 != X4
& X8 != X5
& X8 = X9 )
=> ! [X10] :
( X10 = vskolem1092(X8,X9,X4,X5)
=> ! [X11] :
( X11 = vskolem1095(X10,X8,X9,X4,X5)
=> ! [X12] :
( X12 = vskolem1099(X11,X10,X8,X9,X4,X5)
=> ! [X13] :
( X13 = vskolem1102(X12,X11,X10,X8,X9,X4,X5)
=> vf(X4,X5) = vf(X8,vskolem1103(X13,X12,X11,X10,X8,X9,X4,X5)) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],['ass(cond(proof(223), 0), 0)']) ).
fof(c_0_11,negated_conjecture,
~ ? [X1] :
( rpoint(X1)
& vf(vd1069,vd1070) = vf(vd1074,X1) ),
inference(assume_negation,[status(cth)],['qe(222)']) ).
fof(c_0_12,plain,
! [X748,X749,X750,X751,X752,X753,X754,X755,X756,X757] :
( vf(X748,X749) = vf(X752,vskolem1103(X757,X756,X755,X754,X752,X753,X748,X749))
| X757 != vskolem1102(X756,X755,X754,X752,X753,X748,X749)
| X756 != vskolem1099(X755,X754,X752,X753,X748,X749)
| X755 != vskolem1095(X754,X752,X753,X748,X749)
| X754 != vskolem1092(X752,X753,X748,X749)
| ~ rpoint(X753)
| X752 = X748
| X752 = X749
| X752 != X753
| ~ rpoint(X751)
| X748 != X751
| ~ rpoint(X750)
| X749 != X750
| X748 = X749 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_13,negated_conjecture,
! [X745] :
( ~ rpoint(X745)
| vf(vd1069,vd1070) != vf(vd1074,X745) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_14,plain,
( X10 != vskolem1102(X9,X8,X7,X5,X6,X1,X2)
| X9 != vskolem1099(X8,X7,X5,X6,X1,X2)
| X8 != vskolem1095(X7,X5,X6,X1,X2)
| X7 != vskolem1092(X5,X6,X1,X2)
| ~ rpoint(X6)
| X5 != X6
| ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| vf(X1,X2) = vf(X5,vskolem1103(X10,X9,X8,X7,X5,X6,X1,X2))
| X5 = X1
| X5 = X2
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
rpoint(vd1075),
inference(split_conjunct,[status(thm)],['pred(221, 1)']) ).
cnf(c_0_16,plain,
vd1074 = vd1075,
inference(split_conjunct,[status(thm)],['pred(221, 4)']) ).
fof(c_0_17,plain,
( rpoint(esk2_0)
& vd1069 = esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(220)))'])]) ).
fof(c_0_18,plain,
( rpoint(esk1_0)
& vd1070 = esk1_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s2(plural(220)))'])]) ).
fof(c_0_19,plain,
vd1074 != vd1070,
inference(fof_simplification,[status(thm)],['holds(conjunct2(221), 1077, 0)']) ).
fof(c_0_20,plain,
vd1074 != vd1069,
inference(fof_simplification,[status(thm)],['holds(conjunct1(221), 1076, 0)']) ).
fof(c_0_21,plain,
vd1069 != vd1070,
inference(fof_simplification,[status(thm)],['pred(220, 5)']) ).
fof(c_0_22,plain,
! [X4,X5] :
( ( ? [X7] :
( rpoint(X7)
& X4 = X7 )
& ? [X6] :
( rpoint(X6)
& X5 = X6 )
& X4 != X5 )
=> ! [X8,X9] :
( ( rpoint(X9)
& X8 != X4
& X8 != X5
& X8 = X9 )
=> ! [X10] :
( X10 = vskolem1092(X8,X9,X4,X5)
=> ! [X11] :
( X11 = vskolem1095(X10,X8,X9,X4,X5)
=> ! [X12] :
( X12 = vskolem1099(X11,X10,X8,X9,X4,X5)
=> ! [X13] :
( X13 = vskolem1102(X12,X11,X10,X8,X9,X4,X5)
=> rpoint(vskolem1103(X13,X12,X11,X10,X8,X9,X4,X5)) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],['ass(cond(proof(223), 0), 7)']) ).
cnf(c_0_23,negated_conjecture,
( ~ rpoint(X1)
| vf(vd1069,vd1070) != vf(vd1074,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,plain,
( ~ rpoint(X3)
| ~ rpoint(X2)
| ~ rpoint(X1)
| X2 = X3
| X2 = X1
| X3 = X1
| vf(X1,vskolem1103(vskolem1102(vskolem1099(vskolem1095(vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3),vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3),vskolem1095(vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3),vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3),vskolem1099(vskolem1095(vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3),vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3),vskolem1095(vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3),vskolem1092(X1,X1,X2,X3),X1,X1,X2,X3)) = vf(X2,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_14])])])])])])]) ).
cnf(c_0_25,plain,
rpoint(vd1074),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_26,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
vd1069 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,plain,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,plain,
vd1070 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_30,plain,
vd1074 != vd1070,
inference(fof_nnf,[status(thm)],[c_0_19]) ).
fof(c_0_31,plain,
vd1074 != vd1069,
inference(fof_nnf,[status(thm)],[c_0_20]) ).
fof(c_0_32,plain,
vd1069 != vd1070,
inference(fof_nnf,[status(thm)],[c_0_21]) ).
fof(c_0_33,plain,
! [X818,X819,X820,X821,X822,X823,X824,X825,X826,X827] :
( rpoint(vskolem1103(X827,X826,X825,X824,X822,X823,X818,X819))
| X827 != vskolem1102(X826,X825,X824,X822,X823,X818,X819)
| X826 != vskolem1099(X825,X824,X822,X823,X818,X819)
| X825 != vskolem1095(X824,X822,X823,X818,X819)
| X824 != vskolem1092(X822,X823,X818,X819)
| ~ rpoint(X823)
| X822 = X818
| X822 = X819
| X822 != X823
| ~ rpoint(X821)
| X818 != X821
| ~ rpoint(X820)
| X819 != X820
| X818 = X819 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
cnf(c_0_34,negated_conjecture,
( ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rpoint(vskolem1103(vskolem1102(vskolem1099(vskolem1095(vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1),vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1),vskolem1095(vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1),vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1),vskolem1099(vskolem1095(vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1),vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1),vskolem1095(vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1),vskolem1092(vd1074,vd1074,X2,X1),vd1074,vd1074,X2,X1))
| vf(vd1069,vd1070) != vf(X2,X1)
| X2 = X1
| X2 = vd1074
| X1 = vd1074 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_35,plain,
rpoint(vd1069),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,plain,
rpoint(vd1070),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
vd1074 != vd1070,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
vd1074 != vd1069,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
vd1069 != vd1070,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
( X10 != vskolem1102(X9,X8,X7,X5,X6,X1,X2)
| X9 != vskolem1099(X8,X7,X5,X6,X1,X2)
| X8 != vskolem1095(X7,X5,X6,X1,X2)
| X7 != vskolem1092(X5,X6,X1,X2)
| ~ rpoint(X6)
| X5 != X6
| ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| rpoint(vskolem1103(X10,X9,X8,X7,X5,X6,X1,X2))
| X5 = X1
| X5 = X2
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
~ rpoint(vskolem1103(vskolem1102(vskolem1099(vskolem1095(vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070),vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070),vskolem1095(vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070),vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070),vskolem1099(vskolem1095(vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070),vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070),vskolem1095(vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070),vskolem1092(vd1074,vd1074,vd1069,vd1070),vd1074,vd1074,vd1069,vd1070)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_34]),c_0_35]),c_0_36])]),c_0_37]),c_0_38]),c_0_39]) ).
cnf(c_0_42,plain,
( ~ rpoint(X1)
| ~ rpoint(X3)
| ~ rpoint(X2)
| rpoint(vskolem1103(vskolem1102(vskolem1099(vskolem1095(vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1),vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1),vskolem1095(vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1),vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1),vskolem1099(vskolem1095(vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1),vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1),vskolem1095(vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1),vskolem1092(X2,X2,X3,X1),X2,X2,X3,X1))
| X3 = X1
| X3 = X2
| X1 = X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_40])])])])])])]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_25]),c_0_35]),c_0_36])]),c_0_39]),c_0_38]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO273+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 15:05:43 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 3.36/0.97 % Version: 3.5.1
% 3.36/0.97 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.36/0.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.36/0.97 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.36/0.97 % Starting new_bool_3 with 300s (1) cores
% 3.36/0.97 % Starting new_bool_1 with 300s (1) cores
% 3.36/0.97 % Starting sh5l with 300s (1) cores
% 3.36/0.97 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 857610 completed with status 0
% 3.36/0.97 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.36/0.97 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.36/0.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.36/0.97 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.36/0.97 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.36/0.97 % No SInE strategy applied
% 3.36/0.97 % Search class: FGHSF-FSLM33-SFFFFFNN
% 3.36/0.97 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 3.36/0.97 % Starting SubtermCWHack with 136s (1) cores
% 3.36/0.97 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.36/0.97 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 3.36/0.97 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 3.36/0.97 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 3.36/0.97 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 857620 completed with status 0
% 3.36/0.97 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 3.36/0.97 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.36/0.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.36/0.97 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.36/0.97 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.36/0.97 % No SInE strategy applied
% 3.36/0.97 % Search class: FGHSF-FSLM33-SFFFFFNN
% 3.36/0.97 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 3.36/0.97 % Starting SubtermCWHack with 136s (1) cores
% 3.36/0.97 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.36/0.97 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 3.36/0.97 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 3.36/0.97 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 3.36/0.97 % Preprocessing time : 0.016 s
% 3.36/0.97 % Presaturation interreduction done
% 3.36/0.97
% 3.36/0.97 % Proof found!
% 3.36/0.97 % SZS status Theorem
% 3.36/0.97 % SZS output start CNFRefutation
% See solution above
% 3.36/0.97 % Parsed axioms : 136
% 3.36/0.97 % Removed by relevancy pruning/SinE : 0
% 3.36/0.97 % Initial clauses : 292
% 3.36/0.97 % Removed in clause preprocessing : 2
% 3.36/0.97 % Initial clauses in saturation : 290
% 3.36/0.97 % Processed clauses : 1277
% 3.36/0.97 % ...of these trivial : 20
% 3.36/0.97 % ...subsumed : 327
% 3.36/0.97 % ...remaining for further processing : 930
% 3.36/0.97 % Other redundant clauses eliminated : 1266
% 3.36/0.97 % Clauses deleted for lack of memory : 0
% 3.36/0.97 % Backward-subsumed : 0
% 3.36/0.97 % Backward-rewritten : 0
% 3.36/0.97 % Generated clauses : 1840
% 3.36/0.97 % ...of the previous two non-redundant : 1777
% 3.36/0.97 % ...aggressively subsumed : 0
% 3.36/0.97 % Contextual simplify-reflections : 42
% 3.36/0.97 % Paramodulations : 1549
% 3.36/0.97 % Factorizations : 8
% 3.36/0.97 % NegExts : 0
% 3.36/0.97 % Equation resolutions : 1271
% 3.36/0.97 % Disequality decompositions : 0
% 3.36/0.97 % Total rewrite steps : 83
% 3.36/0.97 % ...of those cached : 75
% 3.36/0.97 % Propositional unsat checks : 0
% 3.36/0.97 % Propositional check models : 0
% 3.36/0.97 % Propositional check unsatisfiable : 0
% 3.36/0.97 % Propositional clauses : 0
% 3.36/0.97 % Propositional clauses after purity: 0
% 3.36/0.97 % Propositional unsat core size : 0
% 3.36/0.97 % Propositional preprocessing time : 0.000
% 3.36/0.97 % Propositional encoding time : 0.000
% 3.36/0.97 % Propositional solver time : 0.000
% 3.36/0.97 % Success case prop preproc time : 0.000
% 3.36/0.97 % Success case prop encoding time : 0.000
% 3.36/0.97 % Success case prop solver time : 0.000
% 3.36/0.97 % Current number of processed clauses : 370
% 3.36/0.97 % Positive orientable unit clauses : 9
% 3.36/0.97 % Positive unorientable unit clauses: 0
% 3.36/0.97 % Negative unit clauses : 7
% 3.36/0.97 % Non-unit-clauses : 354
% 3.36/0.97 % Current number of unprocessed clauses: 1078
% 3.36/0.97 % ...number of literals in the above : 14556
% 3.36/0.97 % Current number of archived formulas : 0
% 3.36/0.97 % Current number of archived clauses : 288
% 3.36/0.97 % Clause-clause subsumption calls (NU) : 367330
% 3.36/0.97 % Rec. Clause-clause subsumption calls : 11658
% 3.36/0.97 % Non-unit clause-clause subsumptions : 369
% 3.36/0.97 % Unit Clause-clause subsumption calls : 11
% 3.36/0.97 % Rewrite failures with RHS unbound : 0
% 3.36/0.97 % BW rewrite match attempts : 0
% 3.36/0.97 % BW rewrite match successes : 0
% 3.36/0.97 % Condensation attempts : 0
% 3.36/0.97 % Condensation successes : 0
% 3.36/0.97 % Termbank termtop insertions : 136097
% 3.36/0.97 % Search garbage collected termcells : 15778
% 3.36/0.97
% 3.36/0.97 % -------------------------------------------------
% 3.36/0.97 % User time : 0.404 s
% 3.36/0.97 % System time : 0.010 s
% 3.36/0.97 % Total time : 0.414 s
% 3.36/0.97 % Maximum resident set size: 6304 pages
% 3.36/0.97
% 3.36/0.97 % -------------------------------------------------
% 3.36/0.97 % User time : 2.082 s
% 3.36/0.97 % System time : 0.080 s
% 3.36/0.97 % Total time : 2.163 s
% 3.36/0.97 % Maximum resident set size: 5376 pages
% 3.36/0.97 % E exiting
%------------------------------------------------------------------------------