TSTP Solution File: SWV413+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV413+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:09 EDT 2022
% Result : Theorem 7.48s 2.35s
% Output : CNFRefutation 7.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 5 unt; 0 nHn; 10 RR)
% Number of literals : 17 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_20,negated_conjecture,
( ~ less_than(esk4_0,X1)
| ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-twxliqux/input.p',i_0_20) ).
cnf(i_0_24,lemma,
( pair_in_list(update_slb(X1,X2),X3,X4)
| ~ less_than(X2,X4)
| ~ pair_in_list(X1,X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-twxliqux/input.p',i_0_24) ).
cnf(i_0_23,negated_conjecture,
pair_in_list(esk1_0,esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-twxliqux/input.p',i_0_23) ).
cnf(i_0_21,negated_conjecture,
less_than(esk4_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-twxliqux/input.p',i_0_21) ).
cnf(c_0_29,negated_conjecture,
( ~ less_than(esk4_0,X1)
| ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,X1) ),
i_0_20 ).
cnf(c_0_30,lemma,
( pair_in_list(update_slb(X1,X2),X3,X4)
| ~ less_than(X2,X4)
| ~ pair_in_list(X1,X3,X4) ),
i_0_24 ).
cnf(c_0_31,negated_conjecture,
( ~ pair_in_list(esk1_0,esk2_0,X1)
| ~ less_than(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
pair_in_list(esk1_0,esk2_0,esk3_0),
i_0_23 ).
cnf(c_0_33,negated_conjecture,
less_than(esk4_0,esk3_0),
i_0_21 ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV413+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n011.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 : Thu Jun 16 01:13:22 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
% 7.48/2.35 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.48/2.35 # Version: 2.1pre011
% 7.48/2.35 # Preprocessing time : 0.010 s
% 7.48/2.35
% 7.48/2.35 # Proof found!
% 7.48/2.35 # SZS status Theorem
% 7.48/2.35 # SZS output start CNFRefutation
% See solution above
% 7.48/2.35 # Proof object total steps : 10
% 7.48/2.35 # Proof object clause steps : 6
% 7.48/2.35 # Proof object formula steps : 4
% 7.48/2.35 # Proof object conjectures : 8
% 7.48/2.35 # Proof object clause conjectures : 5
% 7.48/2.35 # Proof object formula conjectures : 3
% 7.48/2.35 # Proof object initial clauses used : 4
% 7.48/2.35 # Proof object initial formulas used : 4
% 7.48/2.35 # Proof object generating inferences : 2
% 7.48/2.35 # Proof object simplifying inferences : 2
% 7.48/2.35 # Training examples: 0 positive, 0 negative
% 7.48/2.35 # Parsed axioms : 30
% 7.48/2.35 # Removed by relevancy pruning/SinE : 0
% 7.48/2.35 # Initial clauses : 30
% 7.48/2.35 # Removed in clause preprocessing : 0
% 7.48/2.35 # Initial clauses in saturation : 30
% 7.48/2.35 # Processed clauses : 33
% 7.48/2.35 # ...of these trivial : 0
% 7.48/2.35 # ...subsumed : 0
% 7.48/2.35 # ...remaining for further processing : 33
% 7.48/2.35 # Other redundant clauses eliminated : 3
% 7.48/2.35 # Clauses deleted for lack of memory : 0
% 7.48/2.35 # Backward-subsumed : 0
% 7.48/2.35 # Backward-rewritten : 0
% 7.48/2.35 # Generated clauses : 39
% 7.48/2.35 # ...of the previous two non-trivial : 30
% 7.48/2.35 # Contextual simplify-reflections : 1
% 7.48/2.35 # Paramodulations : 35
% 7.48/2.35 # Factorizations : 2
% 7.48/2.35 # Equation resolutions : 3
% 7.48/2.35 # Propositional unsat checks : 0
% 7.48/2.35 # Propositional unsat check successes : 0
% 7.48/2.35 # Current number of processed clauses : 31
% 7.48/2.35 # Positive orientable unit clauses : 10
% 7.48/2.35 # Positive unorientable unit clauses: 0
% 7.48/2.35 # Negative unit clauses : 4
% 7.48/2.35 # Non-unit-clauses : 17
% 7.48/2.35 # Current number of unprocessed clauses: 27
% 7.48/2.35 # ...number of literals in the above : 76
% 7.48/2.35 # Current number of archived formulas : 0
% 7.48/2.35 # Current number of archived clauses : 0
% 7.48/2.35 # Clause-clause subsumption calls (NU) : 11
% 7.48/2.35 # Rec. Clause-clause subsumption calls : 11
% 7.48/2.35 # Non-unit clause-clause subsumptions : 1
% 7.48/2.35 # Unit Clause-clause subsumption calls : 9
% 7.48/2.35 # Rewrite failures with RHS unbound : 0
% 7.48/2.35 # BW rewrite match attempts : 3
% 7.48/2.35 # BW rewrite match successes : 0
% 7.48/2.35 # Condensation attempts : 0
% 7.48/2.35 # Condensation successes : 0
% 7.48/2.35 # Termbank termtop insertions : 910
% 7.48/2.35
% 7.48/2.35 # -------------------------------------------------
% 7.48/2.35 # User time : 0.006 s
% 7.48/2.35 # System time : 0.005 s
% 7.48/2.35 # Total time : 0.011 s
% 7.48/2.35 # ...preprocessing : 0.010 s
% 7.48/2.35 # ...main loop : 0.001 s
% 7.48/2.35 # Maximum resident set size: 7132 pages
% 7.48/2.35
%------------------------------------------------------------------------------