%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO197+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 : n009.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:42 PM UTC 2026
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 18 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 60 ( 25 ~; 17 |; 11 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 64 ( 6 sgn 43 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( incident_point_and_line(intersection_point(X1,X2),X3)
& convergent_lines(X1,X3)
& convergent_lines(X3,X2)
& convergent_lines(X1,X2) )
=> incident_point_and_line(intersection_point(X3,X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(a4,axiom,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',a4) ).
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(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(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+1.ax',p1) ).
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(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X3] :
( ( incident_point_and_line(intersection_point(X1,X2),X3)
& convergent_lines(X1,X3)
& convergent_lines(X3,X2)
& convergent_lines(X1,X2) )
=> incident_point_and_line(intersection_point(X3,X2),X1) ),
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(intersection_point(esk3_0,esk2_0),esk1_0)
& incident_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
& convergent_lines(esk1_0,esk3_0)
& convergent_lines(esk3_0,esk2_0)
& convergent_lines(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,
! [X88,X89] :
( ( incident_point_and_line(X88,X89)
| apart_point_and_line(X88,X89) )
& ( ~ apart_point_and_line(X88,X89)
| ~ incident_point_and_line(X88,X89) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,plain,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(fof_simplification,[status(thm)],[cp2]) ).
fof(c_0_13,plain,
! [X38,X39,X40] :
( apart_point_and_line(X38,X40)
| distinct_lines(X39,X40)
| ~ apart_point_and_line(X38,X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])])]) ).
cnf(c_0_14,negated_conjecture,
~ incident_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( incident_point_and_line(X1,X2)
| apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X48,X49] : ~ apart_point_and_line(X48,parallel_through_point(X49,X48)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])]) ).
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_13]) ).
cnf(c_0_18,negated_conjecture,
apart_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_19,plain,
! [X44,X45] :
( convergent_lines(X44,X45)
| ~ distinct_lines(X44,X45) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])]) ).
cnf(c_0_20,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( distinct_lines(esk1_0,X1)
| apart_point_and_line(intersection_point(esk3_0,esk2_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,
! [X20,X21,X22] :
( convergent_lines(X21,X22)
| convergent_lines(X20,X22)
| ~ convergent_lines(X20,X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])]) ).
cnf(c_0_24,plain,
( ~ distinct_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
distinct_lines(esk1_0,parallel_through_point(X1,intersection_point(esk3_0,esk2_0))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_26,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
fof(c_0_27,plain,
! [X46,X47] : ~ convergent_lines(parallel_through_point(X47,X46),X47),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])]) ).
cnf(c_0_28,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X2,X3)
| convergent_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
convergent_lines(esk1_0,parallel_through_point(X1,intersection_point(esk3_0,esk2_0))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_30,plain,
! [X13] : ~ convergent_lines(X13,X13),
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(esk1_0,X2)
| convergent_lines(parallel_through_point(X1,intersection_point(esk3_0,esk2_0)),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
convergent_lines(esk1_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.03 % Problem : GEO197+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n009.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 20 13:17:59 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.45 Running first-order theorem proving
% 0.13/0.45 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.21/0.49 % Version: 3.5.1
% 0.21/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 % Starting sh5l with 300s (1) cores
% 0.21/0.49 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3574480 completed with status 0
% 0.21/0.49 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.49 % No SInE strategy applied
% 0.21/0.49 % Search class: FGHNF-FFMS22-SFFFFFNN
% 0.21/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.21/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.21/0.49 % Starting new_bool_1 with 136s (1) cores
% 0.21/0.49 % new_bool_3 with pid 3574487 completed with status 0
% 0.21/0.49 % Result found by new_bool_3
% 0.21/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.49 % No SInE strategy applied
% 0.21/0.49 % Search class: FGHNF-FFMS22-SFFFFFNN
% 0.21/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.21/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.21/0.49 % Preprocessing time : 0.001 s
% 0.21/0.49 % Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 % Proof found!
% 0.21/0.49 % SZS status Theorem
% 0.21/0.49 % SZS output start CNFRefutation
% See solution above
% 0.21/0.49 % Parsed axioms : 36
% 0.21/0.49 % Removed by relevancy pruning/SinE : 0
% 0.21/0.49 % Initial clauses : 51
% 0.21/0.49 % Removed in clause preprocessing : 0
% 0.21/0.49 % Initial clauses in saturation : 51
% 0.21/0.49 % Processed clauses : 181
% 0.21/0.49 % ...of these trivial : 0
% 0.21/0.49 % ...subsumed : 27
% 0.21/0.49 % ...remaining for further processing : 154
% 0.21/0.49 % Other redundant clauses eliminated : 0
% 0.21/0.49 % Clauses deleted for lack of memory : 0
% 0.21/0.49 % Backward-subsumed : 1
% 0.21/0.49 % Backward-rewritten : 10
% 0.21/0.49 % Generated clauses : 232
% 0.21/0.49 % ...of the previous two non-redundant : 194
% 0.21/0.49 % ...aggressively subsumed : 0
% 0.21/0.49 % Contextual simplify-reflections : 0
% 0.21/0.49 % Paramodulations : 232
% 0.21/0.49 % Factorizations : 0
% 0.21/0.49 % NegExts : 0
% 0.21/0.49 % Equation resolutions : 0
% 0.21/0.49 % Disequality decompositions : 0
% 0.21/0.49 % Total rewrite steps : 40
% 0.21/0.49 % ...of those cached : 21
% 0.21/0.49 % Propositional unsat checks : 0
% 0.21/0.49 % Propositional check models : 0
% 0.21/0.49 % Propositional check unsatisfiable : 0
% 0.21/0.49 % Propositional clauses : 0
% 0.21/0.49 % Propositional clauses after purity: 0
% 0.21/0.49 % Propositional unsat core size : 0
% 0.21/0.49 % Propositional preprocessing time : 0.000
% 0.21/0.49 % Propositional encoding time : 0.000
% 0.21/0.49 % Propositional solver time : 0.000
% 0.21/0.49 % Success case prop preproc time : 0.000
% 0.21/0.49 % Success case prop encoding time : 0.000
% 0.21/0.49 % Success case prop solver time : 0.000
% 0.21/0.49 % Current number of processed clauses : 96
% 0.21/0.49 % Positive orientable unit clauses : 19
% 0.21/0.49 % Positive unorientable unit clauses: 0
% 0.21/0.49 % Negative unit clauses : 9
% 0.21/0.49 % Non-unit-clauses : 68
% 0.21/0.49 % Current number of unprocessed clauses: 110
% 0.21/0.49 % ...number of literals in the above : 389
% 0.21/0.49 % Current number of archived formulas : 0
% 0.21/0.49 % Current number of archived clauses : 58
% 0.21/0.49 % Clause-clause subsumption calls (NU) : 872
% 0.21/0.49 % Rec. Clause-clause subsumption calls : 486
% 0.21/0.49 % Non-unit clause-clause subsumptions : 24
% 0.21/0.49 % Unit Clause-clause subsumption calls : 98
% 0.21/0.49 % Rewrite failures with RHS unbound : 0
% 0.21/0.49 % BW rewrite match attempts : 6
% 0.21/0.49 % BW rewrite match successes : 6
% 0.21/0.49 % Condensation attempts : 0
% 0.21/0.49 % Condensation successes : 0
% 0.21/0.49 % Termbank termtop insertions : 6457
% 0.21/0.49 % Search garbage collected termcells : 518
% 0.21/0.49
% 0.21/0.49 % -------------------------------------------------
% 0.21/0.49 % User time : 0.010 s
% 0.21/0.49 % System time : 0.004 s
% 0.21/0.49 % Total time : 0.014 s
% 0.21/0.49 % Maximum resident set size: 3680 pages
% 0.21/0.49
% 0.21/0.49 % -------------------------------------------------
% 0.21/0.49 % User time : 0.066 s
% 0.21/0.49 % System time : 0.017 s
% 0.21/0.49 % Total time : 0.082 s
% 0.21/0.49 % Maximum resident set size: 4608 pages
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------