%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO188+3 : TPTP v9.3.1. Released v4.0.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 12:27:38 PM UTC 2026
% Result : Theorem 0.25s 0.64s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 16 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 63 ( 25 ~; 20 |; 11 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 64 ( 3 sgn 43 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( incident_point_and_line(X3,line_connecting(X1,X2))
& distinct_points(X2,X3)
& distinct_points(X1,X3)
& distinct_points(X1,X2) )
=> incident_point_and_line(X1,line_connecting(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(a4,axiom,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',a4) ).
fof(ceq2,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( apart_point_and_line(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq2) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart2) ).
fof(apart5,axiom,
! [X1,X2,X3] :
( distinct_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| distinct_lines(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart5) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp1) ).
fof(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).
fof(cp2,axiom,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp2) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X3] :
( ( incident_point_and_line(X3,line_connecting(X1,X2))
& distinct_points(X2,X3)
& distinct_points(X1,X3)
& distinct_points(X1,X2) )
=> incident_point_and_line(X1,line_connecting(X3,X2)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_9,plain,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
inference(fof_simplification,[status(thm)],[a4]) ).
fof(c_0_10,negated_conjecture,
( ~ incident_point_and_line(esk1_0,line_connecting(esk3_0,esk2_0))
& incident_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))
& distinct_points(esk2_0,esk3_0)
& distinct_points(esk1_0,esk3_0)
& distinct_points(esk1_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_11,plain,
! [X14,X15] :
( ( incident_point_and_line(X14,X15)
| apart_point_and_line(X14,X15) )
& ( ~ apart_point_and_line(X14,X15)
| ~ incident_point_and_line(X14,X15) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,plain,
! [X33,X34,X35] :
( apart_point_and_line(X33,X35)
| distinct_lines(X34,X35)
| ~ apart_point_and_line(X33,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])])]) ).
cnf(c_0_13,negated_conjecture,
~ incident_point_and_line(esk1_0,line_connecting(esk3_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( incident_point_and_line(X1,X2)
| apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X1] : ~ distinct_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart2]) ).
fof(c_0_16,plain,
! [X50,X51,X52] :
( distinct_lines(X51,X52)
| distinct_lines(X50,X52)
| ~ distinct_lines(X50,X51) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])])]) ).
cnf(c_0_17,plain,
( ~ apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| distinct_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
apart_point_and_line(esk1_0,line_connecting(esk3_0,esk2_0)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_19,plain,
! [X49] : ~ distinct_lines(X49,X49),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
cnf(c_0_20,plain,
( ~ distinct_lines(X1,X2)
| distinct_lines(X2,X3)
| distinct_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( distinct_lines(line_connecting(esk3_0,esk2_0),X1)
| apart_point_and_line(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_22,plain,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
inference(fof_simplification,[status(thm)],[cp1]) ).
fof(c_0_23,plain,
! [X56,X57] :
( convergent_lines(X56,X57)
| ~ distinct_lines(X56,X57) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])]) ).
cnf(c_0_24,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( distinct_lines(X1,X2)
| distinct_lines(line_connecting(esk3_0,esk2_0),X2)
| apart_point_and_line(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_26,plain,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(fof_simplification,[status(thm)],[cp2]) ).
fof(c_0_27,plain,
! [X79,X80] : ~ convergent_lines(parallel_through_point(X80,X79),X80),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])]) ).
cnf(c_0_28,plain,
( ~ distinct_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( distinct_lines(X1,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_30,plain,
! [X81,X82] : ~ apart_point_and_line(X81,parallel_through_point(X82,X81)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_26])]) ).
cnf(c_0_31,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( convergent_lines(X1,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
apart_point_and_line(esk1_0,parallel_through_point(line_connecting(esk3_0,esk2_0),X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_33,c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GEO188+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n006.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.47 % CPULimit : 300
% 0.20/0.47 % WCLimit : 300
% 0.20/0.47 % DateTime : Sun Sep 20 13:08:42 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.56 Running first-order theorem proving
% 0.25/0.56 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.25/0.64 % Version: 3.5.1
% 0.25/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.64 % Starting sh5l with 300s (1) cores
% 0.25/0.64 % new_bool_1 with pid 641867 completed with status 0
% 0.25/0.64 % Result found by new_bool_1
% 0.25/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.64 % Search class: FGHNF-FFMS22-SFFFFFNN
% 0.25/0.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.64 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.64 % SubtermCWHack with pid 641876 completed with status 0
% 0.25/0.64 % Result found by SubtermCWHack
% 0.25/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.64 % Search class: FGHNF-FFMS22-SFFFFFNN
% 0.25/0.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.64 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.64 % Preprocessing time : 0.002 s
% 0.25/0.64
% 0.25/0.64 % Proof found!
% 0.25/0.64 % SZS status Theorem
% 0.25/0.64 % SZS output start CNFRefutation
% See solution above
% 0.25/0.64 % Parsed axioms : 36
% 0.25/0.64 % Removed by relevancy pruning/SinE : 4
% 0.25/0.64 % Initial clauses : 43
% 0.25/0.64 % Removed in clause preprocessing : 0
% 0.25/0.64 % Initial clauses in saturation : 43
% 0.25/0.64 % Processed clauses : 166
% 0.25/0.64 % ...of these trivial : 0
% 0.25/0.64 % ...subsumed : 54
% 0.25/0.64 % ...remaining for further processing : 112
% 0.25/0.64 % Other redundant clauses eliminated : 0
% 0.25/0.64 % Clauses deleted for lack of memory : 0
% 0.25/0.64 % Backward-subsumed : 0
% 0.25/0.64 % Backward-rewritten : 0
% 0.25/0.64 % Generated clauses : 391
% 0.25/0.64 % ...of the previous two non-redundant : 291
% 0.25/0.64 % ...aggressively subsumed : 0
% 0.25/0.64 % Contextual simplify-reflections : 0
% 0.25/0.64 % Paramodulations : 331
% 0.25/0.64 % Factorizations : 60
% 0.25/0.64 % NegExts : 0
% 0.25/0.64 % Equation resolutions : 0
% 0.25/0.64 % Disequality decompositions : 0
% 0.25/0.64 % Total rewrite steps : 94
% 0.25/0.64 % ...of those cached : 77
% 0.25/0.64 % Propositional unsat checks : 0
% 0.25/0.64 % Propositional check models : 0
% 0.25/0.64 % Propositional check unsatisfiable : 0
% 0.25/0.64 % Propositional clauses : 0
% 0.25/0.64 % Propositional clauses after purity: 0
% 0.25/0.64 % Propositional unsat core size : 0
% 0.25/0.64 % Propositional preprocessing time : 0.000
% 0.25/0.64 % Propositional encoding time : 0.000
% 0.25/0.64 % Propositional solver time : 0.000
% 0.25/0.64 % Success case prop preproc time : 0.000
% 0.25/0.64 % Success case prop encoding time : 0.000
% 0.25/0.64 % Success case prop solver time : 0.000
% 0.25/0.64 % Current number of processed clauses : 112
% 0.25/0.64 % Positive orientable unit clauses : 19
% 0.25/0.64 % Positive unorientable unit clauses: 0
% 0.25/0.64 % Negative unit clauses : 9
% 0.25/0.64 % Non-unit-clauses : 84
% 0.25/0.64 % Current number of unprocessed clauses: 166
% 0.25/0.64 % ...number of literals in the above : 585
% 0.25/0.64 % Current number of archived formulas : 0
% 0.25/0.64 % Current number of archived clauses : 0
% 0.25/0.64 % Clause-clause subsumption calls (NU) : 845
% 0.25/0.64 % Rec. Clause-clause subsumption calls : 573
% 0.25/0.64 % Non-unit clause-clause subsumptions : 54
% 0.25/0.64 % Unit Clause-clause subsumption calls : 155
% 0.25/0.64 % Rewrite failures with RHS unbound : 0
% 0.25/0.64 % BW rewrite match attempts : 1
% 0.25/0.64 % BW rewrite match successes : 0
% 0.25/0.64 % Condensation attempts : 0
% 0.25/0.64 % Condensation successes : 0
% 0.25/0.64 % Termbank termtop insertions : 6626
% 0.25/0.64 % Search garbage collected termcells : 483
% 0.25/0.64
% 0.25/0.64 % -------------------------------------------------
% 0.25/0.64 % User time : 0.023 s
% 0.25/0.64 % System time : 0.004 s
% 0.25/0.64 % Total time : 0.027 s
% 0.25/0.64 % Maximum resident set size: 3680 pages
% 0.25/0.64
% 0.25/0.64 % -------------------------------------------------
% 0.25/0.64 % User time : 0.027 s
% 0.25/0.64 % System time : 0.010 s
% 0.25/0.64 % Total time : 0.038 s
% 0.25/0.64 % Maximum resident set size: 4608 pages
% 0.25/0.64 % E exiting
%------------------------------------------------------------------------------