TSTP Solution File: GEO111+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO111+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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:03:40 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 9 unt; 0 def)
% Number of atoms : 163 ( 28 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 195 ( 74 ~; 77 |; 36 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 117 ( 24 sgn 45 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(part_of_defn,axiom,
! [X1,X2] :
( part_of(X2,X1)
<=> ! [X3] :
( incident_c(X3,X2)
=> incident_c(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',part_of_defn) ).
fof(between_c_defn,axiom,
! [X1,X3,X5,X7] :
( between_c(X1,X3,X5,X7)
<=> ( X3 != X7
& ? [X8] :
( part_of(X8,X1)
& end_point(X3,X8)
& end_point(X7,X8)
& inner_point(X5,X8) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+1.ax',between_c_defn) ).
fof(end_point_defn,axiom,
! [X3,X1] :
( end_point(X3,X1)
<=> ( incident_c(X3,X1)
& ! [X2,X4] :
( ( part_of(X2,X1)
& part_of(X4,X1)
& incident_c(X3,X2)
& incident_c(X3,X4) )
=> ( part_of(X2,X4)
| part_of(X4,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',end_point_defn) ).
fof(theorem_3_8_1,conjecture,
! [X1,X3,X5,X7] :
( between_c(X1,X3,X5,X7)
=> ( incident_c(X3,X1)
& incident_c(X5,X1)
& incident_c(X7,X1)
& X3 != X5
& X5 != X7
& X3 != X7 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',theorem_3_8_1) ).
fof(inner_point_defn,axiom,
! [X3,X1] :
( inner_point(X3,X1)
<=> ( incident_c(X3,X1)
& ~ end_point(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',inner_point_defn) ).
fof(c_0_5,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ part_of(X5,X4)
| ~ incident_c(X6,X5)
| incident_c(X6,X4) )
& ( incident_c(esk5_2(X4,X5),X5)
| part_of(X5,X4) )
& ( ~ incident_c(esk5_2(X4,X5),X4)
| part_of(X5,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[part_of_defn])])])])])])]) ).
fof(c_0_6,plain,
! [X9,X10,X11,X12,X9,X10,X11,X12,X14] :
( ( X10 != X12
| ~ between_c(X9,X10,X11,X12) )
& ( part_of(esk9_4(X9,X10,X11,X12),X9)
| ~ between_c(X9,X10,X11,X12) )
& ( end_point(X10,esk9_4(X9,X10,X11,X12))
| ~ between_c(X9,X10,X11,X12) )
& ( end_point(X12,esk9_4(X9,X10,X11,X12))
| ~ between_c(X9,X10,X11,X12) )
& ( inner_point(X11,esk9_4(X9,X10,X11,X12))
| ~ between_c(X9,X10,X11,X12) )
& ( X10 = X12
| ~ part_of(X14,X9)
| ~ end_point(X10,X14)
| ~ end_point(X12,X14)
| ~ inner_point(X11,X14)
| between_c(X9,X10,X11,X12) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[between_c_defn])])])])])])]) ).
fof(c_0_7,plain,
! [X5,X6,X7,X8,X5,X6] :
( ( incident_c(X5,X6)
| ~ end_point(X5,X6) )
& ( ~ part_of(X7,X6)
| ~ part_of(X8,X6)
| ~ incident_c(X5,X7)
| ~ incident_c(X5,X8)
| part_of(X7,X8)
| part_of(X8,X7)
| ~ end_point(X5,X6) )
& ( part_of(esk6_2(X5,X6),X6)
| ~ incident_c(X5,X6)
| end_point(X5,X6) )
& ( part_of(esk7_2(X5,X6),X6)
| ~ incident_c(X5,X6)
| end_point(X5,X6) )
& ( incident_c(X5,esk6_2(X5,X6))
| ~ incident_c(X5,X6)
| end_point(X5,X6) )
& ( incident_c(X5,esk7_2(X5,X6))
| ~ incident_c(X5,X6)
| end_point(X5,X6) )
& ( ~ part_of(esk6_2(X5,X6),esk7_2(X5,X6))
| ~ incident_c(X5,X6)
| end_point(X5,X6) )
& ( ~ part_of(esk7_2(X5,X6),esk6_2(X5,X6))
| ~ incident_c(X5,X6)
| end_point(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[end_point_defn])])])])])])]) ).
cnf(c_0_8,plain,
( incident_c(X1,X2)
| ~ incident_c(X1,X3)
| ~ part_of(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( part_of(esk9_4(X1,X2,X3,X4),X1)
| ~ between_c(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( incident_c(X1,X2)
| ~ end_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( end_point(X4,esk9_4(X1,X2,X3,X4))
| ~ between_c(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X3,X5,X7] :
( between_c(X1,X3,X5,X7)
=> ( incident_c(X3,X1)
& incident_c(X5,X1)
& incident_c(X7,X1)
& X3 != X5
& X5 != X7
& X3 != X7 ) ),
inference(assume_negation,[status(cth)],[theorem_3_8_1]) ).
cnf(c_0_13,plain,
( incident_c(X1,X2)
| ~ between_c(X2,X3,X4,X5)
| ~ incident_c(X1,esk9_4(X2,X3,X4,X5)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
( incident_c(X1,esk9_4(X2,X3,X4,X1))
| ~ between_c(X2,X3,X4,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_15,negated_conjecture,
( between_c(esk1_0,esk2_0,esk3_0,esk4_0)
& ( ~ incident_c(esk2_0,esk1_0)
| ~ incident_c(esk3_0,esk1_0)
| ~ incident_c(esk4_0,esk1_0)
| esk2_0 = esk3_0
| esk3_0 = esk4_0
| esk2_0 = esk4_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_16,plain,
( end_point(X2,esk9_4(X1,X2,X3,X4))
| ~ between_c(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_17,plain,
! [X4,X5,X4,X5] :
( ( incident_c(X4,X5)
| ~ inner_point(X4,X5) )
& ( ~ end_point(X4,X5)
| ~ inner_point(X4,X5) )
& ( ~ incident_c(X4,X5)
| end_point(X4,X5)
| inner_point(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)],[inference(fof_simplification,[status(thm)],[inner_point_defn])])])])])]) ).
cnf(c_0_18,plain,
( incident_c(X1,X2)
| ~ between_c(X2,X3,X4,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
between_c(esk1_0,esk2_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( incident_c(X1,esk9_4(X2,X1,X3,X4))
| ~ between_c(X2,X1,X3,X4) ),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_21,plain,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( inner_point(X3,esk9_4(X1,X2,X3,X4))
| ~ between_c(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
( esk2_0 = esk4_0
| esk3_0 = esk4_0
| esk2_0 = esk3_0
| ~ incident_c(esk4_0,esk1_0)
| ~ incident_c(esk3_0,esk1_0)
| ~ incident_c(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
incident_c(esk4_0,esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( incident_c(X1,X2)
| ~ between_c(X2,X1,X3,X4) ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_26,plain,
( incident_c(X1,esk9_4(X2,X3,X1,X4))
| ~ between_c(X2,X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( esk3_0 = esk2_0
| esk4_0 = esk2_0
| esk4_0 = esk3_0
| ~ incident_c(esk2_0,esk1_0)
| ~ incident_c(esk3_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
incident_c(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_29,plain,
( incident_c(X1,X2)
| ~ between_c(X2,X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_30,plain,
( ~ inner_point(X1,X2)
| ~ end_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,negated_conjecture,
( esk4_0 = esk3_0
| esk4_0 = esk2_0
| esk3_0 = esk2_0
| ~ incident_c(esk3_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_32,negated_conjecture,
incident_c(esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_33,plain,
( ~ between_c(X1,X2,X3,X4)
| ~ end_point(X3,esk9_4(X1,X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_34,negated_conjecture,
( esk3_0 = esk2_0
| esk4_0 = esk2_0
| esk4_0 = esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_35,plain,
~ between_c(X1,X2,X3,X3),
inference(spm,[status(thm)],[c_0_33,c_0_11]) ).
cnf(c_0_36,plain,
( ~ between_c(X1,X2,X3,X4)
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_37,negated_conjecture,
( esk4_0 = esk2_0
| esk3_0 = esk2_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_34]),c_0_35]) ).
cnf(c_0_38,plain,
~ between_c(X1,X2,X3,X2),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_39,negated_conjecture,
esk3_0 = esk2_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_37]),c_0_38]) ).
cnf(c_0_40,plain,
~ between_c(X1,X2,X2,X3),
inference(spm,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO111+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n008.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 : Sat Jun 18 18:14:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.019 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 42
% 0.22/1.41 # Proof object clause steps : 31
% 0.22/1.41 # Proof object formula steps : 11
% 0.22/1.41 # Proof object conjectures : 14
% 0.22/1.41 # Proof object clause conjectures : 11
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 11
% 0.22/1.41 # Proof object initial formulas used : 5
% 0.22/1.41 # Proof object generating inferences : 15
% 0.22/1.41 # Proof object simplifying inferences : 11
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 18
% 0.22/1.41 # Removed by relevancy pruning/SinE : 4
% 0.22/1.41 # Initial clauses : 45
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 45
% 0.22/1.41 # Processed clauses : 97
% 0.22/1.41 # ...of these trivial : 1
% 0.22/1.41 # ...subsumed : 4
% 0.22/1.41 # ...remaining for further processing : 92
% 0.22/1.41 # Other redundant clauses eliminated : 4
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 1
% 0.22/1.41 # Backward-rewritten : 6
% 0.22/1.41 # Generated clauses : 234
% 0.22/1.41 # ...of the previous two non-trivial : 217
% 0.22/1.41 # Contextual simplify-reflections : 0
% 0.22/1.41 # Paramodulations : 216
% 0.22/1.41 # Factorizations : 11
% 0.22/1.41 # Equation resolutions : 7
% 0.22/1.41 # Current number of processed clauses : 84
% 0.22/1.41 # Positive orientable unit clauses : 7
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 4
% 0.22/1.41 # Non-unit-clauses : 73
% 0.22/1.41 # Current number of unprocessed clauses: 165
% 0.22/1.41 # ...number of literals in the above : 730
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 7
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 1822
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 747
% 0.22/1.41 # Non-unit clause-clause subsumptions : 5
% 0.22/1.41 # Unit Clause-clause subsumption calls : 218
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 23
% 0.22/1.41 # BW rewrite match successes : 4
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 6533
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.026 s
% 0.22/1.41 # System time : 0.003 s
% 0.22/1.41 # Total time : 0.029 s
% 0.22/1.41 # Maximum resident set size: 3312 pages
%------------------------------------------------------------------------------