TSTP Solution File: GEO217+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO217+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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:49 EDT 2022
% Result : Theorem 0.17s 1.35s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 15 ~; 14 |; 5 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 33 ( 2 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X6,X7,X8] :
( ( parallel_lines(X6,X7)
& parallel_lines(X6,X8) )
=> parallel_lines(X7,X8) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).
fof(a3,axiom,
! [X1,X2] :
( parallel_lines(X1,X2)
<=> ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',a3) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ax6) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(c_0_4,negated_conjecture,
~ ! [X6,X7,X8] :
( ( parallel_lines(X6,X7)
& parallel_lines(X6,X8) )
=> parallel_lines(X7,X8) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_5,negated_conjecture,
( parallel_lines(esk1_0,esk2_0)
& parallel_lines(esk1_0,esk3_0)
& ~ parallel_lines(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X3,X4,X3,X4] :
( ( ~ parallel_lines(X3,X4)
| ~ convergent_lines(X3,X4) )
& ( convergent_lines(X3,X4)
| parallel_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)],[a3])])])])]) ).
fof(c_0_7,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)],[ax6])])])]) ).
cnf(c_0_8,negated_conjecture,
~ parallel_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( parallel_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
fof(c_0_12,plain,
! [X2] : ~ convergent_lines(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart3])]) ).
cnf(c_0_13,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ convergent_lines(X1,X2)
| ~ parallel_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
parallel_lines(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
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_10,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
~ convergent_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,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_20,negated_conjecture,
parallel_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ convergent_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_10,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_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GEO217+3 : TPTP v8.1.0. Released v4.0.0.
% 0.05/0.09 % Command : run_ET %s %d
% 0.08/0.29 % Computer : n026.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 600
% 0.08/0.29 % DateTime : Sat Jun 18 08:53:39 EDT 2022
% 0.08/0.29 % CPUTime :
% 0.17/1.35 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.17/1.35 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.17/1.35 # Preprocessing time : 0.013 s
% 0.17/1.35
% 0.17/1.35 # Proof found!
% 0.17/1.35 # SZS status Theorem
% 0.17/1.35 # SZS output start CNFRefutation
% See solution above
% 0.17/1.35 # Proof object total steps : 25
% 0.17/1.35 # Proof object clause steps : 16
% 0.17/1.35 # Proof object formula steps : 9
% 0.17/1.35 # Proof object conjectures : 15
% 0.17/1.35 # Proof object clause conjectures : 12
% 0.17/1.35 # Proof object formula conjectures : 3
% 0.17/1.35 # Proof object initial clauses used : 7
% 0.17/1.35 # Proof object initial formulas used : 4
% 0.17/1.35 # Proof object generating inferences : 9
% 0.17/1.35 # Proof object simplifying inferences : 1
% 0.17/1.35 # Training examples: 0 positive, 0 negative
% 0.17/1.35 # Parsed axioms : 36
% 0.17/1.35 # Removed by relevancy pruning/SinE : 32
% 0.17/1.35 # Initial clauses : 7
% 0.17/1.35 # Removed in clause preprocessing : 0
% 0.17/1.35 # Initial clauses in saturation : 7
% 0.17/1.35 # Processed clauses : 19
% 0.17/1.35 # ...of these trivial : 0
% 0.17/1.35 # ...subsumed : 2
% 0.17/1.35 # ...remaining for further processing : 17
% 0.17/1.35 # Other redundant clauses eliminated : 0
% 0.17/1.35 # Clauses deleted for lack of memory : 0
% 0.17/1.35 # Backward-subsumed : 0
% 0.17/1.35 # Backward-rewritten : 0
% 0.17/1.35 # Generated clauses : 40
% 0.17/1.35 # ...of the previous two non-trivial : 30
% 0.17/1.35 # Contextual simplify-reflections : 0
% 0.17/1.35 # Paramodulations : 30
% 0.17/1.35 # Factorizations : 10
% 0.17/1.35 # Equation resolutions : 0
% 0.17/1.35 # Current number of processed clauses : 17
% 0.17/1.35 # Positive orientable unit clauses : 4
% 0.17/1.35 # Positive unorientable unit clauses: 0
% 0.17/1.35 # Negative unit clauses : 4
% 0.17/1.35 # Non-unit-clauses : 9
% 0.17/1.35 # Current number of unprocessed clauses: 18
% 0.17/1.35 # ...number of literals in the above : 62
% 0.17/1.35 # Current number of archived formulas : 0
% 0.17/1.35 # Current number of archived clauses : 0
% 0.17/1.35 # Clause-clause subsumption calls (NU) : 30
% 0.17/1.35 # Rec. Clause-clause subsumption calls : 24
% 0.17/1.35 # Non-unit clause-clause subsumptions : 2
% 0.17/1.35 # Unit Clause-clause subsumption calls : 2
% 0.17/1.35 # Rewrite failures with RHS unbound : 0
% 0.17/1.35 # BW rewrite match attempts : 0
% 0.17/1.35 # BW rewrite match successes : 0
% 0.17/1.35 # Condensation attempts : 0
% 0.17/1.35 # Condensation successes : 0
% 0.17/1.35 # Termbank termtop insertions : 961
% 0.17/1.35
% 0.17/1.35 # -------------------------------------------------
% 0.17/1.35 # User time : 0.012 s
% 0.17/1.35 # System time : 0.002 s
% 0.17/1.35 # Total time : 0.014 s
% 0.17/1.35 # Maximum resident set size: 2708 pages
%------------------------------------------------------------------------------