%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO342+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 : n018.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:10 PM UTC 2026
% Result : Theorem 0.26s 0.48s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 131 ( 53 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 160 ( 55 ~; 49 |; 54 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 9 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))',axiom,
! [X123,X124] :
( ( ? [X126] :
( rpoint(X126)
& X123 = X126 )
& ? [X125] :
( rpoint(X125)
& X124 = X125 )
& X123 != X124 )
=> ? [X127] :
( rline(X127)
& ron(X123,X127)
& ron(X124,X127) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))') ).
fof('qe(thee(the(408), 1))',conjecture,
? [X1] :
( rline(X1)
& ron(vd1401,X1)
& ron(vd1399,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qe(thee(the(408), 1))') ).
fof('and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))',axiom,
( ? [X4] :
( rpoint(X4)
& vd1399 = X4 )
& ? [X3] :
( rpoint(X3)
& vd1400 = X3 )
& ? [X2] :
( rpoint(X2)
& vd1401 = X2 )
& vd1399 != vd1400
& vd1399 != vd1401
& vd1400 != vd1401
& rline(vd1407)
& ron(vd1399,vd1406)
& ron(vd1400,vd1406)
& vd1406 = vd1407 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))') ).
fof(c_0_3,plain,
! [X123,X124] :
( ( ? [X126] :
( rpoint(X126)
& X123 = X126 )
& ? [X125] :
( rpoint(X125)
& X124 = X125 )
& X123 != X124 )
=> ? [X127] :
( rline(X127)
& ron(X123,X127)
& ron(X124,X127) ) ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))']) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] :
( rline(X1)
& ron(vd1401,X1)
& ron(vd1399,X1) ),
inference(assume_negation,[status(cth)],['qe(thee(the(408), 1))']) ).
fof(c_0_5,plain,
! [X846,X847,X848,X849] :
( ( ~ rpoint(X849)
| X846 != X849
| ~ rpoint(X848)
| X847 != X848
| X846 = X847
| rline(esk4_2(X846,X847)) )
& ( ~ rpoint(X849)
| X846 != X849
| ~ rpoint(X848)
| X847 != X848
| X846 = X847
| ron(X846,esk4_2(X846,X847)) )
& ( ~ rpoint(X849)
| X846 != X849
| ~ rpoint(X848)
| X847 != X848
| X846 = X847
| ron(X847,esk4_2(X846,X847)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])]) ).
fof(c_0_6,plain,
( ? [X4] :
( rpoint(X4)
& vd1399 = X4 )
& ? [X3] :
( rpoint(X3)
& vd1400 = X3 )
& ? [X2] :
( rpoint(X2)
& vd1401 = X2 )
& vd1399 != vd1400
& vd1399 != vd1401
& vd1400 != vd1401
& rline(vd1407)
& ron(vd1399,vd1406)
& ron(vd1400,vd1406)
& vd1406 = vd1407 ),
inference(fof_simplification,[status(thm)],['and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))']) ).
fof(c_0_7,negated_conjecture,
! [X778] :
( ~ rline(X778)
| ~ ron(vd1401,X778)
| ~ ron(vd1399,X778) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_8,plain,
( ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| X1 = X2
| rline(esk4_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
( rpoint(esk38_0)
& vd1399 = esk38_0
& rpoint(esk37_0)
& vd1400 = esk37_0
& rpoint(esk36_0)
& vd1401 = esk36_0
& vd1399 != vd1400
& vd1399 != vd1401
& vd1400 != vd1401
& rline(vd1407)
& ron(vd1399,vd1406)
& ron(vd1400,vd1406)
& vd1406 = vd1407 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_6])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ rline(X1)
| ~ ron(vd1401,X1)
| ~ ron(vd1399,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ rpoint(X2)
| ~ rpoint(X1)
| rline(esk4_2(X1,X2))
| X1 = X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_8])]) ).
cnf(c_0_12,plain,
( ~ rpoint(X4)
| X2 != X4
| ~ rpoint(X3)
| X1 != X3
| X2 = X1
| ron(X1,esk4_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
rpoint(esk38_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
vd1399 = esk38_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( ~ ron(vd1401,esk4_2(X1,X2))
| ~ ron(vd1399,esk4_2(X1,X2))
| ~ rpoint(X2)
| ~ rpoint(X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ rpoint(X1)
| ~ rpoint(X2)
| ron(X1,esk4_2(X2,X1))
| X1 = X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_12])]) ).
cnf(c_0_17,plain,
rpoint(vd1399),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| X1 = X2
| ron(X1,esk4_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,plain,
rpoint(esk36_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
vd1401 = esk36_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,negated_conjecture,
( ~ ron(vd1401,esk4_2(X1,vd1399))
| ~ rpoint(X1)
| X1 = vd1399 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_22,plain,
( ~ rpoint(X2)
| ~ rpoint(X1)
| ron(X1,esk4_2(X1,X2))
| X1 = X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_18])]) ).
cnf(c_0_23,plain,
rpoint(vd1401),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
vd1399 != vd1401,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,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_21,c_0_22]),c_0_23]),c_0_17])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO342+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n018.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 20 15:36:42 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 0.26/0.48 % Version: 3.5.1
% 0.26/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.48 % Starting sh5l with 300s (1) cores
% 0.26/0.48 % sh5l with pid 3910542 completed with status 0
% 0.26/0.48 % Result found by sh5l
% 0.26/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.48 % Starting sh5l with 300s (1) cores
% 0.26/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.48 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.48 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.26/0.48 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.48 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.48 % SubtermCWHack with pid 3910550 completed with status 0
% 0.26/0.48 % Result found by SubtermCWHack
% 0.26/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.48 % Starting sh5l with 300s (1) cores
% 0.26/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.48 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.48 % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.26/0.48 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.48 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.48 % Preprocessing time : 0.007 s
% 0.26/0.48
% 0.26/0.48 % Proof found!
% 0.26/0.48 % SZS status Theorem
% 0.26/0.48 % SZS output start CNFRefutation
% See solution above
% 0.26/0.48 % Parsed axioms : 124
% 0.26/0.48 % Removed by relevancy pruning/SinE : 8
% 0.26/0.48 % Initial clauses : 275
% 0.26/0.48 % Removed in clause preprocessing : 2
% 0.26/0.48 % Initial clauses in saturation : 273
% 0.26/0.48 % Processed clauses : 164
% 0.26/0.48 % ...of these trivial : 6
% 0.26/0.48 % ...subsumed : 21
% 0.26/0.48 % ...remaining for further processing : 137
% 0.26/0.48 % Other redundant clauses eliminated : 57
% 0.26/0.48 % Clauses deleted for lack of memory : 0
% 0.26/0.48 % Backward-subsumed : 0
% 0.26/0.48 % Backward-rewritten : 13
% 0.26/0.48 % Generated clauses : 136
% 0.26/0.48 % ...of the previous two non-redundant : 138
% 0.26/0.48 % ...aggressively subsumed : 0
% 0.26/0.48 % Contextual simplify-reflections : 2
% 0.26/0.48 % Paramodulations : 101
% 0.26/0.48 % Factorizations : 0
% 0.26/0.48 % NegExts : 0
% 0.26/0.48 % Equation resolutions : 57
% 0.26/0.48 % Disequality decompositions : 0
% 0.26/0.48 % Total rewrite steps : 108
% 0.26/0.48 % ...of those cached : 89
% 0.26/0.48 % Propositional unsat checks : 0
% 0.26/0.48 % Propositional check models : 0
% 0.26/0.48 % Propositional check unsatisfiable : 0
% 0.26/0.48 % Propositional clauses : 0
% 0.26/0.48 % Propositional clauses after purity: 0
% 0.26/0.48 % Propositional unsat core size : 0
% 0.26/0.48 % Propositional preprocessing time : 0.000
% 0.26/0.48 % Propositional encoding time : 0.000
% 0.26/0.48 % Propositional solver time : 0.000
% 0.26/0.48 % Success case prop preproc time : 0.000
% 0.26/0.48 % Success case prop encoding time : 0.000
% 0.26/0.48 % Success case prop solver time : 0.000
% 0.26/0.48 % Current number of processed clauses : 89
% 0.26/0.48 % Positive orientable unit clauses : 26
% 0.26/0.48 % Positive unorientable unit clauses: 0
% 0.26/0.48 % Negative unit clauses : 6
% 0.26/0.48 % Non-unit-clauses : 57
% 0.26/0.48 % Current number of unprocessed clauses: 232
% 0.26/0.48 % ...number of literals in the above : 3346
% 0.26/0.48 % Current number of archived formulas : 0
% 0.26/0.48 % Current number of archived clauses : 13
% 0.26/0.48 % Clause-clause subsumption calls (NU) : 992
% 0.26/0.48 % Rec. Clause-clause subsumption calls : 366
% 0.26/0.48 % Non-unit clause-clause subsumptions : 19
% 0.26/0.48 % Unit Clause-clause subsumption calls : 31
% 0.26/0.48 % Rewrite failures with RHS unbound : 0
% 0.26/0.48 % BW rewrite match attempts : 8
% 0.26/0.48 % BW rewrite match successes : 8
% 0.26/0.48 % Condensation attempts : 0
% 0.26/0.48 % Condensation successes : 0
% 0.26/0.48 % Termbank termtop insertions : 49704
% 0.26/0.48 % Search garbage collected termcells : 15217
% 0.26/0.48
% 0.26/0.48 % -------------------------------------------------
% 0.26/0.48 % User time : 0.048 s
% 0.26/0.48 % System time : 0.013 s
% 0.26/0.48 % Total time : 0.061 s
% 0.26/0.48 % Maximum resident set size: 6304 pages
% 0.26/0.48
% 0.26/0.48 % -------------------------------------------------
% 0.26/0.48 % User time : 0.058 s
% 0.26/0.48 % System time : 0.018 s
% 0.26/0.48 % Total time : 0.076 s
% 0.26/0.48 % Maximum resident set size: 5376 pages
% 0.26/0.48 % E exiting
%------------------------------------------------------------------------------