%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO215+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 04:04:47 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 40 ( 10 unt; 0 def)
% Number of atoms : 116 ( 0 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 115 ( 39 ~; 59 |; 8 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X6,X7,X8] :
( convergent_lines(X6,X7)
=> ( unorthogonal_lines(X6,X8)
| unorthogonal_lines(X7,X8) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq3) ).
fof(ouo1,axiom,
! [X9,X6,X7,X8] :
( distinct_lines(X6,X7)
=> ( apart_point_and_line(X9,X6)
| apart_point_and_line(X9,X7)
| unorthogonal_lines(X6,X8)
| unorthogonal_lines(X7,X8) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',ouo1) ).
fof(oac1,axiom,
! [X6,X7,X8] :
( ( convergent_lines(X6,X7)
& unorthogonal_lines(X6,X7) )
=> ( ( convergent_lines(X6,X8)
& unorthogonal_lines(X6,X8) )
| ( convergent_lines(X7,X8)
& unorthogonal_lines(X7,X8) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',oac1) ).
fof(occu1,axiom,
! [X6,X7] :
( convergent_lines(X6,X7)
| unorthogonal_lines(X6,X7) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',occu1) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci4) ).
fof(c_0_8,negated_conjecture,
~ ! [X6,X7,X8] :
( convergent_lines(X6,X7)
=> ( unorthogonal_lines(X6,X8)
| unorthogonal_lines(X7,X8) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_9,plain,
! [X4,X5,X6] :
( ~ convergent_lines(X4,X5)
| distinct_lines(X5,X6)
| convergent_lines(X4,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])])]) ).
fof(c_0_10,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& ~ unorthogonal_lines(esk1_0,esk3_0)
& ~ unorthogonal_lines(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_11,plain,
! [X10,X11,X12,X13] :
( ~ distinct_lines(X11,X12)
| apart_point_and_line(X10,X11)
| apart_point_and_line(X10,X12)
| unorthogonal_lines(X11,X13)
| unorthogonal_lines(X12,X13) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ouo1])])])]) ).
cnf(c_0_12,plain,
( convergent_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ convergent_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X9,X10,X11] :
( ( convergent_lines(X10,X11)
| convergent_lines(X9,X11)
| ~ convergent_lines(X9,X10)
| ~ unorthogonal_lines(X9,X10) )
& ( unorthogonal_lines(X10,X11)
| convergent_lines(X9,X11)
| ~ convergent_lines(X9,X10)
| ~ unorthogonal_lines(X9,X10) )
& ( convergent_lines(X10,X11)
| unorthogonal_lines(X9,X11)
| ~ convergent_lines(X9,X10)
| ~ unorthogonal_lines(X9,X10) )
& ( unorthogonal_lines(X10,X11)
| unorthogonal_lines(X9,X11)
| ~ convergent_lines(X9,X10)
| ~ unorthogonal_lines(X9,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oac1])])])])]) ).
cnf(c_0_15,plain,
( unorthogonal_lines(X1,X2)
| unorthogonal_lines(X3,X2)
| apart_point_and_line(X4,X1)
| apart_point_and_line(X4,X3)
| ~ distinct_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( convergent_lines(esk1_0,X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_17,plain,
! [X8,X9] :
( convergent_lines(X8,X9)
| unorthogonal_lines(X8,X9) ),
inference(variable_rename,[status(thm)],[occu1]) ).
cnf(c_0_18,plain,
( unorthogonal_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ unorthogonal_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( unorthogonal_lines(esk2_0,X1)
| unorthogonal_lines(X2,X1)
| apart_point_and_line(X3,esk2_0)
| apart_point_and_line(X3,X2)
| convergent_lines(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
( unorthogonal_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X2] : ~ convergent_lines(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart3])]) ).
fof(c_0_23,plain,
( ~ epred1_0
<=> ! [X1] :
( convergent_lines(esk3_0,X1)
| unorthogonal_lines(esk1_0,X1) ) ),
introduced(definition) ).
fof(c_0_24,plain,
( ~ epred2_0
<=> ! [X2] :
( apart_point_and_line(X2,esk2_0)
| apart_point_and_line(X2,esk1_0) ) ),
introduced(definition) ).
cnf(c_0_25,negated_conjecture,
( unorthogonal_lines(esk2_0,X1)
| unorthogonal_lines(X2,X3)
| apart_point_and_line(X4,esk2_0)
| apart_point_and_line(X4,X2)
| convergent_lines(esk1_0,X2)
| convergent_lines(X1,X3)
| ~ convergent_lines(X2,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( epred1_0
| unorthogonal_lines(esk1_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(split_equiv,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),c_0_23]),c_0_24]) ).
cnf(c_0_31,negated_conjecture,
epred1_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_29]),c_0_28]) ).
fof(c_0_32,plain,
! [X3,X4] :
( ~ convergent_lines(X3,X4)
| ~ apart_point_and_line(intersection_point(X3,X4),X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ci3])])]) ).
cnf(c_0_33,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
fof(c_0_34,plain,
! [X3,X4] :
( ~ convergent_lines(X3,X4)
| ~ apart_point_and_line(intersection_point(X3,X4),X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ci4])])]) ).
cnf(c_0_35,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X1,esk2_0) ),
inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_24]),c_0_33]) ).
cnf(c_0_37,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,X1),esk2_0)
| ~ convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO215+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 00:22:13 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.015 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 40
% 0.23/1.41 # Proof object clause steps : 21
% 0.23/1.41 # Proof object formula steps : 19
% 0.23/1.41 # Proof object conjectures : 17
% 0.23/1.41 # Proof object clause conjectures : 14
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 11
% 0.23/1.41 # Proof object initial formulas used : 8
% 0.23/1.41 # Proof object generating inferences : 8
% 0.23/1.41 # Proof object simplifying inferences : 10
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 23
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 28
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 28
% 0.23/1.41 # Processed clauses : 503
% 0.23/1.41 # ...of these trivial : 3
% 0.23/1.41 # ...subsumed : 241
% 0.23/1.41 # ...remaining for further processing : 259
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 5
% 0.23/1.41 # Backward-rewritten : 2
% 0.23/1.41 # Generated clauses : 4977
% 0.23/1.41 # ...of the previous two non-trivial : 3968
% 0.23/1.41 # Contextual simplify-reflections : 89
% 0.23/1.41 # Paramodulations : 4604
% 0.23/1.41 # Factorizations : 370
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 251
% 0.23/1.41 # Positive orientable unit clauses : 27
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 10
% 0.23/1.41 # Non-unit-clauses : 214
% 0.23/1.41 # Current number of unprocessed clauses: 3403
% 0.23/1.41 # ...number of literals in the above : 25632
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 7
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 71235
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 17624
% 0.23/1.41 # Non-unit clause-clause subsumptions : 332
% 0.23/1.41 # Unit Clause-clause subsumption calls : 2350
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 5
% 0.23/1.41 # BW rewrite match successes : 4
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 88557
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.135 s
% 0.23/1.41 # System time : 0.005 s
% 0.23/1.41 # Total time : 0.140 s
% 0.23/1.41 # Maximum resident set size: 6264 pages
% 0.25/23.40 eprover: CPU time limit exceeded, terminating
% 0.25/23.41 eprover: CPU time limit exceeded, terminating
% 0.25/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.42 eprover: No such file or directory
% 0.25/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.42 eprover: No such file or directory
% 0.25/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.42 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------