TSTP Solution File: NUM606+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM606+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:50 EDT 2022
% Result : Theorem 7.35s 2.22s
% Output : CNFRefutation 7.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 12 unt; 0 nHn; 19 RR)
% Number of literals : 38 ( 0 equ; 21 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_19,plain,
( aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSet0(X1)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o5cnqezb/lgb.p',i_0_19) ).
cnf(i_0_15,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o5cnqezb/lgb.p',i_0_15) ).
cnf(i_0_149,hypothesis,
aSubsetOf0(xS,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o5cnqezb/lgb.p',i_0_149) ).
cnf(i_0_45,plain,
aSet0(szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o5cnqezb/lgb.p',i_0_45) ).
cnf(i_0_200,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o5cnqezb/lgb.p',i_0_200) ).
cnf(i_0_203,hypothesis,
aSubsetOf0(xQ,xO),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o5cnqezb/lgb.p',i_0_203) ).
cnf(i_0_204,negated_conjecture,
~ aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o5cnqezb/lgb.p',i_0_204) ).
cnf(c_0_212,plain,
( aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSet0(X1)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3) ),
i_0_19 ).
cnf(c_0_213,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
i_0_15 ).
cnf(c_0_214,plain,
( aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_212,c_0_213]),c_0_213]) ).
cnf(c_0_215,hypothesis,
aSubsetOf0(xS,szNzAzT0),
i_0_149 ).
cnf(c_0_216,plain,
aSet0(szNzAzT0),
i_0_45 ).
cnf(c_0_217,hypothesis,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_214,c_0_215]),c_0_216])]) ).
cnf(c_0_218,hypothesis,
aSubsetOf0(xO,xS),
i_0_200 ).
cnf(c_0_219,hypothesis,
aSubsetOf0(xO,szNzAzT0),
inference(spm,[status(thm)],[c_0_217,c_0_218]) ).
cnf(c_0_220,plain,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xO) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_214,c_0_219]),c_0_216])]) ).
cnf(c_0_221,hypothesis,
aSubsetOf0(xQ,xO),
i_0_203 ).
cnf(c_0_222,negated_conjecture,
~ aSubsetOf0(xQ,szNzAzT0),
i_0_204 ).
cnf(c_0_223,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_221]),c_0_222]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUM606+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Wed Jul 6 02:03:24 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.35/2.22 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.35/2.22 # No SInE strategy applied
% 7.35/2.22 # Trying AutoSched0 for 150 seconds
% 7.35/2.22 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.35/2.22 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.35/2.22 #
% 7.35/2.22 # Preprocessing time : 0.025 s
% 7.35/2.22
% 7.35/2.22 # Proof found!
% 7.35/2.22 # SZS status Theorem
% 7.35/2.22 # SZS output start CNFRefutation
% See solution above
% 7.35/2.22 # Training examples: 0 positive, 0 negative
% 7.35/2.22
% 7.35/2.22 # -------------------------------------------------
% 7.35/2.22 # User time : 0.034 s
% 7.35/2.22 # System time : 0.006 s
% 7.35/2.22 # Total time : 0.040 s
% 7.35/2.22 # Maximum resident set size: 7124 pages
% 7.35/2.22
%------------------------------------------------------------------------------