TSTP Solution File: GEO208+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO208+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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:42 EDT 2022
% Result : Theorem 0.24s 1.40s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 36 ( 14 ~; 8 |; 9 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 28 ( 4 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( incident_point_and_line(X1,X2)
& incident_point_and_line(X1,X3)
& parallel_lines(X2,X3) )
=> equal_lines(X2,X3) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/GEO006+6.ax',ax2) ).
fof(a3,axiom,
! [X1,X2] :
( parallel_lines(X1,X2)
<=> ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',a3) ).
fof(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( incident_point_and_line(X1,X2)
& incident_point_and_line(X1,X3)
& parallel_lines(X2,X3) )
=> equal_lines(X2,X3) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_5,negated_conjecture,
( incident_point_and_line(esk1_0,esk2_0)
& incident_point_and_line(esk1_0,esk3_0)
& parallel_lines(esk2_0,esk3_0)
& ~ equal_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] :
( ( ~ 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_7,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_8,plain,
! [X3,X4] :
( ~ distinct_lines(X3,X4)
| convergent_lines(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])]) ).
cnf(c_0_9,negated_conjecture,
~ equal_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( equal_lines(X1,X2)
| distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ convergent_lines(X1,X2)
| ~ parallel_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
parallel_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
distinct_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
~ convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO208+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n005.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 : Fri Jun 17 22:22:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.24/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.40 # Preprocessing time : 0.017 s
% 0.24/1.40
% 0.24/1.40 # Proof found!
% 0.24/1.40 # SZS status Theorem
% 0.24/1.40 # SZS output start CNFRefutation
% See solution above
% 0.24/1.40 # Proof object total steps : 17
% 0.24/1.40 # Proof object clause steps : 8
% 0.24/1.40 # Proof object formula steps : 9
% 0.24/1.40 # Proof object conjectures : 8
% 0.24/1.40 # Proof object clause conjectures : 5
% 0.24/1.40 # Proof object formula conjectures : 3
% 0.24/1.40 # Proof object initial clauses used : 5
% 0.24/1.40 # Proof object initial formulas used : 4
% 0.24/1.40 # Proof object generating inferences : 3
% 0.24/1.40 # Proof object simplifying inferences : 1
% 0.24/1.40 # Training examples: 0 positive, 0 negative
% 0.24/1.40 # Parsed axioms : 36
% 0.24/1.40 # Removed by relevancy pruning/SinE : 14
% 0.24/1.40 # Initial clauses : 34
% 0.24/1.40 # Removed in clause preprocessing : 0
% 0.24/1.40 # Initial clauses in saturation : 34
% 0.24/1.40 # Processed clauses : 37
% 0.24/1.40 # ...of these trivial : 0
% 0.24/1.40 # ...subsumed : 4
% 0.24/1.40 # ...remaining for further processing : 33
% 0.24/1.40 # Other redundant clauses eliminated : 0
% 0.24/1.40 # Clauses deleted for lack of memory : 0
% 0.24/1.40 # Backward-subsumed : 0
% 0.24/1.40 # Backward-rewritten : 0
% 0.24/1.40 # Generated clauses : 17
% 0.24/1.40 # ...of the previous two non-trivial : 4
% 0.24/1.40 # Contextual simplify-reflections : 4
% 0.24/1.40 # Paramodulations : 17
% 0.24/1.40 # Factorizations : 0
% 0.24/1.40 # Equation resolutions : 0
% 0.24/1.40 # Current number of processed clauses : 33
% 0.24/1.40 # Positive orientable unit clauses : 4
% 0.24/1.40 # Positive unorientable unit clauses: 0
% 0.24/1.40 # Negative unit clauses : 6
% 0.24/1.40 # Non-unit-clauses : 23
% 0.24/1.40 # Current number of unprocessed clauses: 1
% 0.24/1.40 # ...number of literals in the above : 1
% 0.24/1.40 # Current number of archived formulas : 0
% 0.24/1.40 # Current number of archived clauses : 0
% 0.24/1.40 # Clause-clause subsumption calls (NU) : 107
% 0.24/1.40 # Rec. Clause-clause subsumption calls : 68
% 0.24/1.40 # Non-unit clause-clause subsumptions : 8
% 0.24/1.40 # Unit Clause-clause subsumption calls : 4
% 0.24/1.40 # Rewrite failures with RHS unbound : 0
% 0.24/1.40 # BW rewrite match attempts : 0
% 0.24/1.40 # BW rewrite match successes : 0
% 0.24/1.40 # Condensation attempts : 0
% 0.24/1.40 # Condensation successes : 0
% 0.24/1.40 # Termbank termtop insertions : 2375
% 0.24/1.40
% 0.24/1.40 # -------------------------------------------------
% 0.24/1.40 # User time : 0.015 s
% 0.24/1.40 # System time : 0.003 s
% 0.24/1.40 # Total time : 0.018 s
% 0.24/1.40 # Maximum resident set size: 2748 pages
%------------------------------------------------------------------------------