TSTP Solution File: SWV138+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV138+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:59 EDT 2022
% Result : Theorem 7.25s 2.35s
% Output : CNFRefutation 7.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 9 unt; 4 nHn; 18 RR)
% Number of literals : 31 ( 5 equ; 11 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_168,plain,
( gt(X1,X2)
| ~ gt(X3,X2)
| ~ gt(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-snsow8sc/lgb.p',i_0_168) ).
cnf(i_0_22,plain,
gt(n2,n0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-snsow8sc/lgb.p',i_0_22) ).
cnf(i_0_43,plain,
( X1 = X2
| gt(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-snsow8sc/lgb.p',i_0_43) ).
cnf(i_0_15,negated_conjecture,
leq(n2,pv1325),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-snsow8sc/lgb.p',i_0_15) ).
cnf(i_0_42,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-snsow8sc/lgb.p',i_0_42) ).
cnf(i_0_9,negated_conjecture,
~ leq(n0,pv1325),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-snsow8sc/lgb.p',i_0_9) ).
cnf(c_0_175,plain,
( gt(X1,X2)
| ~ gt(X3,X2)
| ~ gt(X1,X3) ),
i_0_168 ).
cnf(c_0_176,plain,
gt(n2,n0),
i_0_22 ).
cnf(c_0_177,plain,
( X1 = X2
| gt(X2,X1)
| ~ leq(X1,X2) ),
i_0_43 ).
cnf(c_0_178,negated_conjecture,
leq(n2,pv1325),
i_0_15 ).
cnf(c_0_179,plain,
( gt(X1,n0)
| ~ gt(X1,n2) ),
inference(spm,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_180,negated_conjecture,
( pv1325 = n2
| gt(pv1325,n2) ),
inference(spm,[status(thm)],[c_0_177,c_0_178]) ).
cnf(c_0_181,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
i_0_42 ).
cnf(c_0_182,negated_conjecture,
( pv1325 = n2
| gt(pv1325,n0) ),
inference(spm,[status(thm)],[c_0_179,c_0_180]) ).
cnf(c_0_183,negated_conjecture,
~ leq(n0,pv1325),
i_0_9 ).
cnf(c_0_184,plain,
pv1325 = n2,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_181,c_0_182]),c_0_183]) ).
cnf(c_0_185,plain,
leq(n0,n2),
inference(spm,[status(thm)],[c_0_181,c_0_176]) ).
cnf(c_0_186,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_183,c_0_184]),c_0_185])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV138+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.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 : Tue Jun 14 19:01:51 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.25/2.35 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.25/2.35 # No SInE strategy applied
% 7.25/2.35 # Trying AutoSched0 for 150 seconds
% 7.25/2.35 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.25/2.35 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.25/2.35 #
% 7.25/2.35 # Preprocessing time : 0.023 s
% 7.25/2.35 # Presaturation interreduction done
% 7.25/2.35
% 7.25/2.35 # Proof found!
% 7.25/2.35 # SZS status Theorem
% 7.25/2.35 # SZS output start CNFRefutation
% See solution above
% 7.25/2.35 # Training examples: 0 positive, 0 negative
% 7.25/2.35
% 7.25/2.35 # -------------------------------------------------
% 7.25/2.35 # User time : 0.027 s
% 7.25/2.35 # System time : 0.006 s
% 7.25/2.35 # Total time : 0.034 s
% 7.25/2.35 # Maximum resident set size: 7128 pages
% 7.25/2.35
%------------------------------------------------------------------------------