%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO213+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:48 PM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 46 ( 16 unt; 0 def)
% Number of atoms : 112 ( 0 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 95 ( 29 ~; 52 |; 8 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 72 ( 0 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X6,X7,X8] :
( unorthogonal_lines(X6,X7)
=> ( unorthogonal_lines(X7,X8)
| distinct_lines(X6,X8) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(occu1,axiom,
! [X6,X7] :
( unorthogonal_lines(X6,X7)
| convergent_lines(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',occu1) ).
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(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(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ax6) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(oac1,axiom,
! [X6,X7,X8] :
( ( unorthogonal_lines(X6,X7)
& convergent_lines(X6,X7) )
=> ( ( unorthogonal_lines(X7,X8)
& convergent_lines(X7,X8) )
| ( unorthogonal_lines(X6,X8)
& convergent_lines(X6,X8) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',oac1) ).
fof(c_0_8,negated_conjecture,
~ ! [X6,X7,X8] :
( unorthogonal_lines(X6,X7)
=> ( unorthogonal_lines(X7,X8)
| distinct_lines(X6,X8) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_9,negated_conjecture,
( ~ unorthogonal_lines(esk2_0,esk3_0)
& ~ distinct_lines(esk1_0,esk3_0)
& unorthogonal_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_10,plain,
! [X13,X14] :
( unorthogonal_lines(X13,X14)
| convergent_lines(X13,X14) ),
inference(variable_rename,[status(thm)],[occu1]) ).
fof(c_0_11,plain,
! [X33,X34,X35] :
( convergent_lines(X33,X35)
| distinct_lines(X34,X35)
| ~ convergent_lines(X33,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])]) ).
cnf(c_0_12,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( unorthogonal_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X1] : ~ distinct_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart2]) ).
fof(c_0_15,plain,
! [X23,X24,X25] :
( distinct_lines(X24,X25)
| distinct_lines(X23,X25)
| ~ distinct_lines(X23,X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])])]) ).
cnf(c_0_16,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| distinct_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_18,plain,
! [X22] : ~ distinct_lines(X22,X22),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
cnf(c_0_19,plain,
( ~ distinct_lines(X1,X2)
| distinct_lines(X2,X3)
| distinct_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( distinct_lines(esk3_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( distinct_lines(X1,X2)
| distinct_lines(esk3_0,X2)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_23,plain,
! [X40,X41,X42] :
( convergent_lines(X41,X42)
| convergent_lines(X40,X42)
| ~ convergent_lines(X40,X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])]) ).
cnf(c_0_24,negated_conjecture,
~ distinct_lines(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
( distinct_lines(X1,esk3_0)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_26,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
cnf(c_0_27,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X2,X3)
| convergent_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_29,plain,
! [X39] : ~ convergent_lines(X39,X39),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_26])]) ).
cnf(c_0_30,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( convergent_lines(X1,X2)
| convergent_lines(esk1_0,X2)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
( convergent_lines(X1,X2)
| convergent_lines(esk2_0,X2)
| convergent_lines(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_33]) ).
fof(c_0_35,plain,
! [X15,X16,X17] :
( ( ~ unorthogonal_lines(X15,X16)
| ~ convergent_lines(X15,X16)
| unorthogonal_lines(X15,X17)
| unorthogonal_lines(X16,X17) )
& ( ~ unorthogonal_lines(X15,X16)
| ~ convergent_lines(X15,X16)
| unorthogonal_lines(X15,X17)
| convergent_lines(X16,X17) )
& ( ~ unorthogonal_lines(X15,X16)
| ~ convergent_lines(X15,X16)
| convergent_lines(X15,X17)
| unorthogonal_lines(X16,X17) )
& ( ~ unorthogonal_lines(X15,X16)
| ~ convergent_lines(X15,X16)
| convergent_lines(X15,X17)
| convergent_lines(X16,X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oac1])])])]) ).
cnf(c_0_36,negated_conjecture,
( convergent_lines(X1,esk1_0)
| convergent_lines(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_34]) ).
cnf(c_0_37,plain,
( ~ unorthogonal_lines(X3,X1)
| ~ convergent_lines(X3,X1)
| convergent_lines(X3,X2)
| unorthogonal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_38,negated_conjecture,
unorthogonal_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_39,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_31,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( convergent_lines(esk1_0,X1)
| unorthogonal_lines(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_41,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_12,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
( distinct_lines(esk3_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_41]) ).
cnf(c_0_43,negated_conjecture,
( distinct_lines(X1,X2)
| distinct_lines(esk3_0,X2)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_42]) ).
cnf(c_0_44,negated_conjecture,
( distinct_lines(X1,esk3_0)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_43]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_44]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO213+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n026.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 20 13:36:53 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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.12/0.45 % Version: 3.5.1
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % Starting sh5l with 300s (1) cores
% 0.12/0.45 % new_bool_3 with pid 4193122 completed with status 0
% 0.12/0.45 % Result found by new_bool_3
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.12/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.45 % SubtermCWHack with pid 4193125 completed with status 0
% 0.12/0.45 % Result found by SubtermCWHack
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.12/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.45 % Preprocessing time : 0.001 s
% 0.12/0.45
% 0.12/0.45 % Proof found!
% 0.12/0.45 % SZS status Theorem
% 0.12/0.45 % SZS output start CNFRefutation
% See solution above
% 0.12/0.45 % Parsed axioms : 23
% 0.12/0.45 % Removed by relevancy pruning/SinE : 8
% 0.12/0.45 % Initial clauses : 20
% 0.12/0.45 % Removed in clause preprocessing : 0
% 0.12/0.45 % Initial clauses in saturation : 20
% 0.12/0.45 % Processed clauses : 111
% 0.12/0.45 % ...of these trivial : 0
% 0.12/0.45 % ...subsumed : 37
% 0.12/0.45 % ...remaining for further processing : 74
% 0.12/0.45 % Other redundant clauses eliminated : 0
% 0.12/0.45 % Clauses deleted for lack of memory : 0
% 0.12/0.45 % Backward-subsumed : 1
% 0.12/0.45 % Backward-rewritten : 0
% 0.12/0.45 % Generated clauses : 404
% 0.12/0.45 % ...of the previous two non-redundant : 324
% 0.12/0.45 % ...aggressively subsumed : 0
% 0.12/0.45 % Contextual simplify-reflections : 0
% 0.12/0.45 % Paramodulations : 350
% 0.12/0.45 % Factorizations : 54
% 0.12/0.45 % NegExts : 0
% 0.12/0.45 % Equation resolutions : 0
% 0.12/0.45 % Disequality decompositions : 0
% 0.12/0.45 % Total rewrite steps : 74
% 0.12/0.45 % ...of those cached : 68
% 0.12/0.45 % Propositional unsat checks : 0
% 0.12/0.45 % Propositional check models : 0
% 0.12/0.45 % Propositional check unsatisfiable : 0
% 0.12/0.45 % Propositional clauses : 0
% 0.12/0.45 % Propositional clauses after purity: 0
% 0.12/0.45 % Propositional unsat core size : 0
% 0.12/0.45 % Propositional preprocessing time : 0.000
% 0.12/0.45 % Propositional encoding time : 0.000
% 0.12/0.45 % Propositional solver time : 0.000
% 0.12/0.45 % Success case prop preproc time : 0.000
% 0.12/0.45 % Success case prop encoding time : 0.000
% 0.12/0.45 % Success case prop solver time : 0.000
% 0.12/0.45 % Current number of processed clauses : 73
% 0.12/0.45 % Positive orientable unit clauses : 7
% 0.12/0.45 % Positive unorientable unit clauses: 0
% 0.12/0.45 % Negative unit clauses : 5
% 0.12/0.45 % Non-unit-clauses : 61
% 0.12/0.45 % Current number of unprocessed clauses: 233
% 0.12/0.45 % ...number of literals in the above : 1110
% 0.12/0.45 % Current number of archived formulas : 0
% 0.12/0.45 % Current number of archived clauses : 1
% 0.12/0.45 % Clause-clause subsumption calls (NU) : 802
% 0.12/0.45 % Rec. Clause-clause subsumption calls : 473
% 0.12/0.45 % Non-unit clause-clause subsumptions : 37
% 0.12/0.45 % Unit Clause-clause subsumption calls : 66
% 0.12/0.45 % Rewrite failures with RHS unbound : 0
% 0.12/0.45 % BW rewrite match attempts : 1
% 0.12/0.45 % BW rewrite match successes : 1
% 0.12/0.45 % Condensation attempts : 0
% 0.12/0.45 % Condensation successes : 0
% 0.12/0.45 % Termbank termtop insertions : 5420
% 0.12/0.45 % Search garbage collected termcells : 263
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.014 s
% 0.12/0.45 % System time : 0.000 s
% 0.12/0.45 % Total time : 0.014 s
% 0.12/0.45 % Maximum resident set size: 3660 pages
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.015 s
% 0.12/0.45 % System time : 0.004 s
% 0.12/0.45 % Total time : 0.019 s
% 0.12/0.45 % Maximum resident set size: 4864 pages
% 0.12/0.45 % E exiting
%------------------------------------------------------------------------------