TSTP Solution File: GEO127+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO127+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:47 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 19 unt; 0 def)
% Number of atoms : 150 ( 9 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 162 ( 60 ~; 64 |; 28 &)
% ( 7 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 88 ( 16 sgn 49 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(theorem_4_12,conjecture,
! [X9,X3] :
( incident_o(X3,X9)
<=> ? [X5] :
( ordered_by(X9,X3,X5)
| ordered_by(X9,X5,X3) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',theorem_4_12) ).
fof(o1,axiom,
! [X9,X3,X5] :
( ordered_by(X9,X3,X5)
=> ( incident_o(X3,X9)
& incident_o(X5,X9) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+2.ax',o1) ).
fof(start_point_defn,axiom,
! [X3,X9] :
( start_point(X3,X9)
<=> ( incident_o(X3,X9)
& ! [X5] :
( ( X3 != X5
& incident_o(X5,X9) )
=> ordered_by(X9,X3,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+2.ax',start_point_defn) ).
fof(o4,axiom,
! [X9] :
? [X3] : start_point(X3,X9),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+2.ax',o4) ).
fof(inner_point_defn,axiom,
! [X3,X1] :
( inner_point(X3,X1)
<=> ( incident_c(X3,X1)
& ~ end_point(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',inner_point_defn) ).
fof(c3,axiom,
! [X1] :
? [X3] : inner_point(X3,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',c3) ).
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/sandbox2/benchmark/Axioms/GEO004+0.ax',end_point_defn) ).
fof(open_defn,axiom,
! [X1] :
( open(X1)
<=> ? [X3] : end_point(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',open_defn) ).
fof(o2,axiom,
! [X9] :
? [X1] :
( open(X1)
& ! [X3] :
( incident_o(X3,X9)
<=> incident_c(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+2.ax',o2) ).
fof(c_0_9,negated_conjecture,
~ ! [X9,X3] :
( incident_o(X3,X9)
<=> ? [X5] :
( ordered_by(X9,X3,X5)
| ordered_by(X9,X5,X3) ) ),
inference(assume_negation,[status(cth)],[theorem_4_12]) ).
fof(c_0_10,plain,
! [X10,X11,X12] :
( ( incident_o(X11,X10)
| ~ ordered_by(X10,X11,X12) )
& ( incident_o(X12,X10)
| ~ ordered_by(X10,X11,X12) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[o1])])]) ).
fof(c_0_11,negated_conjecture,
! [X12,X12] :
( ( ~ ordered_by(esk25_0,esk26_0,X12)
| ~ incident_o(esk26_0,esk25_0) )
& ( ~ ordered_by(esk25_0,X12,esk26_0)
| ~ incident_o(esk26_0,esk25_0) )
& ( incident_o(esk26_0,esk25_0)
| ordered_by(esk25_0,esk26_0,esk27_0)
| ordered_by(esk25_0,esk28_0,esk26_0) ) ),
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)],[c_0_9])])])])])])]) ).
cnf(c_0_12,plain,
( incident_o(X3,X1)
| ~ ordered_by(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ordered_by(esk25_0,esk28_0,esk26_0)
| ordered_by(esk25_0,esk26_0,esk27_0)
| incident_o(esk26_0,esk25_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( incident_o(X2,X1)
| ~ ordered_by(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X10,X11,X12,X10,X11] :
( ( incident_o(X10,X11)
| ~ start_point(X10,X11) )
& ( X10 = X12
| ~ incident_o(X12,X11)
| ordered_by(X11,X10,X12)
| ~ start_point(X10,X11) )
& ( X10 != esk15_2(X10,X11)
| ~ incident_o(X10,X11)
| start_point(X10,X11) )
& ( incident_o(esk15_2(X10,X11),X11)
| ~ incident_o(X10,X11)
| start_point(X10,X11) )
& ( ~ ordered_by(X11,X10,esk15_2(X10,X11))
| ~ incident_o(X10,X11)
| start_point(X10,X11) ) ),
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)],[start_point_defn])])])])])])]) ).
fof(c_0_16,plain,
! [X10] : start_point(esk20_1(X10),X10),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[o4])]) ).
cnf(c_0_17,negated_conjecture,
( ~ incident_o(esk26_0,esk25_0)
| ~ ordered_by(esk25_0,X1,esk26_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
incident_o(esk26_0,esk25_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_19,plain,
( ordered_by(X2,X1,X3)
| X1 = X3
| ~ start_point(X1,X2)
| ~ incident_o(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
start_point(esk20_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,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])])])])])]) ).
fof(c_0_22,plain,
! [X4] : inner_point(esk8_1(X4),X4),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c3])]) ).
fof(c_0_23,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(esk3_2(X5,X6),X6)
| ~ incident_c(X5,X6)
| end_point(X5,X6) )
& ( part_of(esk4_2(X5,X6),X6)
| ~ incident_c(X5,X6)
| end_point(X5,X6) )
& ( incident_c(X5,esk3_2(X5,X6))
| ~ incident_c(X5,X6)
| end_point(X5,X6) )
& ( incident_c(X5,esk4_2(X5,X6))
| ~ incident_c(X5,X6)
| end_point(X5,X6) )
& ( ~ part_of(esk3_2(X5,X6),esk4_2(X5,X6))
| ~ incident_c(X5,X6)
| end_point(X5,X6) )
& ( ~ part_of(esk4_2(X5,X6),esk3_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])])])])])])]) ).
fof(c_0_24,plain,
! [X4,X4,X6] :
( ( ~ open(X4)
| end_point(esk7_1(X4),X4) )
& ( ~ end_point(X6,X4)
| open(X4) ) ),
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)],[open_defn])])])])])]) ).
cnf(c_0_25,negated_conjecture,
~ ordered_by(esk25_0,X1,esk26_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_26,plain,
( esk20_1(X1) = X2
| ordered_by(X1,esk20_1(X1),X2)
| ~ incident_o(X2,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
( ~ incident_o(esk26_0,esk25_0)
| ~ ordered_by(esk25_0,esk26_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_28,plain,
! [X10,X12,X12] :
( open(esk17_1(X10))
& ( ~ incident_o(X12,X10)
| incident_c(X12,esk17_1(X10)) )
& ( ~ incident_c(X12,esk17_1(X10))
| incident_o(X12,X10) ) ),
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)],[o2])])])])])]) ).
cnf(c_0_29,plain,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
inner_point(esk8_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( incident_c(X1,X2)
| ~ end_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( end_point(esk7_1(X1),X1)
| ~ open(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,negated_conjecture,
esk20_1(esk25_0) = esk26_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_18])]) ).
cnf(c_0_34,negated_conjecture,
~ ordered_by(esk25_0,esk26_0,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_18])]) ).
cnf(c_0_35,plain,
( incident_o(X1,X2)
| ~ incident_c(X1,esk17_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
incident_c(esk8_1(X1),X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
( incident_c(esk7_1(X1),X1)
| ~ open(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
open(esk17_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,plain,
( ~ inner_point(X1,X2)
| ~ end_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_40,negated_conjecture,
( esk26_0 = X1
| ~ incident_o(X1,esk25_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_33]),c_0_34]) ).
cnf(c_0_41,plain,
incident_o(esk8_1(esk17_1(X1)),X1),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
incident_o(esk7_1(esk17_1(X1)),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_37]),c_0_38])]) ).
cnf(c_0_43,plain,
~ end_point(esk8_1(X1),X1),
inference(spm,[status(thm)],[c_0_39,c_0_30]) ).
cnf(c_0_44,negated_conjecture,
esk8_1(esk17_1(esk25_0)) = esk26_0,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
esk7_1(esk17_1(esk25_0)) = esk26_0,
inference(spm,[status(thm)],[c_0_40,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
~ end_point(esk26_0,esk17_1(esk25_0)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_45]),c_0_38])]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO127+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n019.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 16:57:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.015 s
% 0.25/1.42
% 0.25/1.42 # Failure: Out of unprocessed clauses!
% 0.25/1.42 # OLD status GaveUp
% 0.25/1.42 # Parsed axioms : 28
% 0.25/1.42 # Removed by relevancy pruning/SinE : 25
% 0.25/1.42 # Initial clauses : 7
% 0.25/1.42 # Removed in clause preprocessing : 0
% 0.25/1.42 # Initial clauses in saturation : 7
% 0.25/1.42 # Processed clauses : 18
% 0.25/1.42 # ...of these trivial : 0
% 0.25/1.42 # ...subsumed : 2
% 0.25/1.42 # ...remaining for further processing : 16
% 0.25/1.42 # Other redundant clauses eliminated : 0
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 0
% 0.25/1.42 # Backward-rewritten : 1
% 0.25/1.42 # Generated clauses : 15
% 0.25/1.42 # ...of the previous two non-trivial : 11
% 0.25/1.42 # Contextual simplify-reflections : 3
% 0.25/1.42 # Paramodulations : 10
% 0.25/1.42 # Factorizations : 4
% 0.25/1.42 # Equation resolutions : 0
% 0.25/1.42 # Current number of processed clauses : 14
% 0.25/1.42 # Positive orientable unit clauses : 1
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 2
% 0.25/1.42 # Non-unit-clauses : 11
% 0.25/1.42 # Current number of unprocessed clauses: 0
% 0.25/1.42 # ...number of literals in the above : 0
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 2
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 26
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 18
% 0.25/1.42 # Non-unit clause-clause subsumptions : 5
% 0.25/1.42 # Unit Clause-clause subsumption calls : 1
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 1
% 0.25/1.42 # BW rewrite match successes : 1
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 1080
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.015 s
% 0.25/1.42 # System time : 0.001 s
% 0.25/1.42 # Total time : 0.016 s
% 0.25/1.42 # Maximum resident set size: 2720 pages
% 0.25/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.42 # Preprocessing time : 0.022 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 48
% 0.25/1.42 # Proof object clause steps : 29
% 0.25/1.42 # Proof object formula steps : 19
% 0.25/1.42 # Proof object conjectures : 15
% 0.25/1.42 # Proof object clause conjectures : 12
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 14
% 0.25/1.42 # Proof object initial formulas used : 9
% 0.25/1.42 # Proof object generating inferences : 13
% 0.25/1.42 # Proof object simplifying inferences : 13
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 28
% 0.25/1.43 # Removed by relevancy pruning/SinE : 0
% 0.25/1.43 # Initial clauses : 88
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 88
% 0.25/1.43 # Processed clauses : 290
% 0.25/1.43 # ...of these trivial : 0
% 0.25/1.43 # ...subsumed : 39
% 0.25/1.43 # ...remaining for further processing : 251
% 0.25/1.43 # Other redundant clauses eliminated : 4
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 3
% 0.25/1.43 # Generated clauses : 762
% 0.25/1.43 # ...of the previous two non-trivial : 706
% 0.25/1.43 # Contextual simplify-reflections : 5
% 0.25/1.43 # Paramodulations : 719
% 0.25/1.43 # Factorizations : 10
% 0.25/1.43 # Equation resolutions : 33
% 0.25/1.43 # Current number of processed clauses : 247
% 0.25/1.43 # Positive orientable unit clauses : 16
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 10
% 0.25/1.43 # Non-unit-clauses : 221
% 0.25/1.43 # Current number of unprocessed clauses: 503
% 0.25/1.43 # ...number of literals in the above : 2165
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 3
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 7732
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 3860
% 0.25/1.43 # Non-unit clause-clause subsumptions : 43
% 0.25/1.43 # Unit Clause-clause subsumption calls : 540
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 18
% 0.25/1.43 # BW rewrite match successes : 1
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 15469
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.045 s
% 0.25/1.43 # System time : 0.004 s
% 0.25/1.43 # Total time : 0.049 s
% 0.25/1.43 # Maximum resident set size: 3908 pages
%------------------------------------------------------------------------------