TSTP Solution File: GEO112+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO112+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 5 unt; 0 def)
% Number of atoms : 67 ( 10 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 82 ( 35 ~; 34 |; 10 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 72 ( 8 sgn 21 !; 1 ?)
% 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(theorem_3_8_2,conjecture,
! [X1,X3,X5,X7] :
( between_c(X1,X3,X5,X7)
=> between_c(X1,X7,X5,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',theorem_3_8_2) ).
fof(c_0_2,plain,
! [X9,X10,X11,X12,X9,X10,X11,X12,X14] :
( ( X10 != X12
| ~ between_c(X9,X10,X11,X12) )
& ( part_of(esk5_4(X9,X10,X11,X12),X9)
| ~ between_c(X9,X10,X11,X12) )
& ( end_point(X10,esk5_4(X9,X10,X11,X12))
| ~ between_c(X9,X10,X11,X12) )
& ( end_point(X12,esk5_4(X9,X10,X11,X12))
| ~ between_c(X9,X10,X11,X12) )
& ( inner_point(X11,esk5_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_3,plain,
( between_c(X1,X2,X3,X4)
| X2 = X4
| ~ inner_point(X3,X5)
| ~ end_point(X4,X5)
| ~ end_point(X2,X5)
| ~ part_of(X5,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,plain,
( inner_point(X3,esk5_4(X1,X2,X3,X4))
| ~ between_c(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,plain,
( X1 = X2
| between_c(X3,X1,X4,X2)
| ~ between_c(X5,X6,X4,X7)
| ~ end_point(X2,esk5_4(X5,X6,X4,X7))
| ~ end_point(X1,esk5_4(X5,X6,X4,X7))
| ~ part_of(esk5_4(X5,X6,X4,X7),X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
( end_point(X2,esk5_4(X1,X2,X3,X4))
| ~ between_c(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,plain,
( X1 = X2
| between_c(X3,X1,X4,X2)
| ~ between_c(X5,X2,X4,X6)
| ~ end_point(X1,esk5_4(X5,X2,X4,X6))
| ~ part_of(esk5_4(X5,X2,X4,X6),X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( end_point(X4,esk5_4(X1,X2,X3,X4))
| ~ between_c(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X3,X5,X7] :
( between_c(X1,X3,X5,X7)
=> between_c(X1,X7,X5,X3) ),
inference(assume_negation,[status(cth)],[theorem_3_8_2]) ).
cnf(c_0_10,plain,
( X1 = X2
| between_c(X3,X1,X4,X2)
| ~ between_c(X5,X2,X4,X1)
| ~ part_of(esk5_4(X5,X2,X4,X1),X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( part_of(esk5_4(X1,X2,X3,X4),X1)
| ~ between_c(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_12,negated_conjecture,
( between_c(esk1_0,esk2_0,esk3_0,esk4_0)
& ~ between_c(esk1_0,esk4_0,esk3_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_13,plain,
( X1 = X2
| between_c(X3,X1,X4,X2)
| ~ between_c(X3,X2,X4,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
between_c(esk1_0,esk2_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ between_c(esk1_0,esk4_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ between_c(X1,X2,X3,X4)
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_17,negated_conjecture,
esk4_0 = esk2_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,plain,
~ between_c(X1,X2,X3,X2),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO112+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n028.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 : Fri Jun 17 23:35:58 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.018 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 20
% 0.21/1.40 # Proof object clause steps : 15
% 0.21/1.40 # Proof object formula steps : 5
% 0.21/1.40 # Proof object conjectures : 7
% 0.21/1.40 # Proof object clause conjectures : 4
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 8
% 0.21/1.40 # Proof object initial formulas used : 2
% 0.21/1.40 # Proof object generating inferences : 5
% 0.21/1.40 # Proof object simplifying inferences : 4
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 18
% 0.21/1.40 # Removed by relevancy pruning/SinE : 4
% 0.21/1.40 # Initial clauses : 45
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 45
% 0.21/1.40 # Processed clauses : 557
% 0.21/1.40 # ...of these trivial : 5
% 0.21/1.40 # ...subsumed : 212
% 0.21/1.40 # ...remaining for further processing : 340
% 0.21/1.40 # Other redundant clauses eliminated : 7
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 2
% 0.21/1.40 # Backward-rewritten : 24
% 0.21/1.40 # Generated clauses : 6407
% 0.21/1.40 # ...of the previous two non-trivial : 6220
% 0.21/1.40 # Contextual simplify-reflections : 55
% 0.21/1.40 # Paramodulations : 6287
% 0.21/1.40 # Factorizations : 110
% 0.21/1.40 # Equation resolutions : 10
% 0.21/1.40 # Current number of processed clauses : 313
% 0.21/1.40 # Positive orientable unit clauses : 39
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 4
% 0.21/1.40 # Non-unit-clauses : 270
% 0.21/1.40 # Current number of unprocessed clauses: 5172
% 0.21/1.40 # ...number of literals in the above : 26802
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 26
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 11815
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 5389
% 0.21/1.40 # Non-unit clause-clause subsumptions : 267
% 0.21/1.40 # Unit Clause-clause subsumption calls : 991
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 163
% 0.21/1.40 # BW rewrite match successes : 4
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 160817
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.167 s
% 0.21/1.40 # System time : 0.008 s
% 0.21/1.40 # Total time : 0.175 s
% 0.21/1.40 # Maximum resident set size: 11496 pages
% 0.21/23.40 eprover: CPU time limit exceeded, terminating
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------