TSTP Solution File: GEO258+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO258+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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 03:44:57 EDT 2022
% Result : Theorem 4.49s 2.25s
% Output : CNFRefutation 4.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 7 unt; 10 nHn; 25 RR)
% Number of literals : 55 ( 0 equ; 24 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 48 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_67,negated_conjecture,
~ between_on_line(esk1_0,esk4_0,esk3_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iwocgdez/input.p',i_0_67) ).
cnf(i_0_24,plain,
( between_on_line(X1,X2,X3,X4)
| ~ before_on_line(X1,X3,X4)
| ~ before_on_line(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iwocgdez/input.p',i_0_24) ).
cnf(i_0_28,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X4,X3)
| ~ between_on_line(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iwocgdez/input.p',i_0_28) ).
cnf(i_0_68,negated_conjecture,
between_on_line(esk1_0,esk2_0,esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iwocgdez/input.p',i_0_68) ).
cnf(i_0_26,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X3,X2)
| ~ between_on_line(X1,X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iwocgdez/input.p',i_0_26) ).
cnf(i_0_23,plain,
( between_on_line(X1,X2,X3,X4)
| ~ before_on_line(X1,X3,X2)
| ~ before_on_line(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iwocgdez/input.p',i_0_23) ).
cnf(i_0_27,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X3,X2)
| ~ between_on_line(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iwocgdez/input.p',i_0_27) ).
cnf(i_0_25,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X2,X4)
| ~ between_on_line(X1,X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iwocgdez/input.p',i_0_25) ).
cnf(c_0_77,negated_conjecture,
~ between_on_line(esk1_0,esk4_0,esk3_0,esk2_0),
i_0_67 ).
cnf(c_0_78,plain,
( between_on_line(X1,X2,X3,X4)
| ~ before_on_line(X1,X3,X4)
| ~ before_on_line(X1,X2,X3) ),
i_0_24 ).
cnf(c_0_79,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X4,X3)
| ~ between_on_line(X1,X2,X3,X4) ),
i_0_28 ).
cnf(c_0_80,negated_conjecture,
between_on_line(esk1_0,esk2_0,esk3_0,esk4_0),
i_0_68 ).
cnf(c_0_81,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X3,X2)
| ~ between_on_line(X1,X4,X2,X3) ),
i_0_26 ).
cnf(c_0_82,negated_conjecture,
( ~ before_on_line(esk1_0,esk3_0,esk2_0)
| ~ before_on_line(esk1_0,esk4_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_83,negated_conjecture,
( before_on_line(esk1_0,esk4_0,esk3_0)
| before_on_line(esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_84,negated_conjecture,
( before_on_line(esk1_0,esk4_0,esk3_0)
| before_on_line(esk1_0,esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_81,c_0_80]) ).
cnf(c_0_85,plain,
( between_on_line(X1,X2,X3,X4)
| ~ before_on_line(X1,X3,X2)
| ~ before_on_line(X1,X4,X3) ),
i_0_23 ).
cnf(c_0_86,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X3,X2)
| ~ between_on_line(X1,X2,X3,X4) ),
i_0_27 ).
cnf(c_0_87,negated_conjecture,
( before_on_line(esk1_0,esk2_0,esk3_0)
| ~ before_on_line(esk1_0,esk3_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_88,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X2,X4)
| ~ between_on_line(X1,X4,X2,X3) ),
i_0_25 ).
cnf(c_0_89,negated_conjecture,
( before_on_line(esk1_0,esk3_0,esk4_0)
| ~ before_on_line(esk1_0,esk3_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_82,c_0_84]) ).
cnf(c_0_90,negated_conjecture,
( ~ before_on_line(esk1_0,esk2_0,esk3_0)
| ~ before_on_line(esk1_0,esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_77,c_0_85]) ).
cnf(c_0_91,negated_conjecture,
before_on_line(esk1_0,esk2_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_80]),c_0_87]) ).
cnf(c_0_92,negated_conjecture,
before_on_line(esk1_0,esk3_0,esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_80]),c_0_89]) ).
cnf(c_0_93,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_91])]),c_0_92])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO258+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.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 13:20:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.49/2.25 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 4.49/2.25 # Version: 2.1pre011
% 4.49/2.25 # Preprocessing time : 0.018 s
% 4.49/2.25
% 4.49/2.25 # Proof found!
% 4.49/2.25 # SZS status Theorem
% 4.49/2.25 # SZS output start CNFRefutation
% See solution above
% 4.49/2.25 # Proof object total steps : 25
% 4.49/2.25 # Proof object clause steps : 17
% 4.49/2.25 # Proof object formula steps : 8
% 4.49/2.25 # Proof object conjectures : 13
% 4.49/2.25 # Proof object clause conjectures : 11
% 4.49/2.25 # Proof object formula conjectures : 2
% 4.49/2.25 # Proof object initial clauses used : 8
% 4.49/2.25 # Proof object initial formulas used : 8
% 4.49/2.25 # Proof object generating inferences : 8
% 4.49/2.25 # Proof object simplifying inferences : 6
% 4.49/2.25 # Training examples: 0 positive, 0 negative
% 4.49/2.25 # Parsed axioms : 68
% 4.49/2.25 # Removed by relevancy pruning/SinE : 0
% 4.49/2.25 # Initial clauses : 68
% 4.49/2.25 # Removed in clause preprocessing : 0
% 4.49/2.25 # Initial clauses in saturation : 68
% 4.49/2.25 # Processed clauses : 85
% 4.49/2.25 # ...of these trivial : 0
% 4.49/2.25 # ...subsumed : 21
% 4.49/2.25 # ...remaining for further processing : 63
% 4.49/2.25 # Other redundant clauses eliminated : 0
% 4.49/2.25 # Clauses deleted for lack of memory : 0
% 4.49/2.25 # Backward-subsumed : 4
% 4.49/2.25 # Backward-rewritten : 5
% 4.49/2.25 # Generated clauses : 71
% 4.49/2.25 # ...of the previous two non-trivial : 57
% 4.49/2.25 # Contextual simplify-reflections : 8
% 4.49/2.25 # Paramodulations : 65
% 4.49/2.25 # Factorizations : 6
% 4.49/2.25 # Equation resolutions : 0
% 4.49/2.25 # Propositional unsat checks : 0
% 4.49/2.25 # Propositional unsat check successes : 0
% 4.49/2.25 # Current number of processed clauses : 54
% 4.49/2.25 # Positive orientable unit clauses : 5
% 4.49/2.25 # Positive unorientable unit clauses: 0
% 4.49/2.25 # Negative unit clauses : 12
% 4.49/2.25 # Non-unit-clauses : 37
% 4.49/2.25 # Current number of unprocessed clauses: 30
% 4.49/2.25 # ...number of literals in the above : 67
% 4.49/2.25 # Current number of archived formulas : 0
% 4.49/2.25 # Current number of archived clauses : 9
% 4.49/2.25 # Clause-clause subsumption calls (NU) : 727
% 4.49/2.25 # Rec. Clause-clause subsumption calls : 485
% 4.49/2.25 # Non-unit clause-clause subsumptions : 15
% 4.49/2.25 # Unit Clause-clause subsumption calls : 105
% 4.49/2.25 # Rewrite failures with RHS unbound : 0
% 4.49/2.25 # BW rewrite match attempts : 3
% 4.49/2.25 # BW rewrite match successes : 2
% 4.49/2.25 # Condensation attempts : 0
% 4.49/2.25 # Condensation successes : 0
% 4.49/2.25 # Termbank termtop insertions : 1906
% 4.49/2.25
% 4.49/2.25 # -------------------------------------------------
% 4.49/2.25 # User time : 0.015 s
% 4.49/2.25 # System time : 0.006 s
% 4.49/2.25 # Total time : 0.021 s
% 4.49/2.25 # ...preprocessing : 0.018 s
% 4.49/2.25 # ...main loop : 0.003 s
% 4.49/2.25 # Maximum resident set size: 7128 pages
% 4.49/2.25
%------------------------------------------------------------------------------