%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO221+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:51 EDT 2022
% Result : Theorem 0.20s 1.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 49 ( 20 ~; 21 |; 3 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 49 ( 6 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X9,X10,X6] :
( incident_point_and_line(X10,orthogonal_through_point(X6,X9))
=> equal_lines(orthogonal_through_point(X6,X9),orthogonal_through_point(X6,X10)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).
fof(ax2,axiom,
! [X1,X2] :
( equal_lines(X1,X2)
<=> ~ distinct_lines(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',ax2) ).
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(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(ooc2,axiom,
! [X9,X6] : ~ apart_point_and_line(X9,orthogonal_through_point(X6,X9)),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',ooc2) ).
fof(ooc1,axiom,
! [X9,X6] : ~ unorthogonal_lines(orthogonal_through_point(X6,X9),X6),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',ooc1) ).
fof(c_0_6,negated_conjecture,
~ ! [X9,X10,X6] :
( incident_point_and_line(X10,orthogonal_through_point(X6,X9))
=> equal_lines(orthogonal_through_point(X6,X9),orthogonal_through_point(X6,X10)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_7,negated_conjecture,
( incident_point_and_line(esk2_0,orthogonal_through_point(esk3_0,esk1_0))
& ~ equal_lines(orthogonal_through_point(esk3_0,esk1_0),orthogonal_through_point(esk3_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X3,X4,X3,X4] :
( ( ~ equal_lines(X3,X4)
| ~ distinct_lines(X3,X4) )
& ( distinct_lines(X3,X4)
| equal_lines(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax2])])])])]) ).
fof(c_0_9,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_10,negated_conjecture,
~ equal_lines(orthogonal_through_point(esk3_0,esk1_0),orthogonal_through_point(esk3_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( equal_lines(X1,X2)
| distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X3,X4,X3,X4] :
( ( ~ incident_point_and_line(X3,X4)
| ~ apart_point_and_line(X3,X4) )
& ( apart_point_and_line(X3,X4)
| incident_point_and_line(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[a4])])])])]) ).
fof(c_0_13,plain,
! [X10,X11] : ~ apart_point_and_line(X10,orthogonal_through_point(X11,X10)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ooc2])]) ).
cnf(c_0_14,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_9]) ).
cnf(c_0_15,negated_conjecture,
distinct_lines(orthogonal_through_point(esk3_0,esk1_0),orthogonal_through_point(esk3_0,esk2_0)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ apart_point_and_line(X1,X2)
| ~ incident_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
incident_point_and_line(esk2_0,orthogonal_through_point(esk3_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_18,plain,
! [X10,X11] : ~ unorthogonal_lines(orthogonal_through_point(X11,X10),X11),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ooc1])]) ).
cnf(c_0_19,plain,
~ apart_point_and_line(X1,orthogonal_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( unorthogonal_lines(orthogonal_through_point(esk3_0,esk1_0),X1)
| unorthogonal_lines(orthogonal_through_point(esk3_0,esk2_0),X1)
| apart_point_and_line(X2,orthogonal_through_point(esk3_0,esk1_0))
| apart_point_and_line(X2,orthogonal_through_point(esk3_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
~ apart_point_and_line(esk2_0,orthogonal_through_point(esk3_0,esk1_0)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( unorthogonal_lines(orthogonal_through_point(esk3_0,esk2_0),X1)
| unorthogonal_lines(orthogonal_through_point(esk3_0,esk1_0),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GEO221+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.11/0.33 % Computer : n017.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jun 18 17:59:58 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.20/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.39 # Preprocessing time : 0.017 s
% 0.20/1.39
% 0.20/1.39 # Proof found!
% 0.20/1.39 # SZS status Theorem
% 0.20/1.39 # SZS output start CNFRefutation
% See solution above
% 0.20/1.39 # Proof object total steps : 25
% 0.20/1.39 # Proof object clause steps : 12
% 0.20/1.39 # Proof object formula steps : 13
% 0.20/1.39 # Proof object conjectures : 10
% 0.20/1.39 # Proof object clause conjectures : 7
% 0.20/1.39 # Proof object formula conjectures : 3
% 0.20/1.39 # Proof object initial clauses used : 7
% 0.20/1.39 # Proof object initial formulas used : 6
% 0.20/1.39 # Proof object generating inferences : 5
% 0.20/1.39 # Proof object simplifying inferences : 2
% 0.20/1.39 # Training examples: 0 positive, 0 negative
% 0.20/1.39 # Parsed axioms : 36
% 0.20/1.39 # Removed by relevancy pruning/SinE : 3
% 0.20/1.39 # Initial clauses : 42
% 0.20/1.39 # Removed in clause preprocessing : 0
% 0.20/1.39 # Initial clauses in saturation : 42
% 0.20/1.39 # Processed clauses : 57
% 0.20/1.39 # ...of these trivial : 0
% 0.20/1.39 # ...subsumed : 5
% 0.20/1.39 # ...remaining for further processing : 52
% 0.20/1.39 # Other redundant clauses eliminated : 0
% 0.20/1.39 # Clauses deleted for lack of memory : 0
% 0.20/1.39 # Backward-subsumed : 1
% 0.20/1.39 # Backward-rewritten : 0
% 0.20/1.39 # Generated clauses : 74
% 0.20/1.39 # ...of the previous two non-trivial : 62
% 0.20/1.39 # Contextual simplify-reflections : 4
% 0.20/1.39 # Paramodulations : 74
% 0.20/1.39 # Factorizations : 0
% 0.20/1.39 # Equation resolutions : 0
% 0.20/1.39 # Current number of processed clauses : 51
% 0.20/1.39 # Positive orientable unit clauses : 5
% 0.20/1.39 # Positive unorientable unit clauses: 0
% 0.20/1.39 # Negative unit clauses : 9
% 0.20/1.39 # Non-unit-clauses : 37
% 0.20/1.39 # Current number of unprocessed clauses: 37
% 0.20/1.39 # ...number of literals in the above : 134
% 0.20/1.39 # Current number of archived formulas : 0
% 0.20/1.39 # Current number of archived clauses : 1
% 0.20/1.39 # Clause-clause subsumption calls (NU) : 294
% 0.20/1.39 # Rec. Clause-clause subsumption calls : 98
% 0.20/1.39 # Non-unit clause-clause subsumptions : 10
% 0.20/1.39 # Unit Clause-clause subsumption calls : 6
% 0.20/1.39 # Rewrite failures with RHS unbound : 0
% 0.20/1.39 # BW rewrite match attempts : 0
% 0.20/1.39 # BW rewrite match successes : 0
% 0.20/1.39 # Condensation attempts : 0
% 0.20/1.39 # Condensation successes : 0
% 0.20/1.39 # Termbank termtop insertions : 3853
% 0.20/1.39
% 0.20/1.39 # -------------------------------------------------
% 0.20/1.39 # User time : 0.019 s
% 0.20/1.39 # System time : 0.001 s
% 0.20/1.39 # Total time : 0.020 s
% 0.20/1.39 # Maximum resident set size: 3048 pages
%------------------------------------------------------------------------------