%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV162+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:03 EDT 2022
% Result : Theorem 9.28s 2.72s
% Output : CNFRefutation 9.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 12 unt; 2 nHn; 18 RR)
% Number of literals : 28 ( 9 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-3 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzwrn8ag/input.p',i_0_1) ).
cnf(i_0_4,negated_conjecture,
( sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1
| ~ leq(n0,X1)
| ~ leq(X1,minus(pv10,n1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzwrn8ag/input.p',i_0_4) ).
cnf(i_0_3,negated_conjecture,
leq(n0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzwrn8ag/input.p',i_0_3) ).
cnf(i_0_48,plain,
( leq(X1,minus(X2,n1))
| ~ gt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzwrn8ag/input.p',i_0_48) ).
cnf(i_0_47,plain,
( X1 = X2
| gt(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzwrn8ag/input.p',i_0_47) ).
cnf(i_0_2,negated_conjecture,
leq(esk1_0,pv10),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzwrn8ag/input.p',i_0_2) ).
cnf(i_0_7,negated_conjecture,
sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzwrn8ag/input.p',i_0_7) ).
cnf(c_0_56,negated_conjecture,
sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1,
i_0_1 ).
cnf(c_0_57,negated_conjecture,
( sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1
| ~ leq(n0,X1)
| ~ leq(X1,minus(pv10,n1)) ),
i_0_4 ).
cnf(c_0_58,negated_conjecture,
leq(n0,esk1_0),
i_0_3 ).
cnf(c_0_59,negated_conjecture,
~ leq(esk1_0,minus(pv10,n1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_60,plain,
( leq(X1,minus(X2,n1))
| ~ gt(X2,X1) ),
i_0_48 ).
cnf(c_0_61,plain,
( X1 = X2
| gt(X2,X1)
| ~ leq(X1,X2) ),
i_0_47 ).
cnf(c_0_62,negated_conjecture,
leq(esk1_0,pv10),
i_0_2 ).
cnf(c_0_63,plain,
~ gt(pv10,esk1_0),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
esk1_0 = pv10,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]) ).
cnf(c_0_65,negated_conjecture,
sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1,
i_0_7 ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_64]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV162+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 04:31:10 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.28/2.72 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 9.28/2.72 # Version: 2.1pre011
% 9.28/2.72 # Preprocessing time : 0.016 s
% 9.28/2.72
% 9.28/2.72 # Proof found!
% 9.28/2.72 # SZS status Theorem
% 9.28/2.72 # SZS output start CNFRefutation
% See solution above
% 9.28/2.72 # Proof object total steps : 18
% 9.28/2.72 # Proof object clause steps : 11
% 9.28/2.72 # Proof object formula steps : 7
% 9.28/2.72 # Proof object conjectures : 13
% 9.28/2.72 # Proof object clause conjectures : 8
% 9.28/2.72 # Proof object formula conjectures : 5
% 9.28/2.72 # Proof object initial clauses used : 7
% 9.28/2.72 # Proof object initial formulas used : 7
% 9.28/2.72 # Proof object generating inferences : 3
% 9.28/2.72 # Proof object simplifying inferences : 6
% 9.28/2.72 # Training examples: 0 positive, 0 negative
% 9.28/2.72 # Parsed axioms : 198
% 9.28/2.72 # Removed by relevancy pruning/SinE : 0
% 9.28/2.72 # Initial clauses : 198
% 9.28/2.72 # Removed in clause preprocessing : 0
% 9.28/2.72 # Initial clauses in saturation : 198
% 9.28/2.72 # Processed clauses : 227
% 9.28/2.72 # ...of these trivial : 0
% 9.28/2.72 # ...subsumed : 5
% 9.28/2.72 # ...remaining for further processing : 222
% 9.28/2.72 # Other redundant clauses eliminated : 7
% 9.28/2.72 # Clauses deleted for lack of memory : 0
% 9.28/2.72 # Backward-subsumed : 0
% 9.28/2.72 # Backward-rewritten : 13
% 9.28/2.72 # Generated clauses : 1537
% 9.28/2.72 # ...of the previous two non-trivial : 1501
% 9.28/2.72 # Contextual simplify-reflections : 0
% 9.28/2.72 # Paramodulations : 1496
% 9.28/2.72 # Factorizations : 32
% 9.28/2.72 # Equation resolutions : 9
% 9.28/2.72 # Propositional unsat checks : 0
% 9.28/2.72 # Propositional unsat check successes : 0
% 9.28/2.72 # Current number of processed clauses : 208
% 9.28/2.72 # Positive orientable unit clauses : 52
% 9.28/2.72 # Positive unorientable unit clauses: 5
% 9.28/2.72 # Negative unit clauses : 9
% 9.28/2.72 # Non-unit-clauses : 142
% 9.28/2.72 # Current number of unprocessed clauses: 1265
% 9.28/2.72 # ...number of literals in the above : 7241
% 9.28/2.72 # Current number of archived formulas : 0
% 9.28/2.72 # Current number of archived clauses : 13
% 9.28/2.72 # Clause-clause subsumption calls (NU) : 8495
% 9.28/2.72 # Rec. Clause-clause subsumption calls : 833
% 9.28/2.72 # Non-unit clause-clause subsumptions : 1
% 9.28/2.72 # Unit Clause-clause subsumption calls : 1477
% 9.28/2.72 # Rewrite failures with RHS unbound : 0
% 9.28/2.72 # BW rewrite match attempts : 24
% 9.28/2.72 # BW rewrite match successes : 15
% 9.28/2.72 # Condensation attempts : 0
% 9.28/2.72 # Condensation successes : 0
% 9.28/2.72 # Termbank termtop insertions : 42224
% 9.28/2.72
% 9.28/2.72 # -------------------------------------------------
% 9.28/2.72 # User time : 0.043 s
% 9.28/2.72 # System time : 0.004 s
% 9.28/2.72 # Total time : 0.047 s
% 9.28/2.72 # ...preprocessing : 0.016 s
% 9.28/2.72 # ...main loop : 0.031 s
% 9.28/2.72 # Maximum resident set size: 7136 pages
% 9.28/2.72
%------------------------------------------------------------------------------