TSTP Solution File: SWV232+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV232+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:17 EDT 2022
% Result : Theorem 8.63s 2.60s
% Output : CNFRefutation 8.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 4 unt; 0 nHn; 10 RR)
% Number of literals : 18 ( 8 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 14 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_199,plain,
( n1 != X1
| n2 != X2
| ~ epred2_2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2h12n1ps/lgb.p',i_0_199) ).
cnf(i_0_194,plain,
( n2 = X1
| ~ epred2_2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2h12n1ps/lgb.p',i_0_194) ).
cnf(i_0_195,plain,
( n1 = X1
| ~ epred2_2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2h12n1ps/lgb.p',i_0_195) ).
cnf(i_0_126,negated_conjecture,
epred2_2(esk21_0,esk22_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2h12n1ps/lgb.p',i_0_126) ).
cnf(c_0_204,plain,
( n1 != X1
| n2 != X2
| ~ epred2_2(X2,X1) ),
i_0_199 ).
cnf(c_0_205,plain,
( n2 = X1
| ~ epred2_2(X1,X2) ),
i_0_194 ).
cnf(c_0_206,plain,
( n1 = X1
| ~ epred2_2(X2,X1) ),
i_0_195 ).
cnf(c_0_207,negated_conjecture,
epred2_2(esk21_0,esk22_0),
i_0_126 ).
cnf(c_0_208,plain,
~ epred2_2(X1,X2),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_204,c_0_205]),c_0_206]) ).
cnf(c_0_209,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_207,c_0_208]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV232+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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:58:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.46 # ENIGMATIC: Selected SinE mode:
% 0.18/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.63/2.60 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.63/2.60 # No SInE strategy applied
% 8.63/2.60 # Trying AutoSched0 for 150 seconds
% 8.63/2.60 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 8.63/2.60 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.63/2.60 #
% 8.63/2.60 # Preprocessing time : 0.020 s
% 8.63/2.60
% 8.63/2.60 # Proof found!
% 8.63/2.60 # SZS status Theorem
% 8.63/2.60 # SZS output start CNFRefutation
% See solution above
% 8.63/2.60 # Training examples: 0 positive, 0 negative
% 8.63/2.60
% 8.63/2.60 # -------------------------------------------------
% 8.63/2.60 # User time : 0.023 s
% 8.63/2.60 # System time : 0.004 s
% 8.63/2.60 # Total time : 0.027 s
% 8.63/2.60 # Maximum resident set size: 7124 pages
% 8.63/2.60
%------------------------------------------------------------------------------