TSTP Solution File: GEO258+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO258+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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 8.55s 2.55s
% Output : CNFRefutation 8.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 8 unt; 10 nHn; 26 RR)
% Number of literals : 56 ( 0 equ; 25 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_17,negated_conjecture,
~ between_on_line(esk1_0,esk4_0,esk3_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qw_qr7bw/input.p',i_0_17) ).
cnf(i_0_5,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-qw_qr7bw/input.p',i_0_5) ).
cnf(i_0_7,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-qw_qr7bw/input.p',i_0_7) ).
cnf(i_0_18,negated_conjecture,
between_on_line(esk1_0,esk2_0,esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qw_qr7bw/input.p',i_0_18) ).
cnf(i_0_9,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-qw_qr7bw/input.p',i_0_9) ).
cnf(i_0_4,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-qw_qr7bw/input.p',i_0_4) ).
cnf(i_0_8,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-qw_qr7bw/input.p',i_0_8) ).
cnf(i_0_6,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-qw_qr7bw/input.p',i_0_6) ).
cnf(c_0_27,negated_conjecture,
~ between_on_line(esk1_0,esk4_0,esk3_0,esk2_0),
i_0_17 ).
cnf(c_0_28,plain,
( between_on_line(X1,X2,X3,X4)
| ~ before_on_line(X1,X3,X4)
| ~ before_on_line(X1,X2,X3) ),
i_0_5 ).
cnf(c_0_29,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X3,X2)
| ~ between_on_line(X1,X4,X2,X3) ),
i_0_7 ).
cnf(c_0_30,negated_conjecture,
between_on_line(esk1_0,esk2_0,esk3_0,esk4_0),
i_0_18 ).
cnf(c_0_31,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X4,X3)
| ~ between_on_line(X1,X2,X3,X4) ),
i_0_9 ).
cnf(c_0_32,plain,
( between_on_line(X1,X2,X3,X4)
| ~ before_on_line(X1,X3,X2)
| ~ before_on_line(X1,X4,X3) ),
i_0_4 ).
cnf(c_0_33,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_27,c_0_28]) ).
cnf(c_0_34,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_29,c_0_30]) ).
cnf(c_0_35,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_31,c_0_30]) ).
cnf(c_0_36,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_27,c_0_32]) ).
cnf(c_0_37,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_33,c_0_34]) ).
cnf(c_0_38,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_33,c_0_35]) ).
cnf(c_0_39,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X3,X2)
| ~ between_on_line(X1,X2,X3,X4) ),
i_0_8 ).
cnf(c_0_40,negated_conjecture,
~ before_on_line(esk1_0,esk3_0,esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_41,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X2,X4)
| ~ between_on_line(X1,X4,X2,X3) ),
i_0_6 ).
cnf(c_0_42,negated_conjecture,
before_on_line(esk1_0,esk2_0,esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_30]),c_0_40]) ).
cnf(c_0_43,negated_conjecture,
before_on_line(esk1_0,esk3_0,esk4_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_30]),c_0_40]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_42])]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO258+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sat Jun 18 06:50:54 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected SinE mode:
% 0.22/0.49 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.55/2.55 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.55/2.55 # Version: 2.1pre011
% 8.55/2.55 # Preprocessing time : 0.011 s
% 8.55/2.55
% 8.55/2.55 # Proof found!
% 8.55/2.55 # SZS status Theorem
% 8.55/2.55 # SZS output start CNFRefutation
% See solution above
% 8.55/2.55 # Proof object total steps : 26
% 8.55/2.55 # Proof object clause steps : 18
% 8.55/2.55 # Proof object formula steps : 8
% 8.55/2.55 # Proof object conjectures : 14
% 8.55/2.55 # Proof object clause conjectures : 12
% 8.55/2.55 # Proof object formula conjectures : 2
% 8.55/2.55 # Proof object initial clauses used : 8
% 8.55/2.55 # Proof object initial formulas used : 8
% 8.55/2.55 # Proof object generating inferences : 9
% 8.55/2.55 # Proof object simplifying inferences : 7
% 8.55/2.55 # Training examples: 0 positive, 0 negative
% 8.55/2.55 # Parsed axioms : 60
% 8.55/2.55 # Removed by relevancy pruning/SinE : 0
% 8.55/2.55 # Initial clauses : 60
% 8.55/2.55 # Removed in clause preprocessing : 0
% 8.55/2.55 # Initial clauses in saturation : 60
% 8.55/2.55 # Processed clauses : 88
% 8.55/2.55 # ...of these trivial : 0
% 8.55/2.55 # ...subsumed : 25
% 8.55/2.55 # ...remaining for further processing : 62
% 8.55/2.55 # Other redundant clauses eliminated : 0
% 8.55/2.55 # Clauses deleted for lack of memory : 0
% 8.55/2.55 # Backward-subsumed : 7
% 8.55/2.55 # Backward-rewritten : 6
% 8.55/2.55 # Generated clauses : 63
% 8.55/2.55 # ...of the previous two non-trivial : 47
% 8.55/2.55 # Contextual simplify-reflections : 6
% 8.55/2.55 # Paramodulations : 63
% 8.55/2.55 # Factorizations : 0
% 8.55/2.55 # Equation resolutions : 0
% 8.55/2.55 # Propositional unsat checks : 0
% 8.55/2.55 # Propositional unsat check successes : 0
% 8.55/2.55 # Current number of processed clauses : 49
% 8.55/2.55 # Positive orientable unit clauses : 5
% 8.55/2.55 # Positive unorientable unit clauses: 0
% 8.55/2.55 # Negative unit clauses : 13
% 8.55/2.55 # Non-unit-clauses : 31
% 8.55/2.55 # Current number of unprocessed clauses: 17
% 8.55/2.55 # ...number of literals in the above : 73
% 8.55/2.55 # Current number of archived formulas : 0
% 8.55/2.55 # Current number of archived clauses : 13
% 8.55/2.55 # Clause-clause subsumption calls (NU) : 342
% 8.55/2.55 # Rec. Clause-clause subsumption calls : 140
% 8.55/2.55 # Non-unit clause-clause subsumptions : 14
% 8.55/2.55 # Unit Clause-clause subsumption calls : 109
% 8.55/2.55 # Rewrite failures with RHS unbound : 0
% 8.55/2.55 # BW rewrite match attempts : 4
% 8.55/2.55 # BW rewrite match successes : 3
% 8.55/2.55 # Condensation attempts : 0
% 8.55/2.55 # Condensation successes : 0
% 8.55/2.55 # Termbank termtop insertions : 1967
% 8.55/2.55
% 8.55/2.55 # -------------------------------------------------
% 8.55/2.55 # User time : 0.011 s
% 8.55/2.55 # System time : 0.002 s
% 8.55/2.55 # Total time : 0.013 s
% 8.55/2.55 # ...preprocessing : 0.011 s
% 8.55/2.55 # ...main loop : 0.002 s
% 8.55/2.55 # Maximum resident set size: 7124 pages
% 8.55/2.55
%------------------------------------------------------------------------------