TSTP Solution File: SWV041+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV041+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:45:37 EDT 2022
% Result : Theorem 7.69s 2.42s
% Output : CNFRefutation 7.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 9 unt; 0 nHn; 16 RR)
% Number of literals : 26 ( 4 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( X1 = n0
| ~ leq(X1,n0)
| ~ leq(n0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mr8osfn/lgb.p',i_0_3) ).
cnf(i_0_56,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mr8osfn/lgb.p',i_0_56) ).
cnf(i_0_59,plain,
( gt(X1,X2)
| ~ leq(X2,minus(X1,n1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mr8osfn/lgb.p',i_0_59) ).
cnf(i_0_10,negated_conjecture,
leq(esk2_0,minus(n0,n1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mr8osfn/lgb.p',i_0_10) ).
cnf(i_0_11,negated_conjecture,
leq(n0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mr8osfn/lgb.p',i_0_11) ).
cnf(i_0_53,plain,
~ gt(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mr8osfn/lgb.p',i_0_53) ).
cnf(c_0_66,plain,
( X1 = n0
| ~ leq(X1,n0)
| ~ leq(n0,X1) ),
i_0_3 ).
cnf(c_0_67,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
i_0_56 ).
cnf(c_0_68,plain,
( gt(X1,X2)
| ~ leq(X2,minus(X1,n1)) ),
i_0_59 ).
cnf(c_0_69,negated_conjecture,
leq(esk2_0,minus(n0,n1)),
i_0_10 ).
cnf(c_0_70,plain,
( X1 = n0
| ~ gt(n0,X1)
| ~ leq(n0,X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,negated_conjecture,
leq(n0,esk2_0),
i_0_11 ).
cnf(c_0_72,negated_conjecture,
gt(n0,esk2_0),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,negated_conjecture,
esk2_0 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72])]) ).
cnf(c_0_74,plain,
~ gt(X1,X1),
i_0_53 ).
cnf(c_0_75,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV041+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n005.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Wed Jun 15 18:38:10 EDT 2022
% 0.11/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.69/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.69/2.42 # No SInE strategy applied
% 7.69/2.42 # Trying AutoSched0 for 150 seconds
% 7.69/2.42 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.69/2.42 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.69/2.42 #
% 7.69/2.42 # Preprocessing time : 0.015 s
% 7.69/2.42 # Presaturation interreduction done
% 7.69/2.42
% 7.69/2.42 # Proof found!
% 7.69/2.42 # SZS status Theorem
% 7.69/2.42 # SZS output start CNFRefutation
% See solution above
% 7.69/2.42 # Training examples: 0 positive, 0 negative
% 7.69/2.42
% 7.69/2.42 # -------------------------------------------------
% 7.69/2.42 # User time : 0.016 s
% 7.69/2.42 # System time : 0.007 s
% 7.69/2.42 # Total time : 0.023 s
% 7.69/2.42 # Maximum resident set size: 7128 pages
% 7.69/2.42
%------------------------------------------------------------------------------