TSTP Solution File: NUM549+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM549+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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 : Mon Jul 18 08:37:14 EDT 2022
% Result : Theorem 8.36s 2.64s
% Output : CNFRefutation 8.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of clauses : 27 ( 15 unt; 3 nHn; 27 RR)
% Number of literals : 43 ( 14 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_146,hypothesis,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,xQ) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4cjxzf2v/lgb.p',i_0_146) ).
cnf(i_0_5,plain,
( X1 = slcrc0
| aElementOf0(esk1_1(X1),X1)
| ~ aSet0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4cjxzf2v/lgb.p',i_0_5) ).
cnf(i_0_150,hypothesis,
aSet0(xQ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4cjxzf2v/lgb.p',i_0_150) ).
cnf(i_0_151,negated_conjecture,
( ~ aElement0(X1)
| ~ aElementOf0(X1,xQ) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4cjxzf2v/lgb.p',i_0_151) ).
cnf(i_0_3,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4cjxzf2v/lgb.p',i_0_3) ).
cnf(i_0_114,hypothesis,
aSet0(xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4cjxzf2v/lgb.p',i_0_114) ).
cnf(i_0_100,plain,
( sbrdtbr0(slbdtrb0(X1)) = X1
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4cjxzf2v/lgb.p',i_0_100) ).
cnf(i_0_46,plain,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4cjxzf2v/lgb.p',i_0_46) ).
cnf(i_0_92,plain,
slbdtrb0(sz00) = slcrc0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4cjxzf2v/lgb.p',i_0_92) ).
cnf(i_0_148,hypothesis,
sbrdtbr0(xQ) = xk,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4cjxzf2v/lgb.p',i_0_148) ).
cnf(i_0_112,hypothesis,
sz00 != xk,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4cjxzf2v/lgb.p',i_0_112) ).
cnf(c_0_163,hypothesis,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,xQ) ),
i_0_146 ).
cnf(c_0_164,plain,
( X1 = slcrc0
| aElementOf0(esk1_1(X1),X1)
| ~ aSet0(X1) ),
i_0_5 ).
cnf(c_0_165,hypothesis,
aSet0(xQ),
i_0_150 ).
cnf(c_0_166,negated_conjecture,
( ~ aElement0(X1)
| ~ aElementOf0(X1,xQ) ),
i_0_151 ).
cnf(c_0_167,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
i_0_3 ).
cnf(c_0_168,hypothesis,
( xQ = slcrc0
| aElementOf0(esk1_1(xQ),xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_164]),c_0_165])]) ).
cnf(c_0_169,hypothesis,
aSet0(xS),
i_0_114 ).
cnf(c_0_170,negated_conjecture,
( xQ = slcrc0
| ~ aElement0(esk1_1(xQ)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_164]),c_0_165])]) ).
cnf(c_0_171,plain,
( sbrdtbr0(slbdtrb0(X1)) = X1
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_100 ).
cnf(c_0_172,plain,
aElementOf0(sz00,szNzAzT0),
i_0_46 ).
cnf(c_0_173,plain,
slbdtrb0(sz00) = slcrc0,
i_0_92 ).
cnf(c_0_174,hypothesis,
sbrdtbr0(xQ) = xk,
i_0_148 ).
cnf(c_0_175,plain,
xQ = slcrc0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_168]),c_0_169])]),c_0_170]) ).
cnf(c_0_176,plain,
sbrdtbr0(slcrc0) = sz00,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_171,c_0_172]),c_0_173]) ).
cnf(c_0_177,hypothesis,
sz00 != xk,
i_0_112 ).
cnf(c_0_178,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_174,c_0_175]),c_0_176]),c_0_177]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM549+3 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n015.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jul 6 00:10:49 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected complete mode:
% 8.36/2.64 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.36/2.64 # No SInE strategy applied
% 8.36/2.64 # Trying AutoSched0 for 150 seconds
% 8.36/2.64 # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 8.36/2.64 # and selection function SelectNewComplexAHPNS.
% 8.36/2.64 #
% 8.36/2.64 # Preprocessing time : 0.023 s
% 8.36/2.64
% 8.36/2.64 # Proof found!
% 8.36/2.64 # SZS status Theorem
% 8.36/2.64 # SZS output start CNFRefutation
% See solution above
% 8.36/2.64 # Training examples: 0 positive, 0 negative
% 8.36/2.64
% 8.36/2.64 # -------------------------------------------------
% 8.36/2.64 # User time : 0.029 s
% 8.36/2.64 # System time : 0.008 s
% 8.36/2.64 # Total time : 0.037 s
% 8.36/2.64 # Maximum resident set size: 7124 pages
% 8.36/2.64
%------------------------------------------------------------------------------