TSTP Solution File: CSR101+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR101+3 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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 : Fri Jul 15 02:47:56 EDT 2022
% Result : Theorem 12.18s 4.97s
% Output : CNFRefutation 12.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 14 unt; 0 nHn; 27 RR)
% Number of literals : 56 ( 7 equ; 31 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 24 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_938,plain,
( s__subclass(X1,X2)
| ~ s__subclass(X1,X3)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X3,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-40sx_ega/lgb.p',i_0_938) ).
cnf(i_0_671,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-40sx_ega/lgb.p',i_0_671) ).
cnf(i_0_670,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-40sx_ega/lgb.p',i_0_670) ).
cnf(i_0_916,plain,
( X1 = X2
| ~ s__subclass(X2,X1)
| ~ s__subclass(X1,X2)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__instance(X1,s__SetOrClass) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-40sx_ega/lgb.p',i_0_916) ).
cnf(i_0_3280,plain,
s__subclass(s__Class32_1,s__Class32_2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-40sx_ega/lgb.p',i_0_3280) ).
cnf(i_0_3281,plain,
s__subclass(s__Class32_2,s__Class32_3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-40sx_ega/lgb.p',i_0_3281) ).
cnf(i_0_3282,plain,
s__subclass(s__Class32_3,s__Class32_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-40sx_ega/lgb.p',i_0_3282) ).
cnf(i_0_3283,negated_conjecture,
~ s__instance(esk221_0,s__Class32_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-40sx_ega/lgb.p',i_0_3283) ).
cnf(i_0_3284,negated_conjecture,
s__instance(esk221_0,s__Class32_2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-40sx_ega/lgb.p',i_0_3284) ).
cnf(c_0_3294,plain,
( s__subclass(X1,X2)
| ~ s__subclass(X1,X3)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X3,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass) ),
i_0_938 ).
cnf(c_0_3295,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
i_0_671 ).
cnf(c_0_3296,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
i_0_670 ).
cnf(c_0_3297,plain,
( X1 = X2
| ~ s__subclass(X2,X1)
| ~ s__subclass(X1,X2)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__instance(X1,s__SetOrClass) ),
i_0_916 ).
cnf(c_0_3298,plain,
( s__subclass(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__subclass(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_3294,c_0_3295]),c_0_3296]),c_0_3295]) ).
cnf(c_0_3299,plain,
s__subclass(s__Class32_1,s__Class32_2),
i_0_3280 ).
cnf(c_0_3300,plain,
( X1 = X2
| ~ s__subclass(X2,X1)
| ~ s__subclass(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_3297,c_0_3295]),c_0_3295]) ).
cnf(c_0_3301,plain,
s__subclass(s__Class32_2,s__Class32_3),
i_0_3281 ).
cnf(c_0_3302,plain,
( s__subclass(X1,s__Class32_2)
| ~ s__subclass(X1,s__Class32_1) ),
inference(spm,[status(thm)],[c_0_3298,c_0_3299]) ).
cnf(c_0_3303,plain,
s__subclass(s__Class32_3,s__Class32_1),
i_0_3282 ).
cnf(c_0_3304,plain,
( s__Class32_3 = s__Class32_2
| ~ s__subclass(s__Class32_3,s__Class32_2) ),
inference(spm,[status(thm)],[c_0_3300,c_0_3301]) ).
cnf(c_0_3305,plain,
s__subclass(s__Class32_3,s__Class32_2),
inference(spm,[status(thm)],[c_0_3302,c_0_3303]) ).
cnf(c_0_3306,plain,
( s__Class32_3 = s__Class32_1
| ~ s__subclass(s__Class32_1,s__Class32_3) ),
inference(spm,[status(thm)],[c_0_3300,c_0_3303]) ).
cnf(c_0_3307,plain,
s__Class32_3 = s__Class32_2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3304,c_0_3305])]) ).
cnf(c_0_3308,negated_conjecture,
~ s__instance(esk221_0,s__Class32_1),
i_0_3283 ).
cnf(c_0_3309,plain,
s__Class32_1 = s__Class32_2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3306,c_0_3307]),c_0_3307]),c_0_3299])]) ).
cnf(c_0_3310,negated_conjecture,
s__instance(esk221_0,s__Class32_2),
i_0_3284 ).
cnf(c_0_3311,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3308,c_0_3309]),c_0_3310])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR101+3 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 22:40:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 1.79/2.03 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.79/2.03 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 1.79/2.03 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 1.79/2.03 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 12.18/4.97 # ENIGMATIC: Solved by autoschedule-lgb:
% 12.18/4.97 # SinE strategy is gf600_h_gu_R05_F100_L20000
% 12.18/4.97 # Trying AutoSched0 for 149 seconds
% 12.18/4.97 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_AE_CS_SP_PI_S2k
% 12.18/4.97 # and selection function SelectCQArNTEqFirst.
% 12.18/4.97 #
% 12.18/4.97 # Preprocessing time : 0.026 s
% 12.18/4.97
% 12.18/4.97 # Proof found!
% 12.18/4.97 # SZS status Theorem
% 12.18/4.97 # SZS output start CNFRefutation
% See solution above
% 12.18/4.97 # Training examples: 0 positive, 0 negative
% 12.18/4.97
% 12.18/4.97 # -------------------------------------------------
% 12.18/4.97 # User time : 0.221 s
% 12.18/4.97 # System time : 0.020 s
% 12.18/4.97 # Total time : 0.241 s
% 12.18/4.97 # Maximum resident set size: 7124 pages
% 12.18/4.97
%------------------------------------------------------------------------------