%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO218+2 : 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 : n007.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:50 PM UTC 2026
% Result : Theorem 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 85 ( 0 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 103 ( 49 ~; 36 |; 12 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 50 ( 0 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X6,X7,X8] :
( ( ~ unorthogonal_lines(X6,X8)
& ~ convergent_lines(X6,X7) )
=> ~ unorthogonal_lines(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(coipo1,axiom,
! [X6,X7] :
~ ( ~ unorthogonal_lines(X6,X7)
& ~ convergent_lines(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+4.ax',coipo1) ).
fof(apart6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart6) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart3) ).
fof(cotno1,axiom,
! [X6,X7,X8] :
( ( ( ~ unorthogonal_lines(X6,X8)
| ~ convergent_lines(X6,X8) )
& ( ~ unorthogonal_lines(X6,X7)
| ~ convergent_lines(X6,X7) ) )
=> ( ~ unorthogonal_lines(X7,X8)
| ~ convergent_lines(X7,X8) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+4.ax',cotno1) ).
fof(c_0_5,negated_conjecture,
~ ! [X6,X7,X8] :
( ( ~ unorthogonal_lines(X6,X8)
& ~ convergent_lines(X6,X7) )
=> ~ unorthogonal_lines(X7,X8) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_6,negated_conjecture,
~ ! [X6,X7,X8] :
( ( ~ unorthogonal_lines(X6,X8)
& ~ convergent_lines(X6,X7) )
=> ~ unorthogonal_lines(X7,X8) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X6,X7] :
~ ( ~ unorthogonal_lines(X6,X7)
& ~ convergent_lines(X6,X7) ),
inference(fof_simplification,[status(thm)],[coipo1]) ).
fof(c_0_8,negated_conjecture,
( unorthogonal_lines(esk2_0,esk3_0)
& ~ unorthogonal_lines(esk1_0,esk3_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_6])])])]) ).
fof(c_0_9,plain,
! [X12,X13] :
( unorthogonal_lines(X12,X13)
| convergent_lines(X12,X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_10,plain,
! [X21,X22,X23] :
( convergent_lines(X22,X23)
| convergent_lines(X21,X23)
| ~ convergent_lines(X21,X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart6])])]) ).
cnf(c_0_11,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( unorthogonal_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X2,X3)
| convergent_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_16,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
cnf(c_0_17,negated_conjecture,
~ convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( convergent_lines(X1,X2)
| convergent_lines(esk1_0,X2)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
fof(c_0_19,plain,
! [X20] : ~ convergent_lines(X20,X20),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).
cnf(c_0_20,negated_conjecture,
( convergent_lines(esk3_0,X1)
| convergent_lines(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_21,plain,
! [X6,X7,X8] :
( ( ( ~ unorthogonal_lines(X6,X8)
| ~ convergent_lines(X6,X8) )
& ( ~ unorthogonal_lines(X6,X7)
| ~ convergent_lines(X6,X7) ) )
=> ( ~ unorthogonal_lines(X7,X8)
| ~ convergent_lines(X7,X8) ) ),
inference(fof_simplification,[status(thm)],[cotno1]) ).
cnf(c_0_22,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( convergent_lines(X1,X2)
| convergent_lines(esk3_0,X2)
| convergent_lines(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
fof(c_0_24,plain,
! [X14,X15,X16] :
( ( ~ unorthogonal_lines(X15,X16)
| ~ convergent_lines(X15,X16)
| unorthogonal_lines(X14,X15)
| unorthogonal_lines(X14,X16) )
& ( ~ unorthogonal_lines(X15,X16)
| ~ convergent_lines(X15,X16)
| unorthogonal_lines(X14,X15)
| convergent_lines(X14,X16) )
& ( ~ unorthogonal_lines(X15,X16)
| ~ convergent_lines(X15,X16)
| convergent_lines(X14,X15)
| unorthogonal_lines(X14,X16) )
& ( ~ unorthogonal_lines(X15,X16)
| ~ convergent_lines(X15,X16)
| convergent_lines(X14,X15)
| convergent_lines(X14,X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
cnf(c_0_25,negated_conjecture,
( convergent_lines(X1,esk2_0)
| convergent_lines(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ unorthogonal_lines(X3,X2)
| ~ convergent_lines(X3,X2)
| convergent_lines(X1,X3)
| unorthogonal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
unorthogonal_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( convergent_lines(X1,esk2_0)
| unorthogonal_lines(X1,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_29]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO218+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 13:35:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.43 % Version: 3.5.1
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % new_bool_1 with pid 2990817 completed with status 0
% 0.10/0.43 % Result found by new_bool_1
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.10/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % SubtermCWHack with pid 2990820 completed with status 0
% 0.10/0.43 % Result found by SubtermCWHack
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.10/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % Preprocessing time : 0.001 s
% 0.10/0.43
% 0.10/0.43 % Proof found!
% 0.10/0.43 % SZS status Theorem
% 0.10/0.43 % SZS output start CNFRefutation
% See solution above
% 0.10/0.43 % Parsed axioms : 16
% 0.10/0.43 % Removed by relevancy pruning/SinE : 10
% 0.10/0.43 % Initial clauses : 11
% 0.10/0.43 % Removed in clause preprocessing : 0
% 0.10/0.43 % Initial clauses in saturation : 11
% 0.10/0.43 % Processed clauses : 57
% 0.10/0.43 % ...of these trivial : 0
% 0.10/0.43 % ...subsumed : 20
% 0.10/0.43 % ...remaining for further processing : 37
% 0.10/0.43 % Other redundant clauses eliminated : 0
% 0.10/0.43 % Clauses deleted for lack of memory : 0
% 0.10/0.43 % Backward-subsumed : 0
% 0.10/0.43 % Backward-rewritten : 0
% 0.10/0.43 % Generated clauses : 176
% 0.10/0.43 % ...of the previous two non-redundant : 127
% 0.10/0.43 % ...aggressively subsumed : 0
% 0.10/0.43 % Contextual simplify-reflections : 0
% 0.10/0.43 % Paramodulations : 144
% 0.10/0.43 % Factorizations : 32
% 0.10/0.43 % NegExts : 0
% 0.10/0.43 % Equation resolutions : 0
% 0.10/0.43 % Disequality decompositions : 0
% 0.10/0.43 % Total rewrite steps : 45
% 0.10/0.43 % ...of those cached : 41
% 0.10/0.43 % Propositional unsat checks : 0
% 0.10/0.43 % Propositional check models : 0
% 0.10/0.43 % Propositional check unsatisfiable : 0
% 0.10/0.43 % Propositional clauses : 0
% 0.10/0.43 % Propositional clauses after purity: 0
% 0.10/0.43 % Propositional unsat core size : 0
% 0.10/0.43 % Propositional preprocessing time : 0.000
% 0.10/0.43 % Propositional encoding time : 0.000
% 0.10/0.43 % Propositional solver time : 0.000
% 0.10/0.43 % Success case prop preproc time : 0.000
% 0.10/0.43 % Success case prop encoding time : 0.000
% 0.10/0.43 % Success case prop solver time : 0.000
% 0.10/0.43 % Current number of processed clauses : 37
% 0.10/0.43 % Positive orientable unit clauses : 5
% 0.10/0.43 % Positive unorientable unit clauses: 0
% 0.10/0.43 % Negative unit clauses : 3
% 0.10/0.43 % Non-unit-clauses : 29
% 0.10/0.43 % Current number of unprocessed clauses: 81
% 0.10/0.43 % ...number of literals in the above : 348
% 0.10/0.43 % Current number of archived formulas : 0
% 0.10/0.43 % Current number of archived clauses : 0
% 0.10/0.43 % Clause-clause subsumption calls (NU) : 280
% 0.10/0.43 % Rec. Clause-clause subsumption calls : 187
% 0.10/0.43 % Non-unit clause-clause subsumptions : 20
% 0.10/0.43 % Unit Clause-clause subsumption calls : 8
% 0.10/0.43 % Rewrite failures with RHS unbound : 0
% 0.10/0.43 % BW rewrite match attempts : 0
% 0.10/0.43 % BW rewrite match successes : 0
% 0.10/0.43 % Condensation attempts : 0
% 0.10/0.43 % Condensation successes : 0
% 0.10/0.43 % Termbank termtop insertions : 2366
% 0.10/0.43 % Search garbage collected termcells : 206
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.006 s
% 0.10/0.43 % System time : 0.003 s
% 0.10/0.43 % Total time : 0.009 s
% 0.10/0.43 % Maximum resident set size: 3656 pages
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.007 s
% 0.10/0.43 % System time : 0.005 s
% 0.10/0.43 % Total time : 0.013 s
% 0.10/0.43 % Maximum resident set size: 4864 pages
% 0.10/0.43 % E exiting
%------------------------------------------------------------------------------