TSTP Solution File: SWW371+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWW371+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:02:07 EDT 2022
% Result : Theorem 13.50s 4.08s
% Output : CNFRefutation 13.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 11 unt; 0 nHn; 7 RR)
% Number of literals : 15 ( 10 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 50 ( 28 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_982,plain,
( X1 != hAPP(hAPP(c_List_Olist_OCons(X2),X3),X4)
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat),hAPP(c_Nat_Osize__class_Osize(tc_List_Olist(X2)),X1)),hAPP(c_Nat_Osize__class_Osize(tc_List_Olist(X2)),X4))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wwc6gt91/lgb.p',i_0_982) ).
cnf(i_0_1384,plain,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat),X1),X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wwc6gt91/lgb.p',i_0_1384) ).
cnf(i_0_3223,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-wwc6gt91/lgb.p',i_0_3223) ).
cnf(i_0_2121,plain,
hAPP(c_Int_Onumber__class_Onumber__of(tc_Int_Oint),X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wwc6gt91/lgb.p',i_0_2121) ).
cnf(c_0_3228,plain,
( X1 != hAPP(hAPP(c_List_Olist_OCons(X2),X3),X4)
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat),hAPP(c_Nat_Osize__class_Osize(tc_List_Olist(X2)),X1)),hAPP(c_Nat_Osize__class_Osize(tc_List_Olist(X2)),X4))) ),
i_0_982 ).
cnf(c_0_3229,plain,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_Nat_Onat),X1),X1)),
i_0_1384 ).
cnf(c_0_3230,plain,
hAPP(hAPP(c_List_Olist_OCons(X1),X2),X3) != X3,
inference(spm,[status(thm)],[c_0_3228,c_0_3229]) ).
cnf(c_0_3231,plain,
hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),hAPP(X5,X6)),
i_0_3223 ).
cnf(c_0_3232,plain,
hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),c_List_Olist_OCons(X4)),X5),X6) != hAPP(X5,X6),
inference(spm,[status(thm)],[c_0_3230,c_0_3231]) ).
cnf(c_0_3233,plain,
hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),hAPP(c_COMBS(X4,X5,X6),c_List_Olist_OCons(X7))),X8),X9) != hAPP(X9,hAPP(X8,X9)),
inference(spm,[status(thm)],[c_0_3232,c_0_3231]) ).
cnf(c_0_3234,plain,
hAPP(c_Int_Onumber__class_Onumber__of(tc_Int_Oint),X1) = X1,
i_0_2121 ).
cnf(c_0_3235,plain,
hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),hAPP(c_COMBS(X4,X5,X6),c_List_Olist_OCons(X7))),c_Int_Onumber__class_Onumber__of(tc_Int_Oint)),X8) != hAPP(X8,X8),
inference(spm,[status(thm)],[c_0_3233,c_0_3234]) ).
cnf(c_0_3236,plain,
$false,
inference(er,[status(thm)],[c_0_3235]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWW371+1 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 5 01:26:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.47 # ENIGMATIC: Selected SinE mode:
% 0.51/0.70 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.70 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.51/0.70 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.51/0.70 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.50/4.08 # ENIGMATIC: Solved by autoschedule-lgb:
% 13.50/4.08 # No SInE strategy applied
% 13.50/4.08 # Trying AutoSched0 for 150 seconds
% 13.50/4.08 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 13.50/4.08 # and selection function SelectMaxLComplexAvoidPosPred.
% 13.50/4.08 #
% 13.50/4.08 # Preprocessing time : 0.041 s
% 13.50/4.08
% 13.50/4.08 # Proof found!
% 13.50/4.08 # SZS status Theorem
% 13.50/4.08 # SZS output start CNFRefutation
% See solution above
% 13.50/4.08 # Training examples: 0 positive, 0 negative
% 13.50/4.08
% 13.50/4.08 # -------------------------------------------------
% 13.50/4.08 # User time : 0.051 s
% 13.50/4.08 # System time : 0.008 s
% 13.50/4.08 # Total time : 0.059 s
% 13.50/4.08 # Maximum resident set size: 9616 pages
% 13.50/4.08
%------------------------------------------------------------------------------