%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV367+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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 8.05s 2.40s
% Output : CNFRefutation 8.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 7 unt; 0 nHn; 5 RR)
% Number of literals : 7 ( 2 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 6 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_82,negated_conjecture,
contains_pq(i(triple(esk5_0,create_slb,esk6_0)),esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bhgslldn/input.p',i_0_82) ).
cnf(i_0_54,plain,
i(triple(X1,create_slb,X2)) = create_pq,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bhgslldn/input.p',i_0_54) ).
cnf(i_0_76,plain,
~ contains_pq(create_pq,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bhgslldn/input.p',i_0_76) ).
cnf(c_0_86,negated_conjecture,
contains_pq(i(triple(esk5_0,create_slb,esk6_0)),esk7_0),
i_0_82 ).
cnf(c_0_87,plain,
i(triple(X1,create_slb,X2)) = create_pq,
i_0_54 ).
cnf(c_0_88,plain,
~ contains_pq(create_pq,X1),
i_0_76 ).
cnf(c_0_89,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87]),c_0_88]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.11 % Problem : SWV367+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.31 % Computer : n020.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 600
% 0.12/0.31 % DateTime : Wed Jun 15 10:33:21 EDT 2022
% 0.12/0.31 % CPUTime :
% 0.16/0.42 # ENIGMATIC: Selected SinE mode:
% 0.16/0.43 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.43 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.16/0.43 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.16/0.43 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.05/2.40 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.05/2.40 # Version: 2.1pre011
% 8.05/2.40 # Preprocessing time : 0.012 s
% 8.05/2.40
% 8.05/2.40 # Proof found!
% 8.05/2.40 # SZS status Theorem
% 8.05/2.40 # SZS output start CNFRefutation
% See solution above
% 8.05/2.40 # Proof object total steps : 7
% 8.05/2.40 # Proof object clause steps : 4
% 8.05/2.40 # Proof object formula steps : 3
% 8.05/2.40 # Proof object conjectures : 3
% 8.05/2.40 # Proof object clause conjectures : 2
% 8.05/2.40 # Proof object formula conjectures : 1
% 8.05/2.40 # Proof object initial clauses used : 3
% 8.05/2.40 # Proof object initial formulas used : 3
% 8.05/2.40 # Proof object generating inferences : 0
% 8.05/2.40 # Proof object simplifying inferences : 2
% 8.05/2.40 # Training examples: 0 positive, 0 negative
% 8.05/2.40 # Parsed axioms : 86
% 8.05/2.40 # Removed by relevancy pruning/SinE : 0
% 8.05/2.40 # Initial clauses : 86
% 8.05/2.40 # Removed in clause preprocessing : 0
% 8.05/2.40 # Initial clauses in saturation : 86
% 8.05/2.40 # Processed clauses : 39
% 8.05/2.40 # ...of these trivial : 0
% 8.05/2.40 # ...subsumed : 0
% 8.05/2.40 # ...remaining for further processing : 39
% 8.05/2.40 # Other redundant clauses eliminated : 0
% 8.05/2.40 # Clauses deleted for lack of memory : 0
% 8.05/2.40 # Backward-subsumed : 0
% 8.05/2.40 # Backward-rewritten : 2
% 8.05/2.40 # Generated clauses : 25
% 8.05/2.40 # ...of the previous two non-trivial : 12
% 8.05/2.40 # Contextual simplify-reflections : 1
% 8.05/2.40 # Paramodulations : 23
% 8.05/2.40 # Factorizations : 2
% 8.05/2.40 # Equation resolutions : 0
% 8.05/2.40 # Propositional unsat checks : 0
% 8.05/2.40 # Propositional unsat check successes : 0
% 8.05/2.40 # Current number of processed clauses : 37
% 8.05/2.40 # Positive orientable unit clauses : 8
% 8.05/2.40 # Positive unorientable unit clauses: 0
% 8.05/2.40 # Negative unit clauses : 6
% 8.05/2.40 # Non-unit-clauses : 23
% 8.05/2.40 # Current number of unprocessed clauses: 58
% 8.05/2.40 # ...number of literals in the above : 133
% 8.05/2.40 # Current number of archived formulas : 0
% 8.05/2.40 # Current number of archived clauses : 2
% 8.05/2.40 # Clause-clause subsumption calls (NU) : 149
% 8.05/2.40 # Rec. Clause-clause subsumption calls : 127
% 8.05/2.40 # Non-unit clause-clause subsumptions : 1
% 8.05/2.40 # Unit Clause-clause subsumption calls : 5
% 8.05/2.40 # Rewrite failures with RHS unbound : 0
% 8.05/2.40 # BW rewrite match attempts : 1
% 8.05/2.40 # BW rewrite match successes : 1
% 8.05/2.40 # Condensation attempts : 0
% 8.05/2.40 # Condensation successes : 0
% 8.05/2.40 # Termbank termtop insertions : 1577
% 8.05/2.40
% 8.05/2.40 # -------------------------------------------------
% 8.05/2.40 # User time : 0.010 s
% 8.05/2.40 # System time : 0.003 s
% 8.05/2.40 # Total time : 0.013 s
% 8.05/2.40 # ...preprocessing : 0.012 s
% 8.05/2.40 # ...main loop : 0.001 s
% 8.05/2.40 # Maximum resident set size: 7136 pages
% 8.05/2.40
%------------------------------------------------------------------------------