TSTP Solution File: SWW252+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWW252+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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 21 00:01:50 EDT 2022
% Result : Theorem 11.33s 3.22s
% Output : CNFRefutation 11.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 5 RR)
% Number of literals : 12 ( 11 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-4 aty)
% Number of variables : 52 ( 30 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1645,plain,
hAPP(hAPP(c_COMBB(X1,X2,X3,X4),X5),X6) = hAPP(X4,hAPP(X5,X6)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jf97suu_/lgb.p',i_0_1645) ).
cnf(i_0_1648,plain,
hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),hAPP(X5,X6)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jf97suu_/lgb.p',i_0_1648) ).
cnf(i_0_1503,plain,
hAPP(c_Nat_OSuc,X1) != X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jf97suu_/lgb.p',i_0_1503) ).
cnf(i_0_1251,plain,
hAPP(hAPP(c_Groups_Oplus__class_Oplus(tc_Nat_Onat),c_Groups_Ozero__class_Ozero(tc_Nat_Onat)),X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jf97suu_/lgb.p',i_0_1251) ).
cnf(c_0_1653,plain,
hAPP(hAPP(c_COMBB(X1,X2,X3,X4),X5),X6) = hAPP(X4,hAPP(X5,X6)),
i_0_1645 ).
cnf(c_0_1654,plain,
hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),hAPP(X5,X6)),
i_0_1648 ).
cnf(c_0_1655,plain,
hAPP(c_Nat_OSuc,X1) != X1,
i_0_1503 ).
cnf(c_0_1656,plain,
hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),c_COMBB(X4,X5,X6,X7)),X8),X9) = hAPP(X7,hAPP(X9,hAPP(X8,X9))),
inference(spm,[status(thm)],[c_0_1653,c_0_1654]) ).
cnf(c_0_1657,plain,
hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),c_COMBB(X4,X5,X6,c_Nat_OSuc)),X7),X8) != hAPP(X8,hAPP(X7,X8)),
inference(spm,[status(thm)],[c_0_1655,c_0_1656]) ).
cnf(c_0_1658,plain,
hAPP(hAPP(c_Groups_Oplus__class_Oplus(tc_Nat_Onat),c_Groups_Ozero__class_Ozero(tc_Nat_Onat)),X1) = X1,
i_0_1251 ).
cnf(c_0_1659,plain,
hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),c_COMBB(X4,X5,X6,c_Nat_OSuc)),hAPP(c_Groups_Oplus__class_Oplus(tc_Nat_Onat),c_Groups_Ozero__class_Ozero(tc_Nat_Onat))),X7) != hAPP(X7,X7),
inference(spm,[status(thm)],[c_0_1657,c_0_1658]) ).
cnf(c_0_1660,plain,
$false,
inference(er,[status(thm)],[c_0_1659]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW252+1 : TPTP v8.1.0. Released v5.2.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 : Sun Jun 5 13:40:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.47 # ENIGMATIC: Selected SinE mode:
% 0.19/0.54 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.54 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.54 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.54 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.33/3.22 # ENIGMATIC: Solved by autoschedule-lgb:
% 11.33/3.22 # No SInE strategy applied
% 11.33/3.22 # Trying AutoSched0 for 150 seconds
% 11.33/3.22 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SP_PI_S0Y
% 11.33/3.22 # and selection function SelectMaxLComplexAvoidPosPred.
% 11.33/3.22 #
% 11.33/3.22 # Preprocessing time : 0.027 s
% 11.33/3.22
% 11.33/3.22 # Proof found!
% 11.33/3.22 # SZS status Theorem
% 11.33/3.22 # SZS output start CNFRefutation
% See solution above
% 11.33/3.22 # Training examples: 0 positive, 0 negative
% 11.33/3.22
% 11.33/3.22 # -------------------------------------------------
% 11.33/3.22 # User time : 0.060 s
% 11.33/3.22 # System time : 0.007 s
% 11.33/3.22 # Total time : 0.067 s
% 11.33/3.22 # Maximum resident set size: 7440 pages
% 11.33/3.22
%------------------------------------------------------------------------------