TSTP Solution File: GEO210+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO210+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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:43 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 10 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 41 ( 19 ~; 15 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 2 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X9,X6,X7] :
( ( ~ apart_point_and_line(X9,X6)
& ~ unorthogonal_lines(X6,X7) )
=> ~ distinct_lines(X6,orthogonal_through_point(X7,X9)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).
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(ooc1,axiom,
! [X9,X6] : ~ unorthogonal_lines(orthogonal_through_point(X6,X9),X6),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',ooc1) ).
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(c_0_4,negated_conjecture,
~ ! [X9,X6,X7] :
( ( ~ apart_point_and_line(X9,X6)
& ~ unorthogonal_lines(X6,X7) )
=> ~ distinct_lines(X6,orthogonal_through_point(X7,X9)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_5,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])])])]) ).
fof(c_0_6,negated_conjecture,
( ~ apart_point_and_line(esk1_0,esk2_0)
& ~ unorthogonal_lines(esk2_0,esk3_0)
& distinct_lines(esk2_0,orthogonal_through_point(esk3_0,esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,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_8,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_5]) ).
cnf(c_0_9,negated_conjecture,
distinct_lines(esk2_0,orthogonal_through_point(esk3_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,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_11,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( unorthogonal_lines(orthogonal_through_point(esk3_0,esk1_0),X1)
| unorthogonal_lines(esk2_0,X1)
| apart_point_and_line(X2,orthogonal_through_point(esk3_0,esk1_0))
| apart_point_and_line(X2,esk2_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
~ apart_point_and_line(X1,orthogonal_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( apart_point_and_line(X1,orthogonal_through_point(esk3_0,esk1_0))
| apart_point_and_line(X1,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_16,negated_conjecture,
~ apart_point_and_line(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO210+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n008.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 05:55:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.015 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 18
% 0.23/1.42 # Proof object clause steps : 9
% 0.23/1.42 # Proof object formula steps : 9
% 0.23/1.42 # Proof object conjectures : 9
% 0.23/1.42 # Proof object clause conjectures : 6
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 6
% 0.23/1.42 # Proof object initial formulas used : 4
% 0.23/1.42 # Proof object generating inferences : 3
% 0.23/1.42 # Proof object simplifying inferences : 2
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 23
% 0.23/1.42 # Removed by relevancy pruning/SinE : 6
% 0.23/1.42 # Initial clauses : 22
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 22
% 0.23/1.42 # Processed clauses : 37
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 2
% 0.23/1.42 # ...remaining for further processing : 35
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 2
% 0.23/1.42 # Backward-rewritten : 1
% 0.23/1.42 # Generated clauses : 58
% 0.23/1.42 # ...of the previous two non-trivial : 50
% 0.23/1.42 # Contextual simplify-reflections : 1
% 0.23/1.42 # Paramodulations : 58
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 32
% 0.23/1.42 # Positive orientable unit clauses : 5
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 7
% 0.23/1.42 # Non-unit-clauses : 20
% 0.23/1.42 # Current number of unprocessed clauses: 28
% 0.23/1.42 # ...number of literals in the above : 112
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 3
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 41
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 20
% 0.23/1.42 # Non-unit clause-clause subsumptions : 5
% 0.23/1.42 # Unit Clause-clause subsumption calls : 5
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 1
% 0.23/1.42 # BW rewrite match successes : 1
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 2191
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.016 s
% 0.23/1.42 # System time : 0.002 s
% 0.23/1.42 # Total time : 0.018 s
% 0.23/1.42 # Maximum resident set size: 2832 pages
%------------------------------------------------------------------------------