TSTP Solution File: NUM584+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM584+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:37 EDT 2022
% Result : Theorem 7.68s 2.30s
% Output : CNFRefutation 7.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 14 unt; 0 nHn; 20 RR)
% Number of literals : 41 ( 9 equ; 23 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_104,plain,
( aElementOf0(X1,X2)
| sbrdtbr0(X1) != X3
| X2 != slbdtsldtrb0(X4,X3)
| ~ aSet0(X4)
| ~ aSubsetOf0(X1,X4)
| ~ aElementOf0(X3,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pq_mwn3g/lgb.p',i_0_104) ).
cnf(i_0_147,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pq_mwn3g/lgb.p',i_0_147) ).
cnf(i_0_15,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pq_mwn3g/lgb.p',i_0_15) ).
cnf(i_0_149,hypothesis,
aSubsetOf0(xS,szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pq_mwn3g/lgb.p',i_0_149) ).
cnf(i_0_45,plain,
aSet0(szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pq_mwn3g/lgb.p',i_0_45) ).
cnf(i_0_174,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pq_mwn3g/lgb.p',i_0_174) ).
cnf(i_0_172,hypothesis,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pq_mwn3g/lgb.p',i_0_172) ).
cnf(i_0_173,hypothesis,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pq_mwn3g/lgb.p',i_0_173) ).
cnf(c_0_183,plain,
( aElementOf0(X1,X2)
| sbrdtbr0(X1) != X3
| X2 != slbdtsldtrb0(X4,X3)
| ~ aSet0(X4)
| ~ aSubsetOf0(X1,X4)
| ~ aElementOf0(X3,szNzAzT0) ),
i_0_104 ).
cnf(c_0_184,hypothesis,
aElementOf0(xK,szNzAzT0),
i_0_147 ).
cnf(c_0_185,hypothesis,
( aElementOf0(X1,X2)
| X2 != slbdtsldtrb0(X3,xK)
| sbrdtbr0(X1) != xK
| ~ aSet0(X3)
| ~ aSubsetOf0(X1,X3) ),
inference(spm,[status(thm)],[c_0_183,c_0_184]) ).
cnf(c_0_186,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
i_0_15 ).
cnf(c_0_187,hypothesis,
aSubsetOf0(xS,szNzAzT0),
i_0_149 ).
cnf(c_0_188,plain,
aSet0(szNzAzT0),
i_0_45 ).
cnf(c_0_189,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
i_0_174 ).
cnf(c_0_190,hypothesis,
( aElementOf0(X1,slbdtsldtrb0(X2,xK))
| sbrdtbr0(X1) != xK
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
inference(er,[status(thm)],[c_0_185]) ).
cnf(c_0_191,hypothesis,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK,
i_0_172 ).
cnf(c_0_192,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_186,c_0_187]),c_0_188])]) ).
cnf(c_0_193,hypothesis,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
i_0_173 ).
cnf(c_0_194,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_189,c_0_190]),c_0_191]),c_0_192]),c_0_193])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM584+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.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 Jul 7 15:32:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 7.68/2.30 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.68/2.30 # No SInE strategy applied
% 7.68/2.30 # Trying AutoSched0 for 150 seconds
% 7.68/2.30 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_RG_S04BN
% 7.68/2.30 # and selection function PSelectComplexExceptUniqMaxHorn.
% 7.68/2.30 #
% 7.68/2.30 # Preprocessing time : 0.025 s
% 7.68/2.30
% 7.68/2.30 # Proof found!
% 7.68/2.30 # SZS status Theorem
% 7.68/2.30 # SZS output start CNFRefutation
% See solution above
% 7.68/2.30 # Training examples: 0 positive, 0 negative
% 7.68/2.30
% 7.68/2.30 # -------------------------------------------------
% 7.68/2.30 # User time : 0.035 s
% 7.68/2.30 # System time : 0.010 s
% 7.68/2.30 # Total time : 0.045 s
% 7.68/2.30 # Maximum resident set size: 7124 pages
% 7.68/2.30
%------------------------------------------------------------------------------