TSTP Solution File: SWV189+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV189+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:09 EDT 2022
% Result : Theorem 8.28s 2.53s
% Output : CNFRefutation 8.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 12 unt; 0 nHn; 20 RR)
% Number of literals : 32 ( 4 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_38,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9chijq0/lgb.p',i_0_38) ).
cnf(i_0_15,plain,
gt(n0,tptp_minus_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9chijq0/lgb.p',i_0_15) ).
cnf(i_0_165,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9chijq0/lgb.p',i_0_165) ).
cnf(i_0_4,negated_conjecture,
leq(esk1_0,tptp_minus_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9chijq0/lgb.p',i_0_4) ).
cnf(i_0_9,plain,
( X1 = n0
| ~ leq(X1,n0)
| ~ leq(n0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9chijq0/lgb.p',i_0_9) ).
cnf(i_0_5,negated_conjecture,
leq(n0,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9chijq0/lgb.p',i_0_5) ).
cnf(i_0_37,plain,
~ gt(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9chijq0/lgb.p',i_0_37) ).
cnf(c_0_173,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
i_0_38 ).
cnf(c_0_174,plain,
gt(n0,tptp_minus_1),
i_0_15 ).
cnf(c_0_175,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
i_0_165 ).
cnf(c_0_176,negated_conjecture,
leq(esk1_0,tptp_minus_1),
i_0_4 ).
cnf(c_0_177,plain,
( X1 = n0
| ~ leq(X1,n0)
| ~ leq(n0,X1) ),
i_0_9 ).
cnf(c_0_178,plain,
leq(tptp_minus_1,n0),
inference(spm,[status(thm)],[c_0_173,c_0_174]) ).
cnf(c_0_179,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_180,negated_conjecture,
leq(n0,esk1_0),
i_0_5 ).
cnf(c_0_181,plain,
( tptp_minus_1 = n0
| ~ leq(n0,tptp_minus_1) ),
inference(spm,[status(thm)],[c_0_177,c_0_178]) ).
cnf(c_0_182,negated_conjecture,
leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[c_0_179,c_0_180]) ).
cnf(c_0_183,plain,
tptp_minus_1 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_181,c_0_182])]) ).
cnf(c_0_184,plain,
~ gt(X1,X1),
i_0_37 ).
cnf(c_0_185,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_174,c_0_183]),c_0_184]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV189+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.33 % Computer : n028.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Wed Jun 15 17:18:27 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.28/2.53 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.28/2.53 # No SInE strategy applied
% 8.28/2.53 # Trying AutoSched0 for 150 seconds
% 8.28/2.53 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.28/2.53 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.28/2.53 #
% 8.28/2.53 # Preprocessing time : 0.014 s
% 8.28/2.53 # Presaturation interreduction done
% 8.28/2.53
% 8.28/2.53 # Proof found!
% 8.28/2.53 # SZS status Theorem
% 8.28/2.53 # SZS output start CNFRefutation
% See solution above
% 8.28/2.53 # Training examples: 0 positive, 0 negative
% 8.28/2.53
% 8.28/2.53 # -------------------------------------------------
% 8.28/2.53 # User time : 0.018 s
% 8.28/2.53 # System time : 0.004 s
% 8.28/2.53 # Total time : 0.022 s
% 8.28/2.53 # Maximum resident set size: 7128 pages
% 8.28/2.53
%------------------------------------------------------------------------------