TSTP Solution File: SWV415+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV415+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:47:10 EDT 2022
% Result : Theorem 4.50s 2.26s
% Output : CNFRefutation 4.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 3 RR)
% Number of literals : 11 ( 10 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 41 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_82,lemma,
i(triple(X1,X2,X3)) = i(triple(X4,X2,X5)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ymx7l3hi/input.p',i_0_82) ).
cnf(i_0_55,plain,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ymx7l3hi/input.p',i_0_55) ).
cnf(i_0_42,plain,
triple(insert_pqp(X1,X2),insert_slb(X3,pair(X2,bottom)),X4) = insert_cpq(triple(X1,X3,X4),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ymx7l3hi/input.p',i_0_42) ).
cnf(i_0_81,negated_conjecture,
i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)) != insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ymx7l3hi/input.p',i_0_81) ).
cnf(c_0_87,lemma,
i(triple(X1,X2,X3)) = i(triple(X4,X2,X5)),
i_0_82 ).
cnf(c_0_88,plain,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
i_0_55 ).
cnf(c_0_89,lemma,
insert_pq(i(triple(X1,X2,X3)),X4) = i(triple(X5,insert_slb(X2,pair(X4,X6)),X7)),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_90,plain,
triple(insert_pqp(X1,X2),insert_slb(X3,pair(X2,bottom)),X4) = insert_cpq(triple(X1,X3,X4),X2),
i_0_42 ).
cnf(c_0_91,negated_conjecture,
i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)) != insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0),
i_0_81 ).
cnf(c_0_92,plain,
insert_pq(i(triple(X1,X2,X3)),X4) = i(insert_cpq(triple(X5,X2,X6),X4)),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_93,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_91,c_0_92]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWV415+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 22:05:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.50/2.26 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 4.50/2.26 # Version: 2.1pre011
% 4.50/2.26 # Preprocessing time : 0.012 s
% 4.50/2.26
% 4.50/2.26 # Proof found!
% 4.50/2.26 # SZS status Theorem
% 4.50/2.26 # SZS output start CNFRefutation
% See solution above
% 4.50/2.26 # Proof object total steps : 11
% 4.50/2.26 # Proof object clause steps : 7
% 4.50/2.26 # Proof object formula steps : 4
% 4.50/2.26 # Proof object conjectures : 3
% 4.50/2.26 # Proof object clause conjectures : 2
% 4.50/2.26 # Proof object formula conjectures : 1
% 4.50/2.26 # Proof object initial clauses used : 4
% 4.50/2.26 # Proof object initial formulas used : 4
% 4.50/2.26 # Proof object generating inferences : 2
% 4.50/2.26 # Proof object simplifying inferences : 1
% 4.50/2.26 # Training examples: 0 positive, 0 negative
% 4.50/2.26 # Parsed axioms : 86
% 4.50/2.26 # Removed by relevancy pruning/SinE : 0
% 4.50/2.26 # Initial clauses : 86
% 4.50/2.26 # Removed in clause preprocessing : 0
% 4.50/2.26 # Initial clauses in saturation : 86
% 4.50/2.26 # Processed clauses : 157
% 4.50/2.26 # ...of these trivial : 1
% 4.50/2.26 # ...subsumed : 18
% 4.50/2.26 # ...remaining for further processing : 138
% 4.50/2.26 # Other redundant clauses eliminated : 4
% 4.50/2.26 # Clauses deleted for lack of memory : 0
% 4.50/2.26 # Backward-subsumed : 1
% 4.50/2.26 # Backward-rewritten : 0
% 4.50/2.26 # Generated clauses : 491
% 4.50/2.26 # ...of the previous two non-trivial : 416
% 4.50/2.26 # Contextual simplify-reflections : 3
% 4.50/2.26 # Paramodulations : 485
% 4.50/2.26 # Factorizations : 2
% 4.50/2.26 # Equation resolutions : 4
% 4.50/2.26 # Propositional unsat checks : 0
% 4.50/2.26 # Propositional unsat check successes : 0
% 4.50/2.26 # Current number of processed clauses : 133
% 4.50/2.26 # Positive orientable unit clauses : 20
% 4.50/2.26 # Positive unorientable unit clauses: 5
% 4.50/2.26 # Negative unit clauses : 14
% 4.50/2.26 # Non-unit-clauses : 94
% 4.50/2.26 # Current number of unprocessed clauses: 316
% 4.50/2.26 # ...number of literals in the above : 896
% 4.50/2.26 # Current number of archived formulas : 0
% 4.50/2.26 # Current number of archived clauses : 2
% 4.50/2.26 # Clause-clause subsumption calls (NU) : 1338
% 4.50/2.26 # Rec. Clause-clause subsumption calls : 993
% 4.50/2.26 # Non-unit clause-clause subsumptions : 9
% 4.50/2.26 # Unit Clause-clause subsumption calls : 622
% 4.50/2.26 # Rewrite failures with RHS unbound : 35
% 4.50/2.26 # BW rewrite match attempts : 16
% 4.50/2.26 # BW rewrite match successes : 9
% 4.50/2.26 # Condensation attempts : 0
% 4.50/2.26 # Condensation successes : 0
% 4.50/2.26 # Termbank termtop insertions : 7819
% 4.50/2.26
% 4.50/2.26 # -------------------------------------------------
% 4.50/2.26 # User time : 0.016 s
% 4.50/2.26 # System time : 0.005 s
% 4.50/2.26 # Total time : 0.020 s
% 4.50/2.26 # ...preprocessing : 0.012 s
% 4.50/2.26 # ...main loop : 0.008 s
% 4.50/2.26 # Maximum resident set size: 7128 pages
% 4.50/2.26
%------------------------------------------------------------------------------