TSTP Solution File: GEO118+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO118+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:43 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 85 ( 4 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 107 ( 40 ~; 39 |; 22 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-5 aty)
% Number of variables : 70 ( 19 sgn 47 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/Axioms/GEO004+1.ax',between_c_defn) ).
fof(o3,axiom,
! [X3,X5,X7,X9] :
( between_o(X9,X3,X5,X7)
<=> ? [X1] :
( ! [X3] :
( incident_o(X3,X9)
<=> incident_c(X3,X1) )
& between_c(X1,X3,X5,X7) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+2.ax',o3) ).
fof(between_o_defn,axiom,
! [X9,X3,X5,X7] :
( between_o(X9,X3,X5,X7)
<=> ( ( ordered_by(X9,X3,X5)
& ordered_by(X9,X5,X7) )
| ( ordered_by(X9,X7,X5)
& ordered_by(X9,X5,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+2.ax',between_o_defn) ).
fof(theorem_4_5,conjecture,
! [X9,X3,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_5) ).
fof(c_0_4,plain,
! [X9,X10,X11,X12,X9,X10,X11,X12,X14] :
( ( X10 != X12
| ~ between_c(X9,X10,X11,X12) )
& ( part_of(esk14_4(X9,X10,X11,X12),X9)
| ~ between_c(X9,X10,X11,X12) )
& ( end_point(X10,esk14_4(X9,X10,X11,X12))
| ~ between_c(X9,X10,X11,X12) )
& ( end_point(X12,esk14_4(X9,X10,X11,X12))
| ~ between_c(X9,X10,X11,X12) )
& ( inner_point(X11,esk14_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])])])])])])]) ).
cnf(c_0_5,plain,
( ~ between_c(X1,X2,X3,X4)
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X10,X11,X12,X13,X15,X15,X10,X11,X12,X13,X16] :
( ( ~ incident_o(X15,X13)
| incident_c(X15,esk18_4(X10,X11,X12,X13))
| ~ between_o(X13,X10,X11,X12) )
& ( ~ incident_c(X15,esk18_4(X10,X11,X12,X13))
| incident_o(X15,X13)
| ~ between_o(X13,X10,X11,X12) )
& ( between_c(esk18_4(X10,X11,X12,X13),X10,X11,X12)
| ~ between_o(X13,X10,X11,X12) )
& ( ~ incident_o(esk19_5(X10,X11,X12,X13,X16),X13)
| ~ incident_c(esk19_5(X10,X11,X12,X13,X16),X16)
| ~ between_c(X16,X10,X11,X12)
| between_o(X13,X10,X11,X12) )
& ( incident_o(esk19_5(X10,X11,X12,X13,X16),X13)
| incident_c(esk19_5(X10,X11,X12,X13,X16),X16)
| ~ between_c(X16,X10,X11,X12)
| between_o(X13,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)],[o3])])])])])])]) ).
cnf(c_0_7,plain,
~ between_c(X1,X2,X3,X2),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( between_c(esk18_4(X2,X3,X4,X1),X2,X3,X4)
| ~ between_o(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X10,X11,X12,X13,X10,X11,X12,X13] :
( ( ordered_by(X10,X13,X12)
| ordered_by(X10,X11,X12)
| ~ between_o(X10,X11,X12,X13) )
& ( ordered_by(X10,X12,X11)
| ordered_by(X10,X11,X12)
| ~ between_o(X10,X11,X12,X13) )
& ( ordered_by(X10,X13,X12)
| ordered_by(X10,X12,X13)
| ~ between_o(X10,X11,X12,X13) )
& ( ordered_by(X10,X12,X11)
| ordered_by(X10,X12,X13)
| ~ between_o(X10,X11,X12,X13) )
& ( ~ ordered_by(X10,X11,X12)
| ~ ordered_by(X10,X12,X13)
| between_o(X10,X11,X12,X13) )
& ( ~ ordered_by(X10,X13,X12)
| ~ ordered_by(X10,X12,X11)
| between_o(X10,X11,X12,X13) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[between_o_defn])])])])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X9,X3,X5] :
( ordered_by(X9,X3,X5)
=> ~ ordered_by(X9,X5,X3) ),
inference(assume_negation,[status(cth)],[theorem_4_5]) ).
cnf(c_0_11,plain,
~ between_o(X1,X2,X3,X2),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( between_o(X1,X2,X3,X4)
| ~ ordered_by(X1,X3,X2)
| ~ ordered_by(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
( ordered_by(esk25_0,esk26_0,esk27_0)
& ordered_by(esk25_0,esk27_0,esk26_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_14,plain,
( ~ ordered_by(X1,X2,X3)
| ~ ordered_by(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
ordered_by(esk25_0,esk27_0,esk26_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
ordered_by(esk25_0,esk26_0,esk27_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO118+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 18 03:13:53 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.011 s
% 0.23/1.40
% 0.23/1.40 # Failure: Out of unprocessed clauses!
% 0.23/1.40 # OLD status GaveUp
% 0.23/1.40 # Parsed axioms : 28
% 0.23/1.40 # Removed by relevancy pruning/SinE : 25
% 0.23/1.40 # Initial clauses : 6
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 6
% 0.23/1.40 # Processed clauses : 14
% 0.23/1.40 # ...of these trivial : 2
% 0.23/1.40 # ...subsumed : 0
% 0.23/1.40 # ...remaining for further processing : 12
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 0
% 0.23/1.40 # Backward-rewritten : 0
% 0.23/1.40 # Generated clauses : 11
% 0.23/1.40 # ...of the previous two non-trivial : 8
% 0.23/1.40 # Contextual simplify-reflections : 0
% 0.23/1.40 # Paramodulations : 9
% 0.23/1.40 # Factorizations : 2
% 0.23/1.40 # Equation resolutions : 0
% 0.23/1.40 # Current number of processed clauses : 12
% 0.23/1.40 # Positive orientable unit clauses : 4
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 0
% 0.23/1.40 # Non-unit-clauses : 8
% 0.23/1.40 # Current number of unprocessed clauses: 0
% 0.23/1.40 # ...number of literals in the above : 0
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 0
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 14
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 10
% 0.23/1.40 # Non-unit clause-clause subsumptions : 0
% 0.23/1.40 # Unit Clause-clause subsumption calls : 0
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 0
% 0.23/1.40 # BW rewrite match successes : 0
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 865
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.012 s
% 0.23/1.40 # System time : 0.000 s
% 0.23/1.40 # Total time : 0.012 s
% 0.23/1.40 # Maximum resident set size: 2712 pages
% 0.23/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.40 # Preprocessing time : 0.021 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 18
% 0.23/1.40 # Proof object clause steps : 9
% 0.23/1.40 # Proof object formula steps : 9
% 0.23/1.40 # Proof object conjectures : 6
% 0.23/1.40 # Proof object clause conjectures : 3
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 5
% 0.23/1.40 # Proof object initial formulas used : 4
% 0.23/1.40 # Proof object generating inferences : 3
% 0.23/1.40 # Proof object simplifying inferences : 3
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 28
% 0.23/1.40 # Removed by relevancy pruning/SinE : 0
% 0.23/1.40 # Initial clauses : 87
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 87
% 0.23/1.40 # Processed clauses : 98
% 0.23/1.40 # ...of these trivial : 2
% 0.23/1.40 # ...subsumed : 2
% 0.23/1.40 # ...remaining for further processing : 94
% 0.23/1.40 # Other redundant clauses eliminated : 4
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 0
% 0.23/1.40 # Backward-rewritten : 0
% 0.23/1.40 # Generated clauses : 159
% 0.23/1.40 # ...of the previous two non-trivial : 127
% 0.23/1.40 # Contextual simplify-reflections : 2
% 0.23/1.40 # Paramodulations : 142
% 0.23/1.40 # Factorizations : 10
% 0.23/1.40 # Equation resolutions : 7
% 0.23/1.40 # Current number of processed clauses : 93
% 0.23/1.40 # Positive orientable unit clauses : 7
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 3
% 0.23/1.40 # Non-unit-clauses : 83
% 0.23/1.40 # Current number of unprocessed clauses: 116
% 0.23/1.40 # ...number of literals in the above : 488
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 0
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 1164
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 485
% 0.23/1.40 # Non-unit clause-clause subsumptions : 4
% 0.23/1.40 # Unit Clause-clause subsumption calls : 190
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 0
% 0.23/1.40 # BW rewrite match successes : 0
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 7537
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.025 s
% 0.23/1.40 # System time : 0.003 s
% 0.23/1.40 # Total time : 0.028 s
% 0.23/1.40 # Maximum resident set size: 3380 pages
%------------------------------------------------------------------------------