TSTP Solution File: SWV369+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV369+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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.68s 2.39s
% Output : CNFRefutation 7.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 8 unt; 2 nHn; 10 RR)
% Number of literals : 16 ( 2 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 16 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_81,negated_conjecture,
( contains_cpq(triple(esk5_0,create_slb,esk6_0),esk7_0)
| contains_pq(i(triple(esk5_0,create_slb,esk6_0)),esk7_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fv3229br/input.p',i_0_81) ).
cnf(i_0_54,plain,
i(triple(X1,create_slb,X2)) = create_pq,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fv3229br/input.p',i_0_54) ).
cnf(i_0_76,plain,
~ contains_pq(create_pq,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fv3229br/input.p',i_0_76) ).
cnf(i_0_39,plain,
( contains_slb(X1,X2)
| ~ contains_cpq(triple(X3,X1,X4),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fv3229br/input.p',i_0_39) ).
cnf(i_0_13,plain,
~ contains_slb(create_slb,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fv3229br/input.p',i_0_13) ).
cnf(c_0_87,negated_conjecture,
( contains_cpq(triple(esk5_0,create_slb,esk6_0),esk7_0)
| contains_pq(i(triple(esk5_0,create_slb,esk6_0)),esk7_0) ),
i_0_81 ).
cnf(c_0_88,plain,
i(triple(X1,create_slb,X2)) = create_pq,
i_0_54 ).
cnf(c_0_89,plain,
~ contains_pq(create_pq,X1),
i_0_76 ).
cnf(c_0_90,plain,
( contains_slb(X1,X2)
| ~ contains_cpq(triple(X3,X1,X4),X2) ),
i_0_39 ).
cnf(c_0_91,negated_conjecture,
contains_cpq(triple(esk5_0,create_slb,esk6_0),esk7_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88]),c_0_89]) ).
cnf(c_0_92,plain,
~ contains_slb(create_slb,X1),
i_0_13 ).
cnf(c_0_93,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV369+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n010.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 21:59:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.68/2.39 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.68/2.39 # Version: 2.1pre011
% 7.68/2.39 # Preprocessing time : 0.011 s
% 7.68/2.39
% 7.68/2.39 # Proof found!
% 7.68/2.39 # SZS status Theorem
% 7.68/2.39 # SZS output start CNFRefutation
% See solution above
% 7.68/2.39 # Proof object total steps : 12
% 7.68/2.39 # Proof object clause steps : 7
% 7.68/2.39 # Proof object formula steps : 5
% 7.68/2.39 # Proof object conjectures : 3
% 7.68/2.39 # Proof object clause conjectures : 2
% 7.68/2.39 # Proof object formula conjectures : 1
% 7.68/2.39 # Proof object initial clauses used : 5
% 7.68/2.39 # Proof object initial formulas used : 5
% 7.68/2.39 # Proof object generating inferences : 1
% 7.68/2.39 # Proof object simplifying inferences : 3
% 7.68/2.39 # Training examples: 0 positive, 0 negative
% 7.68/2.39 # Parsed axioms : 86
% 7.68/2.39 # Removed by relevancy pruning/SinE : 0
% 7.68/2.39 # Initial clauses : 86
% 7.68/2.39 # Removed in clause preprocessing : 0
% 7.68/2.39 # Initial clauses in saturation : 86
% 7.68/2.39 # Processed clauses : 87
% 7.68/2.39 # ...of these trivial : 0
% 7.68/2.39 # ...subsumed : 0
% 7.68/2.39 # ...remaining for further processing : 87
% 7.68/2.39 # Other redundant clauses eliminated : 4
% 7.68/2.39 # Clauses deleted for lack of memory : 0
% 7.68/2.39 # Backward-subsumed : 0
% 7.68/2.39 # Backward-rewritten : 2
% 7.68/2.39 # Generated clauses : 164
% 7.68/2.39 # ...of the previous two non-trivial : 142
% 7.68/2.39 # Contextual simplify-reflections : 1
% 7.68/2.39 # Paramodulations : 159
% 7.68/2.39 # Factorizations : 2
% 7.68/2.39 # Equation resolutions : 4
% 7.68/2.39 # Propositional unsat checks : 0
% 7.68/2.39 # Propositional unsat check successes : 0
% 7.68/2.39 # Current number of processed clauses : 82
% 7.68/2.39 # Positive orientable unit clauses : 15
% 7.68/2.39 # Positive unorientable unit clauses: 2
% 7.68/2.39 # Negative unit clauses : 6
% 7.68/2.39 # Non-unit-clauses : 59
% 7.68/2.39 # Current number of unprocessed clauses: 139
% 7.68/2.39 # ...number of literals in the above : 384
% 7.68/2.39 # Current number of archived formulas : 0
% 7.68/2.39 # Current number of archived clauses : 2
% 7.68/2.39 # Clause-clause subsumption calls (NU) : 425
% 7.68/2.39 # Rec. Clause-clause subsumption calls : 325
% 7.68/2.39 # Non-unit clause-clause subsumptions : 1
% 7.68/2.39 # Unit Clause-clause subsumption calls : 27
% 7.68/2.39 # Rewrite failures with RHS unbound : 0
% 7.68/2.39 # BW rewrite match attempts : 1
% 7.68/2.39 # BW rewrite match successes : 1
% 7.68/2.39 # Condensation attempts : 0
% 7.68/2.39 # Condensation successes : 0
% 7.68/2.39 # Termbank termtop insertions : 3680
% 7.68/2.39
% 7.68/2.39 # -------------------------------------------------
% 7.68/2.39 # User time : 0.012 s
% 7.68/2.39 # System time : 0.003 s
% 7.68/2.39 # Total time : 0.015 s
% 7.68/2.39 # ...preprocessing : 0.011 s
% 7.68/2.39 # ...main loop : 0.003 s
% 7.68/2.39 # Maximum resident set size: 7128 pages
% 7.68/2.39
%------------------------------------------------------------------------------