%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO224+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 : n010.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:52 PM UTC 2026
% Result : Theorem 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 17 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 64 ( 28 ~; 22 |; 7 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 6 sgn 42 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2] :
( ( line(X2)
& point(X1) )
=> ? [X3] :
( incident_point_and_line(X3,X2)
& point(X3) ) ),
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(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(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq3) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp1) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] :
( ( line(X2)
& point(X1) )
=> ? [X3] :
( incident_point_and_line(X3,X2)
& point(X3) ) ),
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,
! [X13] :
( ( ~ incident_point_and_line(X13,esk2_0)
| ~ point(X13) )
& line(esk2_0)
& point(esk1_0) ),
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_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])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ incident_point_and_line(X1,esk2_0)
| ~ point(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( incident_point_and_line(X1,X2)
| apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X39,X40,X41] :
( apart_point_and_line(X39,X41)
| distinct_lines(X40,X41)
| ~ apart_point_and_line(X39,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])])]) ).
cnf(c_0_15,negated_conjecture,
( ~ point(X1)
| apart_point_and_line(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
point(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(fof_simplification,[status(thm)],[cp2]) ).
fof(c_0_18,plain,
! [X64,X65] :
( convergent_lines(X64,X65)
| ~ distinct_lines(X64,X65) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])]) ).
cnf(c_0_19,plain,
( ~ apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| distinct_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
apart_point_and_line(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,plain,
! [X42,X43] : ~ apart_point_and_line(X42,parallel_through_point(X43,X42)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_17])]) ).
cnf(c_0_22,plain,
( ~ distinct_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( distinct_lines(esk2_0,X1)
| apart_point_and_line(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_24,plain,
! [X61,X62,X63] :
( convergent_lines(X61,X63)
| distinct_lines(X62,X63)
| ~ convergent_lines(X61,X62) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])]) ).
cnf(c_0_25,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( convergent_lines(esk2_0,X1)
| apart_point_and_line(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_27,plain,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
inference(fof_simplification,[status(thm)],[cp1]) ).
cnf(c_0_28,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| distinct_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
convergent_lines(esk2_0,parallel_through_point(X1,esk1_0)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_30,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
fof(c_0_31,plain,
! [X66,X67] : ~ convergent_lines(parallel_through_point(X67,X66),X67),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_27])]) ).
cnf(c_0_32,negated_conjecture,
( distinct_lines(parallel_through_point(X2,esk1_0),X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_33,plain,
! [X57] : ~ convergent_lines(X57,X57),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_30])]) ).
cnf(c_0_34,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( convergent_lines(esk2_0,X2)
| convergent_lines(parallel_through_point(X1,esk1_0),X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_32]) ).
cnf(c_0_36,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
convergent_lines(esk2_0,X1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_36,c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO224+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 % Computer : n010.cluster.edu
% 0.10/0.40 % Model : x86_64 x86_64
% 0.10/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.40 % Memory : 8046.5625MB
% 0.10/0.40 % OS : Linux 6.8.0-71-generic
% 0.10/0.40 % CPULimit : 300
% 0.10/0.40 % WCLimit : 300
% 0.10/0.40 % DateTime : Sun Sep 20 13:58:40 UTC 2026
% 0.10/0.40 % CPUTime :
% 0.10/0.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.45 Running first-order theorem proving
% 0.10/0.45 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.17/0.48 % Version: 3.5.1
% 0.17/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 % Starting sh5l with 300s (1) cores
% 0.17/0.48 % sh5l with pid 2962063 completed with status 0
% 0.17/0.48 % Result found by sh5l
% 0.17/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 % Starting sh5l with 300s (1) cores
% 0.17/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.17/0.48 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.48 % Search class: FGHNF-FFMF22-SFFFFFNN
% 0.17/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.17/0.48 % SubtermCWHack with pid 2962070 completed with status 0
% 0.17/0.48 % Result found by SubtermCWHack
% 0.17/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 % Starting sh5l with 300s (1) cores
% 0.17/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.17/0.48 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.48 % Search class: FGHNF-FFMF22-SFFFFFNN
% 0.17/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.17/0.48 % Preprocessing time : 0.002 s
% 0.17/0.48
% 0.17/0.48 % Proof found!
% 0.17/0.48 % SZS status Theorem
% 0.17/0.48 % SZS output start CNFRefutation
% See solution above
% 0.17/0.48 % Parsed axioms : 36
% 0.17/0.48 % Removed by relevancy pruning/SinE : 4
% 0.17/0.48 % Initial clauses : 41
% 0.17/0.48 % Removed in clause preprocessing : 0
% 0.17/0.48 % Initial clauses in saturation : 41
% 0.17/0.48 % Processed clauses : 49
% 0.17/0.48 % ...of these trivial : 0
% 0.17/0.48 % ...subsumed : 2
% 0.17/0.48 % ...remaining for further processing : 47
% 0.17/0.48 % Other redundant clauses eliminated : 0
% 0.17/0.48 % Clauses deleted for lack of memory : 0
% 0.17/0.48 % Backward-subsumed : 0
% 0.17/0.48 % Backward-rewritten : 9
% 0.17/0.48 % Generated clauses : 59
% 0.17/0.48 % ...of the previous two non-redundant : 46
% 0.17/0.48 % ...aggressively subsumed : 0
% 0.17/0.48 % Contextual simplify-reflections : 0
% 0.17/0.48 % Paramodulations : 59
% 0.17/0.48 % Factorizations : 0
% 0.17/0.48 % NegExts : 0
% 0.17/0.48 % Equation resolutions : 0
% 0.17/0.48 % Disequality decompositions : 0
% 0.17/0.48 % Total rewrite steps : 18
% 0.17/0.48 % ...of those cached : 7
% 0.17/0.48 % Propositional unsat checks : 0
% 0.17/0.48 % Propositional check models : 0
% 0.17/0.48 % Propositional check unsatisfiable : 0
% 0.17/0.48 % Propositional clauses : 0
% 0.17/0.48 % Propositional clauses after purity: 0
% 0.17/0.48 % Propositional unsat core size : 0
% 0.17/0.48 % Propositional preprocessing time : 0.000
% 0.17/0.48 % Propositional encoding time : 0.000
% 0.17/0.48 % Propositional solver time : 0.000
% 0.17/0.48 % Success case prop preproc time : 0.000
% 0.17/0.48 % Success case prop encoding time : 0.000
% 0.17/0.48 % Success case prop solver time : 0.000
% 0.17/0.48 % Current number of processed clauses : 38
% 0.17/0.48 % Positive orientable unit clauses : 7
% 0.17/0.48 % Positive unorientable unit clauses: 0
% 0.17/0.48 % Negative unit clauses : 7
% 0.17/0.48 % Non-unit-clauses : 24
% 0.17/0.48 % Current number of unprocessed clauses: 38
% 0.17/0.48 % ...number of literals in the above : 126
% 0.17/0.48 % Current number of archived formulas : 0
% 0.17/0.48 % Current number of archived clauses : 9
% 0.17/0.48 % Clause-clause subsumption calls (NU) : 51
% 0.17/0.48 % Rec. Clause-clause subsumption calls : 49
% 0.17/0.48 % Non-unit clause-clause subsumptions : 2
% 0.17/0.48 % Unit Clause-clause subsumption calls : 13
% 0.17/0.48 % Rewrite failures with RHS unbound : 0
% 0.17/0.48 % BW rewrite match attempts : 6
% 0.17/0.48 % BW rewrite match successes : 6
% 0.17/0.48 % Condensation attempts : 0
% 0.17/0.48 % Condensation successes : 0
% 0.17/0.48 % Termbank termtop insertions : 3537
% 0.17/0.48 % Search garbage collected termcells : 473
% 0.17/0.48
% 0.17/0.48 % -------------------------------------------------
% 0.17/0.48 % User time : 0.007 s
% 0.17/0.48 % System time : 0.003 s
% 0.17/0.48 % Total time : 0.011 s
% 0.17/0.48 % Maximum resident set size: 3680 pages
% 0.17/0.48
% 0.17/0.48 % -------------------------------------------------
% 0.17/0.48 % User time : 0.010 s
% 0.17/0.48 % System time : 0.008 s
% 0.17/0.48 % Total time : 0.018 s
% 0.17/0.48 % Maximum resident set size: 4864 pages
% 0.17/0.48 % E exiting
%------------------------------------------------------------------------------