TSTP Solution File: GEO205+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO205+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 9 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 90 ( 31 ~; 45 |; 7 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& ~ distinct_lines(X2,X3) )
=> ( convergent_lines(X1,X3)
& ~ distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq3) ).
fof(cu1,axiom,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& distinct_lines(X4,X5) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5)
| apart_point_and_line(X2,X4)
| apart_point_and_line(X2,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',cu1) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(ceq2,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq2) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci4) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& ~ distinct_lines(X2,X3) )
=> ( convergent_lines(X1,X3)
& ~ distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_8,plain,
! [X4,X5,X6] :
( ~ convergent_lines(X4,X5)
| distinct_lines(X5,X6)
| convergent_lines(X4,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])])]) ).
fof(c_0_9,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& ~ distinct_lines(esk2_0,esk3_0)
& ( ~ convergent_lines(esk1_0,esk3_0)
| distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_10,plain,
( convergent_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ convergent_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X6,X7,X8,X9] :
( ~ distinct_points(X6,X7)
| ~ distinct_lines(X8,X9)
| apart_point_and_line(X6,X8)
| apart_point_and_line(X6,X9)
| apart_point_and_line(X7,X8)
| apart_point_and_line(X7,X9) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_13,negated_conjecture,
~ distinct_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( convergent_lines(esk1_0,X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X4,X2)
| apart_point_and_line(X4,X3)
| ~ distinct_lines(X3,X2)
| ~ distinct_points(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))
| ~ convergent_lines(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ convergent_lines(X3,X4)
| ~ apart_point_and_line(intersection_point(X3,X4),X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ci3])])]) ).
cnf(c_0_19,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X2,esk2_0)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,X3)
| convergent_lines(esk1_0,X3)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
fof(c_0_21,plain,
! [X2] : ~ convergent_lines(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart3])]) ).
fof(c_0_22,plain,
! [X4,X5,X6] :
( ~ apart_point_and_line(X4,X5)
| distinct_lines(X5,X6)
| apart_point_and_line(X4,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])])])]) ).
cnf(c_0_23,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),esk2_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_26,plain,
! [X3,X4] :
( ~ convergent_lines(X3,X4)
| ~ apart_point_and_line(intersection_point(X3,X4),X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ci4])])]) ).
cnf(c_0_27,plain,
( apart_point_and_line(X1,X2)
| distinct_lines(X3,X2)
| ~ apart_point_and_line(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_17])]),c_0_25]) ).
cnf(c_0_29,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_17])]),c_0_13]) ).
cnf(c_0_32,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_31]),c_0_11])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_32]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : GEO205+1 : TPTP v8.1.0. Released v3.3.0.
% 0.14/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 16:14:38 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.015 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 34
% 0.25/1.44 # Proof object clause steps : 19
% 0.25/1.44 # Proof object formula steps : 15
% 0.25/1.44 # Proof object conjectures : 16
% 0.25/1.44 # Proof object clause conjectures : 13
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 9
% 0.25/1.44 # Proof object initial formulas used : 7
% 0.25/1.44 # Proof object generating inferences : 9
% 0.25/1.44 # Proof object simplifying inferences : 12
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 15
% 0.25/1.44 # Removed by relevancy pruning/SinE : 2
% 0.25/1.44 # Initial clauses : 15
% 0.25/1.44 # Removed in clause preprocessing : 0
% 0.25/1.44 # Initial clauses in saturation : 15
% 0.25/1.44 # Processed clauses : 82
% 0.25/1.44 # ...of these trivial : 0
% 0.25/1.44 # ...subsumed : 28
% 0.25/1.44 # ...remaining for further processing : 54
% 0.25/1.44 # Other redundant clauses eliminated : 0
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 3
% 0.25/1.44 # Backward-rewritten : 4
% 0.25/1.44 # Generated clauses : 202
% 0.25/1.44 # ...of the previous two non-trivial : 164
% 0.25/1.44 # Contextual simplify-reflections : 2
% 0.25/1.44 # Paramodulations : 172
% 0.25/1.44 # Factorizations : 30
% 0.25/1.44 # Equation resolutions : 0
% 0.25/1.44 # Current number of processed clauses : 47
% 0.25/1.44 # Positive orientable unit clauses : 6
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 4
% 0.25/1.44 # Non-unit-clauses : 37
% 0.25/1.44 # Current number of unprocessed clauses: 80
% 0.25/1.44 # ...number of literals in the above : 376
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 7
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 421
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 197
% 0.25/1.44 # Non-unit clause-clause subsumptions : 33
% 0.25/1.44 # Unit Clause-clause subsumption calls : 8
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 2
% 0.25/1.44 # BW rewrite match successes : 2
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 3185
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.019 s
% 0.25/1.44 # System time : 0.002 s
% 0.25/1.44 # Total time : 0.021 s
% 0.25/1.44 # Maximum resident set size: 2820 pages
%------------------------------------------------------------------------------