%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO206+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:45 PM UTC 2026
% Result : Theorem 0.15s 5.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 12 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 56 ( 27 ~; 19 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 47 ( 2 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( ~ convergent_lines(X2,X3)
& ~ apart_point_and_line(X1,X2) )
=> ~ distinct_lines(X2,parallel_through_point(X3,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(cup1,axiom,
! [X1,X2,X3] :
( distinct_lines(X2,X3)
=> ( convergent_lines(X2,X3)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cup1) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cp1) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ax6) ).
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_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ convergent_lines(X2,X3)
& ~ apart_point_and_line(X1,X2) )
=> ~ distinct_lines(X2,parallel_through_point(X3,X1)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ convergent_lines(X2,X3)
& ~ apart_point_and_line(X1,X2) )
=> ~ distinct_lines(X2,parallel_through_point(X3,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X43,X44,X45] :
( convergent_lines(X44,X45)
| apart_point_and_line(X43,X45)
| apart_point_and_line(X43,X44)
| ~ distinct_lines(X44,X45) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cup1])])]) ).
fof(c_0_8,negated_conjecture,
( distinct_lines(esk2_0,parallel_through_point(esk3_0,esk1_0))
& ~ convergent_lines(esk2_0,esk3_0)
& ~ apart_point_and_line(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_6])])])]) ).
fof(c_0_9,plain,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
inference(fof_simplification,[status(thm)],[cp1]) ).
fof(c_0_10,plain,
! [X15,X16,X17] :
( convergent_lines(X16,X17)
| convergent_lines(X15,X17)
| ~ convergent_lines(X15,X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])]) ).
cnf(c_0_11,plain,
( ~ distinct_lines(X1,X2)
| convergent_lines(X1,X2)
| apart_point_and_line(X3,X2)
| apart_point_and_line(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
distinct_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(fof_simplification,[status(thm)],[cp2]) ).
fof(c_0_14,plain,
! [X39,X40] : ~ convergent_lines(parallel_through_point(X40,X39),X40),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).
cnf(c_0_15,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X2,X3)
| convergent_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( convergent_lines(esk2_0,parallel_through_point(esk3_0,esk1_0))
| apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_17,plain,
! [X41,X42] : ~ apart_point_and_line(X41,parallel_through_point(X42,X41)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_13])]) ).
cnf(c_0_18,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( convergent_lines(esk2_0,X2)
| convergent_lines(parallel_through_point(esk3_0,esk1_0),X2)
| apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ convergent_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,negated_conjecture,
~ apart_point_and_line(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO206+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n003.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Sun Sep 20 13:29:50 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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
% 0.15/5.45 % Version: 3.5.1
% 0.15/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.45 % Starting sh5l with 300s (1) cores
% 0.15/5.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1930748 completed with status 0
% 0.15/5.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.45 % No SInE strategy applied
% 0.15/5.45 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.15/5.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/5.45 % Starting new_bool_3 with 136s (1) cores
% 0.15/5.45 % Starting new_bool_1 with 136s (1) cores
% 0.15/5.45 % SubtermCWHack with pid 1930752 completed with status 0
% 0.15/5.45 % Result found by SubtermCWHack
% 0.15/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.45 % No SInE strategy applied
% 0.15/5.45 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.15/5.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.45 % Preprocessing time : 0.001 s
% 0.15/5.45
% 0.15/5.45 % Proof found!
% 0.15/5.45 % SZS status Theorem
% 0.15/5.45 % SZS output start CNFRefutation
% See solution above
% 0.15/5.45 % Parsed axioms : 18
% 0.15/5.45 % Removed by relevancy pruning/SinE : 0
% 0.15/5.45 % Initial clauses : 20
% 0.15/5.45 % Removed in clause preprocessing : 0
% 0.15/5.45 % Initial clauses in saturation : 20
% 0.15/5.45 % Processed clauses : 122
% 0.15/5.45 % ...of these trivial : 0
% 0.15/5.45 % ...subsumed : 65
% 0.15/5.45 % ...remaining for further processing : 57
% 0.15/5.45 % Other redundant clauses eliminated : 0
% 0.15/5.45 % Clauses deleted for lack of memory : 0
% 0.15/5.45 % Backward-subsumed : 4
% 0.15/5.45 % Backward-rewritten : 2
% 0.15/5.45 % Generated clauses : 407
% 0.15/5.45 % ...of the previous two non-redundant : 359
% 0.15/5.45 % ...aggressively subsumed : 0
% 0.15/5.45 % Contextual simplify-reflections : 0
% 0.15/5.45 % Paramodulations : 327
% 0.15/5.45 % Factorizations : 80
% 0.15/5.45 % NegExts : 0
% 0.15/5.45 % Equation resolutions : 0
% 0.15/5.45 % Disequality decompositions : 0
% 0.15/5.45 % Total rewrite steps : 49
% 0.15/5.45 % ...of those cached : 47
% 0.15/5.45 % Propositional unsat checks : 0
% 0.15/5.45 % Propositional check models : 0
% 0.15/5.45 % Propositional check unsatisfiable : 0
% 0.15/5.45 % Propositional clauses : 0
% 0.15/5.45 % Propositional clauses after purity: 0
% 0.15/5.45 % Propositional unsat core size : 0
% 0.15/5.45 % Propositional preprocessing time : 0.000
% 0.15/5.45 % Propositional encoding time : 0.000
% 0.15/5.45 % Propositional solver time : 0.000
% 0.15/5.45 % Success case prop preproc time : 0.000
% 0.15/5.45 % Success case prop encoding time : 0.000
% 0.15/5.45 % Success case prop solver time : 0.000
% 0.15/5.45 % Current number of processed clauses : 51
% 0.15/5.45 % Positive orientable unit clauses : 2
% 0.15/5.45 % Positive unorientable unit clauses: 0
% 0.15/5.45 % Negative unit clauses : 7
% 0.15/5.45 % Non-unit-clauses : 42
% 0.15/5.45 % Current number of unprocessed clauses: 245
% 0.15/5.45 % ...number of literals in the above : 1297
% 0.15/5.45 % Current number of archived formulas : 0
% 0.15/5.45 % Current number of archived clauses : 6
% 0.15/5.45 % Clause-clause subsumption calls (NU) : 581
% 0.15/5.45 % Rec. Clause-clause subsumption calls : 297
% 0.15/5.45 % Non-unit clause-clause subsumptions : 68
% 0.15/5.45 % Unit Clause-clause subsumption calls : 10
% 0.15/5.45 % Rewrite failures with RHS unbound : 0
% 0.15/5.45 % BW rewrite match attempts : 1
% 0.15/5.45 % BW rewrite match successes : 1
% 0.15/5.45 % Condensation attempts : 0
% 0.15/5.45 % Condensation successes : 0
% 0.15/5.45 % Termbank termtop insertions : 5709
% 0.15/5.45 % Search garbage collected termcells : 212
% 0.15/5.45
% 0.15/5.45 % -------------------------------------------------
% 0.15/5.45 % User time : 0.007 s
% 0.15/5.45 % System time : 0.004 s
% 0.15/5.45 % Total time : 0.011 s
% 0.15/5.45 % Maximum resident set size: 3652 pages
% 0.15/5.45
% 0.15/5.45 % -------------------------------------------------
% 0.15/5.45 % User time : 0.028 s
% 0.15/5.45 % System time : 0.014 s
% 0.15/5.45 % Total time : 0.042 s
% 0.15/5.45 % Maximum resident set size: 4608 pages
% 0.15/5.45 % E exiting
%------------------------------------------------------------------------------