TSTP Solution File: GEO212+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO212+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:45 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 10 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 67 ( 22 ~; 33 |; 8 &)
% ( 0 <=>; 4 =>; 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 : 39 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X6,X7,X8] :
( unorthogonal_lines(X6,X7)
=> ( convergent_lines(X6,X8)
| unorthogonal_lines(X7,X8) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).
fof(occu1,axiom,
! [X6,X7] :
( convergent_lines(X6,X7)
| unorthogonal_lines(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',occu1) ).
fof(apart6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,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(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/sandbox2/benchmark/Axioms/GEO006+3.ax',oac1) ).
fof(c_0_5,negated_conjecture,
~ ! [X6,X7,X8] :
( unorthogonal_lines(X6,X7)
=> ( convergent_lines(X6,X8)
| unorthogonal_lines(X7,X8) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_6,negated_conjecture,
( unorthogonal_lines(esk1_0,esk2_0)
& ~ convergent_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_5])])])]) ).
fof(c_0_7,plain,
! [X8,X9] :
( convergent_lines(X8,X9)
| unorthogonal_lines(X8,X9) ),
inference(variable_rename,[status(thm)],[occu1]) ).
fof(c_0_8,plain,
! [X4,X5,X6] :
( ~ convergent_lines(X4,X5)
| convergent_lines(X4,X6)
| convergent_lines(X5,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart6])])])]) ).
cnf(c_0_9,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( unorthogonal_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,plain,
! [X2] : ~ convergent_lines(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart3])]) ).
cnf(c_0_14,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_15,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_16,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk3_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_18,plain,
( convergent_lines(X1,X3)
| unorthogonal_lines(X2,X3)
| ~ unorthogonal_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
unorthogonal_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
~ convergent_lines(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
( convergent_lines(X1,esk3_0)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( unorthogonal_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1)
| ~ convergent_lines(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
~ convergent_lines(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_22]),c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO212+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 01:47:41 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 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 : 27
% 0.23/1.41 # Proof object clause steps : 16
% 0.23/1.41 # Proof object formula steps : 11
% 0.23/1.41 # Proof object conjectures : 15
% 0.23/1.41 # Proof object clause conjectures : 12
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 7
% 0.23/1.41 # Proof object initial formulas used : 5
% 0.23/1.41 # Proof object generating inferences : 9
% 0.23/1.41 # Proof object simplifying inferences : 2
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 21
% 0.23/1.41 # Removed by relevancy pruning/SinE : 6
% 0.23/1.41 # Initial clauses : 20
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 20
% 0.23/1.41 # Processed clauses : 38
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 6
% 0.23/1.41 # ...remaining for further processing : 32
% 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 : 0
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 71
% 0.23/1.41 # ...of the previous two non-trivial : 59
% 0.23/1.41 # Contextual simplify-reflections : 1
% 0.23/1.41 # Paramodulations : 69
% 0.23/1.41 # Factorizations : 2
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 32
% 0.23/1.41 # Positive orientable unit clauses : 4
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 6
% 0.23/1.41 # Non-unit-clauses : 22
% 0.23/1.41 # Current number of unprocessed clauses: 41
% 0.23/1.41 # ...number of literals in the above : 190
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 0
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 78
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 43
% 0.23/1.41 # Non-unit clause-clause subsumptions : 4
% 0.23/1.41 # Unit Clause-clause subsumption calls : 9
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 0
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 2119
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.015 s
% 0.23/1.41 # System time : 0.002 s
% 0.23/1.41 # Total time : 0.017 s
% 0.23/1.41 # Maximum resident set size: 2828 pages
%------------------------------------------------------------------------------