TSTP Solution File: SWV104+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV104+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:51 EDT 2022
% Result : Theorem 7.25s 2.56s
% Output : CNFRefutation 7.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 16 unt; 7 nHn; 22 RR)
% Number of literals : 55 ( 48 equ; 25 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-3 aty)
% Number of variables : 27 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_126,negated_conjecture,
( a_select3(u_defuse,n0,n0) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n2,n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wlhsaoi/lgb.p',i_0_126) ).
cnf(i_0_132,negated_conjecture,
a_select3(u_defuse,n0,n0) = use,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wlhsaoi/lgb.p',i_0_132) ).
cnf(i_0_131,negated_conjecture,
a_select3(u_defuse,n1,n0) = use,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wlhsaoi/lgb.p',i_0_131) ).
cnf(i_0_134,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wlhsaoi/lgb.p',i_0_134) ).
cnf(i_0_130,negated_conjecture,
a_select3(u_defuse,n2,n0) = use,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wlhsaoi/lgb.p',i_0_130) ).
cnf(i_0_135,plain,
( X1 = X2
| a_select2(tptp_update2(X3,X1,X4),X2) = X5
| a_select2(X3,X2) != X5 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wlhsaoi/lgb.p',i_0_135) ).
cnf(i_0_29,plain,
gt(n5,n4),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wlhsaoi/lgb.p',i_0_29) ).
cnf(i_0_32,plain,
~ gt(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wlhsaoi/lgb.p',i_0_32) ).
cnf(i_0_23,plain,
gt(n4,n3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wlhsaoi/lgb.p',i_0_23) ).
cnf(c_0_145,negated_conjecture,
( a_select3(u_defuse,n0,n0) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n2,n0) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use ),
i_0_126 ).
cnf(c_0_146,negated_conjecture,
a_select3(u_defuse,n0,n0) = use,
i_0_132 ).
cnf(c_0_147,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n2,n0) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_145,c_0_146])]) ).
cnf(c_0_148,negated_conjecture,
a_select3(u_defuse,n1,n0) = use,
i_0_131 ).
cnf(c_0_149,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
i_0_134 ).
cnf(c_0_150,negated_conjecture,
a_select3(u_defuse,n2,n0) = use,
i_0_130 ).
cnf(c_0_151,plain,
( X1 = X2
| a_select2(tptp_update2(X3,X1,X4),X2) = X5
| a_select2(X3,X2) != X5 ),
i_0_135 ).
cnf(c_0_152,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_147,c_0_148])]),c_0_149]),c_0_150])]) ).
cnf(c_0_153,plain,
( a_select2(tptp_update2(X1,X2,X3),X4) = a_select2(X1,X4)
| X2 = X4 ),
inference(er,[status(thm)],[c_0_151]) ).
cnf(c_0_154,negated_conjecture,
( n5 = n4
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_153]),c_0_149])]) ).
cnf(c_0_155,plain,
( n5 = n3
| n5 = n4
| a_select2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n3) != use ),
inference(spm,[status(thm)],[c_0_154,c_0_153]) ).
cnf(c_0_156,plain,
gt(n5,n4),
i_0_29 ).
cnf(c_0_157,plain,
( n4 = n3
| n5 = n4
| n5 = n3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_153]),c_0_149])]) ).
cnf(c_0_158,plain,
~ gt(X1,X1),
i_0_32 ).
cnf(c_0_159,plain,
( n5 = n3
| n4 = n3 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_157]),c_0_158]) ).
cnf(c_0_160,plain,
( a_select2(tptp_update2(tptp_update2(X1,X2,X3),X4,X5),X2) = X3
| X4 = X2 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_149])]) ).
cnf(c_0_161,plain,
gt(n4,n3),
i_0_23 ).
cnf(c_0_162,negated_conjecture,
n4 = n3,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_159]),c_0_149])]),c_0_160]) ).
cnf(c_0_163,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_161,c_0_162]),c_0_158]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV104+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n006.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 : Wed Jun 15 21:24:43 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.25/2.56 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.25/2.56 # No SInE strategy applied
% 7.25/2.56 # Trying AutoSched0 for 150 seconds
% 7.25/2.56 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 7.25/2.56 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.25/2.56 #
% 7.25/2.56 # Preprocessing time : 0.048 s
% 7.25/2.56
% 7.25/2.56 # Proof found!
% 7.25/2.56 # SZS status Theorem
% 7.25/2.56 # SZS output start CNFRefutation
% See solution above
% 7.25/2.56 # Training examples: 0 positive, 0 negative
% 7.25/2.56
% 7.25/2.56 # -------------------------------------------------
% 7.25/2.56 # User time : 0.052 s
% 7.25/2.56 # System time : 0.009 s
% 7.25/2.56 # Total time : 0.061 s
% 7.25/2.56 # Maximum resident set size: 7128 pages
% 7.25/2.56
%------------------------------------------------------------------------------