TSTP Solution File: SWB002+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWB002+3 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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 : Tue Jul 19 18:58:11 EDT 2022
% Result : Theorem 6.89s 2.14s
% Output : CNFRefutation 6.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_247,negated_conjecture,
( ~ iext(uri_ex_p,X1,X2)
| ~ iext(uri_ex_q,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-seq13qub/input.p',i_0_247) ).
cnf(i_0_248,plain,
iext(uri_ex_q,esk19_0,uri_ex_s),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-seq13qub/input.p',i_0_248) ).
cnf(i_0_249,plain,
iext(uri_ex_p,uri_ex_s,esk19_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-seq13qub/input.p',i_0_249) ).
cnf(c_0_253,negated_conjecture,
( ~ iext(uri_ex_p,X1,X2)
| ~ iext(uri_ex_q,X2,X1) ),
i_0_247 ).
cnf(c_0_254,plain,
iext(uri_ex_q,esk19_0,uri_ex_s),
i_0_248 ).
cnf(c_0_255,plain,
iext(uri_ex_p,uri_ex_s,esk19_0),
i_0_249 ).
cnf(c_0_256,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_254]),c_0_255])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWB002+3 : TPTP v8.1.0. Released v5.2.0.
% 0.00/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Wed Jun 1 02:02:30 EDT 2022
% 0.14/0.29 % CPUTime :
% 0.14/0.35 # ENIGMATIC: Selected SinE mode:
% 0.14/0.36 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.36 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.14/0.36 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.14/0.36 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.89/2.14 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 6.89/2.14 # Version: 2.1pre011
% 6.89/2.14 # Preprocessing time : 0.014 s
% 6.89/2.14
% 6.89/2.14 # Proof found!
% 6.89/2.14 # SZS status Theorem
% 6.89/2.14 # SZS output start CNFRefutation
% See solution above
% 6.89/2.14 # Proof object total steps : 7
% 6.89/2.14 # Proof object clause steps : 4
% 6.89/2.14 # Proof object formula steps : 3
% 6.89/2.14 # Proof object conjectures : 3
% 6.89/2.14 # Proof object clause conjectures : 2
% 6.89/2.14 # Proof object formula conjectures : 1
% 6.89/2.14 # Proof object initial clauses used : 3
% 6.89/2.14 # Proof object initial formulas used : 3
% 6.89/2.14 # Proof object generating inferences : 1
% 6.89/2.14 # Proof object simplifying inferences : 2
% 6.89/2.14 # Training examples: 0 positive, 0 negative
% 6.89/2.14 # Parsed axioms : 230
% 6.89/2.14 # Removed by relevancy pruning/SinE : 0
% 6.89/2.14 # Initial clauses : 230
% 6.89/2.14 # Removed in clause preprocessing : 0
% 6.89/2.14 # Initial clauses in saturation : 230
% 6.89/2.14 # Processed clauses : 26
% 6.89/2.14 # ...of these trivial : 1
% 6.89/2.14 # ...subsumed : 1
% 6.89/2.14 # ...remaining for further processing : 24
% 6.89/2.14 # Other redundant clauses eliminated : 0
% 6.89/2.14 # Clauses deleted for lack of memory : 0
% 6.89/2.14 # Backward-subsumed : 0
% 6.89/2.14 # Backward-rewritten : 0
% 6.89/2.14 # Generated clauses : 3
% 6.89/2.14 # ...of the previous two non-trivial : 2
% 6.89/2.14 # Contextual simplify-reflections : 0
% 6.89/2.14 # Paramodulations : 3
% 6.89/2.14 # Factorizations : 0
% 6.89/2.14 # Equation resolutions : 0
% 6.89/2.14 # Propositional unsat checks : 0
% 6.89/2.14 # Propositional unsat check successes : 0
% 6.89/2.14 # Current number of processed clauses : 24
% 6.89/2.14 # Positive orientable unit clauses : 15
% 6.89/2.14 # Positive unorientable unit clauses: 0
% 6.89/2.14 # Negative unit clauses : 1
% 6.89/2.14 # Non-unit-clauses : 8
% 6.89/2.14 # Current number of unprocessed clauses: 206
% 6.89/2.14 # ...number of literals in the above : 745
% 6.89/2.14 # Current number of archived formulas : 0
% 6.89/2.14 # Current number of archived clauses : 0
% 6.89/2.14 # Clause-clause subsumption calls (NU) : 17
% 6.89/2.14 # Rec. Clause-clause subsumption calls : 12
% 6.89/2.14 # Non-unit clause-clause subsumptions : 1
% 6.89/2.14 # Unit Clause-clause subsumption calls : 7
% 6.89/2.14 # Rewrite failures with RHS unbound : 0
% 6.89/2.14 # BW rewrite match attempts : 0
% 6.89/2.14 # BW rewrite match successes : 0
% 6.89/2.14 # Condensation attempts : 0
% 6.89/2.14 # Condensation successes : 0
% 6.89/2.14 # Termbank termtop insertions : 5834
% 6.89/2.14
% 6.89/2.14 # -------------------------------------------------
% 6.89/2.14 # User time : 0.012 s
% 6.89/2.14 # System time : 0.003 s
% 6.89/2.14 # Total time : 0.015 s
% 6.89/2.14 # ...preprocessing : 0.014 s
% 6.89/2.14 # ...main loop : 0.001 s
% 6.89/2.14 # Maximum resident set size: 7136 pages
% 6.89/2.14
%------------------------------------------------------------------------------