TSTP Solution File: ALG226+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG226+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 : Thu Jul 14 15:33:09 EDT 2022
% Result : Theorem 6.38s 3.65s
% Output : CNFRefutation 6.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 26 ( 21 unt; 2 nHn; 26 RR)
% Number of literals : 39 ( 11 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4008,negated_conjecture,
k7_relat_1(esk551_0,k1_closure3(esk549_0,esk551_0)) = k7_relat_1(esk550_0,k1_closure3(esk549_0,esk550_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jqw1q22/lgb.p',i_0_4008) ).
cnf(i_0_4009,negated_conjecture,
k1_closure3(esk549_0,esk551_0) = k1_closure3(esk549_0,esk550_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jqw1q22/lgb.p',i_0_4009) ).
cnf(i_0_3811,plain,
( k1_funct_4(k2_zfmisc_1(X1,k1_tarski(k1_xboole_0)),k7_relat_1(X2,k1_closure3(X1,X2))) = X2
| v1_xboole_0(X1)
| ~ v2_relat_1(X2)
| ~ m1_pboole(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jqw1q22/lgb.p',i_0_3811) ).
cnf(i_0_4013,negated_conjecture,
v2_relat_1(esk550_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jqw1q22/lgb.p',i_0_4013) ).
cnf(i_0_4012,negated_conjecture,
m1_pboole(esk550_0,esk549_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jqw1q22/lgb.p',i_0_4012) ).
cnf(i_0_4014,negated_conjecture,
~ v1_xboole_0(esk549_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jqw1q22/lgb.p',i_0_4014) ).
cnf(i_0_4011,negated_conjecture,
v2_relat_1(esk551_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jqw1q22/lgb.p',i_0_4011) ).
cnf(i_0_4010,negated_conjecture,
m1_pboole(esk551_0,esk549_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jqw1q22/lgb.p',i_0_4010) ).
cnf(i_0_4007,negated_conjecture,
~ r6_pboole(esk549_0,esk550_0,esk551_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jqw1q22/lgb.p',i_0_4007) ).
cnf(i_0_1604,plain,
( r6_pboole(X1,X2,X3)
| X2 != X3
| ~ m1_pboole(X3,X1)
| ~ m1_pboole(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jqw1q22/lgb.p',i_0_1604) ).
cnf(c_0_4025,negated_conjecture,
k7_relat_1(esk551_0,k1_closure3(esk549_0,esk551_0)) = k7_relat_1(esk550_0,k1_closure3(esk549_0,esk550_0)),
i_0_4008 ).
cnf(c_0_4026,negated_conjecture,
k1_closure3(esk549_0,esk551_0) = k1_closure3(esk549_0,esk550_0),
i_0_4009 ).
cnf(c_0_4027,plain,
( k1_funct_4(k2_zfmisc_1(X1,k1_tarski(k1_xboole_0)),k7_relat_1(X2,k1_closure3(X1,X2))) = X2
| v1_xboole_0(X1)
| ~ v2_relat_1(X2)
| ~ m1_pboole(X2,X1) ),
i_0_3811 ).
cnf(c_0_4028,negated_conjecture,
k7_relat_1(esk550_0,k1_closure3(esk549_0,esk551_0)) = k7_relat_1(esk551_0,k1_closure3(esk549_0,esk551_0)),
inference(rw,[status(thm)],[c_0_4025,c_0_4026]) ).
cnf(c_0_4029,negated_conjecture,
v2_relat_1(esk550_0),
i_0_4013 ).
cnf(c_0_4030,negated_conjecture,
m1_pboole(esk550_0,esk549_0),
i_0_4012 ).
cnf(c_0_4031,negated_conjecture,
~ v1_xboole_0(esk549_0),
i_0_4014 ).
cnf(c_0_4032,negated_conjecture,
k1_funct_4(k2_zfmisc_1(esk549_0,k1_tarski(k1_xboole_0)),k7_relat_1(esk551_0,k1_closure3(esk549_0,esk551_0))) = esk550_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4027,c_0_4026]),c_0_4028]),c_0_4029]),c_0_4030])]),c_0_4031]) ).
cnf(c_0_4033,negated_conjecture,
v2_relat_1(esk551_0),
i_0_4011 ).
cnf(c_0_4034,negated_conjecture,
m1_pboole(esk551_0,esk549_0),
i_0_4010 ).
cnf(c_0_4035,negated_conjecture,
~ r6_pboole(esk549_0,esk550_0,esk551_0),
i_0_4007 ).
cnf(c_0_4036,plain,
esk550_0 = esk551_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4027,c_0_4032]),c_0_4033]),c_0_4034])]),c_0_4031]) ).
cnf(c_0_4037,plain,
( r6_pboole(X1,X2,X3)
| X2 != X3
| ~ m1_pboole(X3,X1)
| ~ m1_pboole(X2,X1) ),
i_0_1604 ).
cnf(c_0_4038,negated_conjecture,
~ r6_pboole(esk549_0,esk551_0,esk551_0),
inference(rw,[status(thm)],[c_0_4035,c_0_4036]) ).
cnf(c_0_4039,plain,
( r6_pboole(X1,X2,X2)
| ~ m1_pboole(X2,X1) ),
inference(er,[status(thm)],[c_0_4037]) ).
cnf(c_0_4040,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4038,c_0_4039]),c_0_4034])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : ALG226+2 : TPTP v8.1.0. Released v3.4.0.
% 0.02/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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 : Wed Jun 8 17:59:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected SinE mode:
% 0.39/0.61 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.61 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.39/0.61 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.39/0.61 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.38/3.65 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.38/3.65 # No SInE strategy applied
% 6.38/3.65 # Trying AutoSched0 for 150 seconds
% 6.38/3.65 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y
% 6.38/3.65 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.38/3.65 #
% 6.38/3.65 # Preprocessing time : 0.017 s
% 6.38/3.65
% 6.38/3.65 # Proof found!
% 6.38/3.65 # SZS status Theorem
% 6.38/3.65 # SZS output start CNFRefutation
% See solution above
% 6.38/3.65 # Training examples: 0 positive, 0 negative
% 6.38/3.65
% 6.38/3.65 # -------------------------------------------------
% 6.38/3.65 # User time : 0.035 s
% 6.38/3.65 # System time : 0.006 s
% 6.38/3.65 # Total time : 0.041 s
% 6.38/3.65 # Maximum resident set size: 7128 pages
% 6.38/3.65
%------------------------------------------------------------------------------