TSTP Solution File: CSR086+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR086+3 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:40 EDT 2022
% Result : Theorem 15.71s 6.02s
% Output : CNFRefutation 15.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 12 unt; 0 nHn; 19 RR)
% Number of literals : 34 ( 0 equ; 18 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 15 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1706,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lbn3iavk/lgb.p',i_0_1706) ).
cnf(i_0_2885,plain,
s__subclass(s__GraphLoop,s__GraphArc),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lbn3iavk/lgb.p',i_0_2885) ).
cnf(i_0_4589,plain,
s__subclass(s__GraphArc,s__Entity),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lbn3iavk/lgb.p',i_0_4589) ).
cnf(i_0_4963,negated_conjecture,
~ s__links(X1,X1,s__Arc13_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lbn3iavk/lgb.p',i_0_4963) ).
cnf(i_0_2888,plain,
( s__links(esk444_1(X1),esk444_1(X1),X1)
| ~ s__instance(X1,s__GraphArc)
| ~ s__instance(X1,s__GraphLoop) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lbn3iavk/lgb.p',i_0_2888) ).
cnf(i_0_4962,plain,
s__instance(s__Arc13_1,s__GraphLoop),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lbn3iavk/lgb.p',i_0_4962) ).
cnf(i_0_1707,plain,
( s__instance(X1,X2)
| ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2)
| ~ s__instance(X3,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lbn3iavk/lgb.p',i_0_1707) ).
cnf(c_0_4971,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
i_0_1706 ).
cnf(c_0_4972,plain,
s__subclass(s__GraphLoop,s__GraphArc),
i_0_2885 ).
cnf(c_0_4973,plain,
s__subclass(s__GraphArc,s__Entity),
i_0_4589 ).
cnf(c_0_4974,negated_conjecture,
~ s__links(X1,X1,s__Arc13_1),
i_0_4963 ).
cnf(c_0_4975,plain,
( s__links(esk444_1(X1),esk444_1(X1),X1)
| ~ s__instance(X1,s__GraphArc)
| ~ s__instance(X1,s__GraphLoop) ),
i_0_2888 ).
cnf(c_0_4976,plain,
s__instance(s__Arc13_1,s__GraphLoop),
i_0_4962 ).
cnf(c_0_4977,plain,
( s__instance(X1,X2)
| ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2)
| ~ s__instance(X3,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass) ),
i_0_1707 ).
cnf(c_0_4978,plain,
s__instance(s__GraphLoop,s__SetOrClass),
inference(pm,[status(thm)],[c_0_4971,c_0_4972]) ).
cnf(c_0_4979,plain,
s__instance(s__GraphArc,s__SetOrClass),
inference(pm,[status(thm)],[c_0_4971,c_0_4973]) ).
cnf(c_0_4980,negated_conjecture,
~ s__instance(s__Arc13_1,s__GraphArc),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_4974,c_0_4975]),c_0_4976])]) ).
cnf(c_0_4981,plain,
( s__instance(X1,s__GraphArc)
| ~ s__instance(X1,s__GraphLoop) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_4977,c_0_4972]),c_0_4978]),c_0_4979])]) ).
cnf(c_0_4982,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_4980,c_0_4981]),c_0_4976])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR086+3 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 11 16:27:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 1.80/1.99 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.80/1.99 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 1.80/1.99 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 1.80/1.99 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 15.71/6.02 # ENIGMATIC: Solved by autoschedule-lgb:
% 15.71/6.02 # SinE strategy is gf600_h_gu_R05_F100_L20000
% 15.71/6.02 # Trying AutoSched0 for 149 seconds
% 15.71/6.02 # AutoSched0-Mode selected heuristic G_E___300_C01_S00
% 15.71/6.02 # and selection function NoSelection.
% 15.71/6.02 #
% 15.71/6.02 # Preprocessing time : 0.043 s
% 15.71/6.02
% 15.71/6.02 # Proof found!
% 15.71/6.02 # SZS status Theorem
% 15.71/6.02 # SZS output start CNFRefutation
% See solution above
% 15.71/6.02 # Training examples: 0 positive, 0 negative
% 15.71/6.02
% 15.71/6.02 # -------------------------------------------------
% 15.71/6.02 # User time : 0.311 s
% 15.71/6.02 # System time : 0.021 s
% 15.71/6.02 # Total time : 0.332 s
% 15.71/6.02 # Maximum resident set size: 7128 pages
% 15.71/6.02
%------------------------------------------------------------------------------