%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO181+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:36 PM UTC 2026
% Result : Theorem 0.22s 0.63s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 15 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 46 ( 20 ~; 17 |; 2 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 3 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( apart_point_and_line(X3,line_connecting(X1,X2))
=> apart_point_and_line(X2,line_connecting(X1,X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
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/sandbox/benchmark/Axioms/GEO006+0.ax',ceq2) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/GEO006+0.ax',apart5) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cp1) ).
fof(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+1.ax',p1) ).
fof(cp2,axiom,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cp2) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( apart_point_and_line(X3,line_connecting(X1,X2))
=> apart_point_and_line(X2,line_connecting(X1,X3)) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_8,plain,
! [X29,X30,X31] :
( apart_point_and_line(X29,X31)
| distinct_lines(X30,X31)
| ~ apart_point_and_line(X29,X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])])]) ).
fof(c_0_9,negated_conjecture,
( ~ apart_point_and_line(esk2_0,line_connecting(esk1_0,esk3_0))
& apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_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_7])])])]) ).
fof(c_0_10,plain,
! [X1] : ~ distinct_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart2]) ).
fof(c_0_11,plain,
! [X76,X77,X78] :
( distinct_lines(X77,X78)
| distinct_lines(X76,X78)
| ~ distinct_lines(X76,X77) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])])]) ).
cnf(c_0_12,plain,
( ~ apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| distinct_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X75] : ~ distinct_lines(X75,X75),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).
cnf(c_0_15,plain,
( ~ distinct_lines(X1,X2)
| distinct_lines(X2,X3)
| distinct_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( distinct_lines(line_connecting(esk1_0,esk2_0),X1)
| apart_point_and_line(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_17,plain,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
inference(fof_simplification,[status(thm)],[cp1]) ).
fof(c_0_18,plain,
! [X58,X59] :
( convergent_lines(X58,X59)
| ~ distinct_lines(X58,X59) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])]) ).
cnf(c_0_19,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( distinct_lines(X1,X2)
| distinct_lines(line_connecting(esk1_0,esk2_0),X2)
| apart_point_and_line(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,plain,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(fof_simplification,[status(thm)],[cp2]) ).
fof(c_0_22,plain,
! [X60,X61] : ~ convergent_lines(parallel_through_point(X61,X60),X61),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_17])]) ).
cnf(c_0_23,plain,
( ~ distinct_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( distinct_lines(X1,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_25,plain,
! [X32,X33] : ~ apart_point_and_line(X32,parallel_through_point(X33,X32)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_21])]) ).
cnf(c_0_26,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( convergent_lines(X1,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
apart_point_and_line(esk3_0,parallel_through_point(line_connecting(esk1_0,esk2_0),X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_28,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GEO181+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n005.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Sun Sep 20 13:05:33 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.55 Running first-order theorem proving
% 0.22/0.56 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.22/0.63 % Version: 3.5.1
% 0.22/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.63 % Starting sh5l with 300s (1) cores
% 0.22/0.63 % sh5l with pid 1097684 completed with status 0
% 0.22/0.63 % Result found by sh5l
% 0.22/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.63 % Starting sh5l with 300s (1) cores
% 0.22/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.63 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.63 % Search class: FGHNF-FFMF22-SFFFFFNN
% 0.22/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.63 % SubtermCWHack with pid 1097691 completed with status 0
% 0.22/0.63 % Result found by SubtermCWHack
% 0.22/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.63 % Starting sh5l with 300s (1) cores
% 0.22/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.63 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.63 % Search class: FGHNF-FFMF22-SFFFFFNN
% 0.22/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.63 % Preprocessing time : 0.002 s
% 0.22/0.63
% 0.22/0.63 % Proof found!
% 0.22/0.63 % SZS status Theorem
% 0.22/0.63 % SZS output start CNFRefutation
% See solution above
% 0.22/0.63 % Parsed axioms : 36
% 0.22/0.63 % Removed by relevancy pruning/SinE : 5
% 0.22/0.63 % Initial clauses : 39
% 0.22/0.63 % Removed in clause preprocessing : 0
% 0.22/0.63 % Initial clauses in saturation : 39
% 0.22/0.63 % Processed clauses : 161
% 0.22/0.63 % ...of these trivial : 0
% 0.22/0.63 % ...subsumed : 53
% 0.22/0.63 % ...remaining for further processing : 108
% 0.22/0.63 % Other redundant clauses eliminated : 0
% 0.22/0.63 % Clauses deleted for lack of memory : 0
% 0.22/0.63 % Backward-subsumed : 0
% 0.22/0.63 % Backward-rewritten : 0
% 0.22/0.63 % Generated clauses : 388
% 0.22/0.63 % ...of the previous two non-redundant : 291
% 0.22/0.63 % ...aggressively subsumed : 0
% 0.22/0.63 % Contextual simplify-reflections : 0
% 0.22/0.63 % Paramodulations : 328
% 0.22/0.63 % Factorizations : 60
% 0.22/0.63 % NegExts : 0
% 0.22/0.63 % Equation resolutions : 0
% 0.22/0.63 % Disequality decompositions : 0
% 0.22/0.63 % Total rewrite steps : 94
% 0.22/0.63 % ...of those cached : 77
% 0.22/0.63 % Propositional unsat checks : 0
% 0.22/0.63 % Propositional check models : 0
% 0.22/0.63 % Propositional check unsatisfiable : 0
% 0.22/0.63 % Propositional clauses : 0
% 0.22/0.63 % Propositional clauses after purity: 0
% 0.22/0.63 % Propositional unsat core size : 0
% 0.22/0.63 % Propositional preprocessing time : 0.000
% 0.22/0.63 % Propositional encoding time : 0.000
% 0.22/0.63 % Propositional solver time : 0.000
% 0.22/0.63 % Success case prop preproc time : 0.000
% 0.22/0.63 % Success case prop encoding time : 0.000
% 0.22/0.63 % Success case prop solver time : 0.000
% 0.22/0.63 % Current number of processed clauses : 108
% 0.22/0.63 % Positive orientable unit clauses : 18
% 0.22/0.63 % Positive unorientable unit clauses: 0
% 0.22/0.63 % Negative unit clauses : 8
% 0.22/0.63 % Non-unit-clauses : 82
% 0.22/0.63 % Current number of unprocessed clauses: 167
% 0.22/0.63 % ...number of literals in the above : 589
% 0.22/0.63 % Current number of archived formulas : 0
% 0.22/0.63 % Current number of archived clauses : 0
% 0.22/0.63 % Clause-clause subsumption calls (NU) : 1065
% 0.22/0.63 % Rec. Clause-clause subsumption calls : 703
% 0.22/0.63 % Non-unit clause-clause subsumptions : 53
% 0.22/0.63 % Unit Clause-clause subsumption calls : 145
% 0.22/0.63 % Rewrite failures with RHS unbound : 0
% 0.22/0.63 % BW rewrite match attempts : 1
% 0.22/0.63 % BW rewrite match successes : 0
% 0.22/0.63 % Condensation attempts : 0
% 0.22/0.63 % Condensation successes : 0
% 0.22/0.63 % Termbank termtop insertions : 6441
% 0.22/0.63 % Search garbage collected termcells : 457
% 0.22/0.63
% 0.22/0.63 % -------------------------------------------------
% 0.22/0.63 % User time : 0.020 s
% 0.22/0.63 % System time : 0.004 s
% 0.22/0.63 % Total time : 0.024 s
% 0.22/0.63 % Maximum resident set size: 3424 pages
% 0.22/0.63
% 0.22/0.63 % -------------------------------------------------
% 0.22/0.63 % User time : 0.024 s
% 0.22/0.63 % System time : 0.009 s
% 0.22/0.63 % Total time : 0.034 s
% 0.22/0.63 % Maximum resident set size: 4608 pages
% 0.22/0.63 % E exiting
%------------------------------------------------------------------------------