TSTP Solution File: GEO201+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO201+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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:37 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 12 unt; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 98 ( 34 ~; 53 |; 3 &)
% ( 0 <=>; 8 =>; 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ distinct_points(intersection_point(X1,X2),intersection_point(X2,X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).
fof(apart6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart6) ).
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/GEO008+0.ax',cu1) ).
fof(ceq3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> distinct_lines(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',ceq3) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart3) ).
fof(apart4,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( distinct_points(X1,X3)
| distinct_points(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart4) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart1) ).
fof(con2,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( ( apart_point_and_line(X3,X1)
| apart_point_and_line(X3,X2) )
=> distinct_points(X3,intersection_point(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',con2) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ distinct_points(intersection_point(X1,X2),intersection_point(X2,X1)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_9,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])])])]) ).
fof(c_0_10,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8])])])]) ).
fof(c_0_11,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])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ convergent_lines(X3,X4)
| distinct_lines(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])]) ).
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,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X4,X5,X6] :
( ~ distinct_points(X4,X5)
| distinct_points(X4,X6)
| distinct_points(X5,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])])])]) ).
cnf(c_0_17,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_11]) ).
cnf(c_0_18,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_21,plain,
! [X2] : ~ distinct_points(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart1])]) ).
cnf(c_0_22,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_24,plain,
! [X4,X5,X6] :
( ( ~ apart_point_and_line(X6,X4)
| distinct_points(X6,intersection_point(X4,X5))
| ~ convergent_lines(X4,X5) )
& ( ~ apart_point_and_line(X6,X5)
| distinct_points(X6,intersection_point(X4,X5))
| ~ convergent_lines(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con2])])])])]) ).
cnf(c_0_25,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)
| ~ convergent_lines(X2,X3)
| ~ distinct_points(X1,X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk2_0),X1)
| distinct_points(intersection_point(esk2_0,esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( distinct_points(X3,intersection_point(X1,X2))
| ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X2,esk1_0)
| apart_point_and_line(X2,esk2_0)
| ~ distinct_points(X2,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
distinct_points(intersection_point(esk2_0,esk1_0),intersection_point(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( distinct_points(X3,intersection_point(X1,X2))
| ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_15])]) ).
cnf(c_0_37,negated_conjecture,
( apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_15])]) ).
cnf(c_0_38,negated_conjecture,
apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_37]),c_0_26])]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_38]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO201+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 17:06:32 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 : 40
% 0.23/1.41 # Proof object clause steps : 23
% 0.23/1.41 # Proof object formula steps : 17
% 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 : 10
% 0.23/1.41 # Proof object initial formulas used : 8
% 0.23/1.41 # Proof object generating inferences : 13
% 0.23/1.41 # Proof object simplifying inferences : 8
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 13
% 0.23/1.41 # Removed by relevancy pruning/SinE : 1
% 0.23/1.41 # Initial clauses : 14
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 14
% 0.23/1.41 # Processed clauses : 177
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 101
% 0.23/1.41 # ...remaining for further processing : 76
% 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 : 2
% 0.23/1.41 # Backward-rewritten : 1
% 0.23/1.41 # Generated clauses : 564
% 0.23/1.41 # ...of the previous two non-trivial : 484
% 0.23/1.41 # Contextual simplify-reflections : 42
% 0.23/1.41 # Paramodulations : 430
% 0.23/1.41 # Factorizations : 134
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 73
% 0.23/1.41 # Positive orientable unit clauses : 7
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 3
% 0.23/1.41 # Non-unit-clauses : 63
% 0.23/1.41 # Current number of unprocessed clauses: 309
% 0.23/1.41 # ...number of literals in the above : 1693
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 3
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 2392
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 1055
% 0.23/1.41 # Non-unit clause-clause subsumptions : 144
% 0.23/1.41 # Unit Clause-clause subsumption calls : 58
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 6809
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.028 s
% 0.23/1.41 # System time : 0.002 s
% 0.23/1.41 # Total time : 0.030 s
% 0.23/1.41 # Maximum resident set size: 3076 pages
%------------------------------------------------------------------------------