TSTP Solution File: SWV365+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV365+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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 : Wed Jul 20 17:46:59 EDT 2022
% Result : Theorem 7.14s 2.38s
% Output : CNFRefutation 7.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 5 ( 5 unt; 0 nHn; 3 RR)
% Number of literals : 5 ( 4 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 4 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_81,negated_conjecture,
i(triple(esk5_0,create_slb,esk7_0)) != i(triple(esk6_0,create_slb,esk8_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-enniih7n/input.p',i_0_81) ).
cnf(i_0_54,plain,
i(triple(X1,create_slb,X2)) = create_pq,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-enniih7n/input.p',i_0_54) ).
cnf(c_0_84,negated_conjecture,
i(triple(esk5_0,create_slb,esk7_0)) != i(triple(esk6_0,create_slb,esk8_0)),
i_0_81 ).
cnf(c_0_85,plain,
i(triple(X1,create_slb,X2)) = create_pq,
i_0_54 ).
cnf(c_0_86,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85]),c_0_85])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV365+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n013.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 : Wed Jun 15 13:11:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.14/2.38 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.14/2.38 # Version: 2.1pre011
% 7.14/2.38 # Preprocessing time : 0.013 s
% 7.14/2.38
% 7.14/2.38 # Proof found!
% 7.14/2.38 # SZS status Theorem
% 7.14/2.38 # SZS output start CNFRefutation
% See solution above
% 7.14/2.38 # Proof object total steps : 5
% 7.14/2.38 # Proof object clause steps : 3
% 7.14/2.38 # Proof object formula steps : 2
% 7.14/2.38 # Proof object conjectures : 3
% 7.14/2.38 # Proof object clause conjectures : 2
% 7.14/2.38 # Proof object formula conjectures : 1
% 7.14/2.38 # Proof object initial clauses used : 2
% 7.14/2.38 # Proof object initial formulas used : 2
% 7.14/2.38 # Proof object generating inferences : 0
% 7.14/2.38 # Proof object simplifying inferences : 3
% 7.14/2.38 # Training examples: 0 positive, 0 negative
% 7.14/2.38 # Parsed axioms : 85
% 7.14/2.38 # Removed by relevancy pruning/SinE : 0
% 7.14/2.38 # Initial clauses : 85
% 7.14/2.38 # Removed in clause preprocessing : 0
% 7.14/2.38 # Initial clauses in saturation : 85
% 7.14/2.38 # Processed clauses : 14
% 7.14/2.38 # ...of these trivial : 0
% 7.14/2.38 # ...subsumed : 0
% 7.14/2.38 # ...remaining for further processing : 14
% 7.14/2.38 # Other redundant clauses eliminated : 0
% 7.14/2.38 # Clauses deleted for lack of memory : 0
% 7.14/2.38 # Backward-subsumed : 0
% 7.14/2.38 # Backward-rewritten : 1
% 7.14/2.38 # Generated clauses : 0
% 7.14/2.38 # ...of the previous two non-trivial : 0
% 7.14/2.38 # Contextual simplify-reflections : 0
% 7.14/2.38 # Paramodulations : 0
% 7.14/2.38 # Factorizations : 0
% 7.14/2.38 # Equation resolutions : 0
% 7.14/2.38 # Propositional unsat checks : 0
% 7.14/2.38 # Propositional unsat check successes : 0
% 7.14/2.38 # Current number of processed clauses : 13
% 7.14/2.38 # Positive orientable unit clauses : 5
% 7.14/2.38 # Positive unorientable unit clauses: 0
% 7.14/2.38 # Negative unit clauses : 6
% 7.14/2.38 # Non-unit-clauses : 2
% 7.14/2.38 # Current number of unprocessed clauses: 71
% 7.14/2.38 # ...number of literals in the above : 159
% 7.14/2.38 # Current number of archived formulas : 0
% 7.14/2.38 # Current number of archived clauses : 1
% 7.14/2.38 # Clause-clause subsumption calls (NU) : 0
% 7.14/2.38 # Rec. Clause-clause subsumption calls : 0
% 7.14/2.38 # Non-unit clause-clause subsumptions : 0
% 7.14/2.38 # Unit Clause-clause subsumption calls : 8
% 7.14/2.38 # Rewrite failures with RHS unbound : 0
% 7.14/2.38 # BW rewrite match attempts : 2
% 7.14/2.38 # BW rewrite match successes : 2
% 7.14/2.38 # Condensation attempts : 0
% 7.14/2.38 # Condensation successes : 0
% 7.14/2.38 # Termbank termtop insertions : 1205
% 7.14/2.38
% 7.14/2.38 # -------------------------------------------------
% 7.14/2.38 # User time : 0.009 s
% 7.14/2.38 # System time : 0.004 s
% 7.14/2.38 # Total time : 0.013 s
% 7.14/2.38 # ...preprocessing : 0.013 s
% 7.14/2.38 # ...main loop : 0.000 s
% 7.14/2.38 # Maximum resident set size: 7132 pages
% 7.14/2.38
%------------------------------------------------------------------------------