TSTP Solution File: GEO206+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO206+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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:40 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 48 ( 21 ~; 19 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 40 ( 2 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( ~ apart_point_and_line(X1,X2)
& ~ convergent_lines(X2,X3) )
=> ~ distinct_lines(X2,parallel_through_point(X3,X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).
fof(cup1,axiom,
! [X1,X2,X3] :
( distinct_lines(X2,X3)
=> ( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cup1) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ax6) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp1) ).
fof(cp2,axiom,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp2) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ apart_point_and_line(X1,X2)
& ~ convergent_lines(X2,X3) )
=> ~ distinct_lines(X2,parallel_through_point(X3,X1)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_6,plain,
! [X4,X5,X6] :
( ~ distinct_lines(X5,X6)
| apart_point_and_line(X4,X5)
| apart_point_and_line(X4,X6)
| convergent_lines(X5,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cup1])]) ).
fof(c_0_7,negated_conjecture,
( ~ apart_point_and_line(esk1_0,esk2_0)
& ~ convergent_lines(esk2_0,esk3_0)
& distinct_lines(esk2_0,parallel_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_5])])])]) ).
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)],[ax6])])])]) ).
cnf(c_0_9,plain,
( convergent_lines(X1,X2)
| apart_point_and_line(X3,X2)
| apart_point_and_line(X3,X1)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
distinct_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X3,X4] : ~ convergent_lines(parallel_through_point(X4,X3),X4),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[cp1])]) ).
cnf(c_0_12,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0))
| apart_point_and_line(X1,esk2_0)
| convergent_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_14,plain,
! [X3,X4] : ~ apart_point_and_line(X3,parallel_through_point(X4,X3)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[cp2])]) ).
cnf(c_0_15,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0))
| apart_point_and_line(X1,esk2_0)
| convergent_lines(parallel_through_point(esk3_0,esk1_0),X2)
| convergent_lines(esk2_0,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ convergent_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0))
| apart_point_and_line(X1,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
~ apart_point_and_line(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO206+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 18 02:11:04 EDT 2022
% 0.13/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.008 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 : 22
% 0.23/1.42 # Proof object clause steps : 11
% 0.23/1.42 # Proof object formula steps : 11
% 0.23/1.42 # Proof object conjectures : 10
% 0.23/1.42 # Proof object clause conjectures : 7
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 7
% 0.23/1.42 # Proof object initial formulas used : 5
% 0.23/1.42 # Proof object generating inferences : 4
% 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 : 18
% 0.23/1.42 # Removed by relevancy pruning/SinE : 4
% 0.23/1.42 # Initial clauses : 16
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 16
% 0.23/1.42 # Processed clauses : 20
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 20
% 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 : 0
% 0.23/1.42 # Generated clauses : 20
% 0.23/1.42 # ...of the previous two non-trivial : 18
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 20
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 18
% 0.23/1.42 # Positive orientable unit clauses : 1
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 7
% 0.23/1.42 # Non-unit-clauses : 10
% 0.23/1.42 # Current number of unprocessed clauses: 6
% 0.23/1.42 # ...number of literals in the above : 24
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 2
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 14
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 2
% 0.23/1.42 # Non-unit clause-clause subsumptions : 2
% 0.23/1.42 # Unit Clause-clause subsumption calls : 4
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 0
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 1336
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.008 s
% 0.23/1.42 # System time : 0.001 s
% 0.23/1.42 # Total time : 0.009 s
% 0.23/1.42 # Maximum resident set size: 2820 pages
%------------------------------------------------------------------------------