%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWW372+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 10.17s 3.67s
% Output : CNFRefutation 10.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 6 RR)
% Number of literals : 10 ( 9 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 0 con; 1-3 aty)
% Number of variables : 46 ( 31 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2193,plain,
hAPP(hAPP(c_List_Olist_OCons(X1),X2),X3) != X3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hjyuh5f4/lgb.p',i_0_2193) ).
cnf(i_0_3339,plain,
hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),hAPP(X5,X6)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hjyuh5f4/lgb.p',i_0_3339) ).
cnf(i_0_302,plain,
hAPP(c_Set_OCollect(X1),X2) = X2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hjyuh5f4/lgb.p',i_0_302) ).
cnf(c_0_3343,plain,
hAPP(hAPP(c_List_Olist_OCons(X1),X2),X3) != X3,
i_0_2193 ).
cnf(c_0_3344,plain,
hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),hAPP(X5,X6)),
i_0_3339 ).
cnf(c_0_3345,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_3343,c_0_3344]) ).
cnf(c_0_3346,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_3345,c_0_3344]) ).
cnf(c_0_3347,plain,
hAPP(c_Set_OCollect(X1),X2) = X2,
i_0_302 ).
cnf(c_0_3348,plain,
hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),hAPP(c_COMBS(X4,X5,X6),c_List_Olist_OCons(X7))),c_Set_OCollect(X8)),X9) != hAPP(X9,X9),
inference(spm,[status(thm)],[c_0_3346,c_0_3347]) ).
cnf(c_0_3349,plain,
$false,
inference(er,[status(thm)],[c_0_3348]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWW372+1 : TPTP v8.1.0. Released v5.2.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n017.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 : Mon Jun 6 03:58:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.48 # ENIGMATIC: Selected SinE mode:
% 0.53/0.72 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.53/0.72 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.53/0.72 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.53/0.72 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.17/3.67 # ENIGMATIC: Solved by autoschedule-lgb:
% 10.17/3.67 # No SInE strategy applied
% 10.17/3.67 # Trying AutoSched0 for 150 seconds
% 10.17/3.67 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 10.17/3.67 # and selection function SelectComplexExceptUniqMaxHorn.
% 10.17/3.67 #
% 10.17/3.67 # Preprocessing time : 0.024 s
% 10.17/3.67 # Presaturation interreduction done
% 10.17/3.67
% 10.17/3.67 # Proof found!
% 10.17/3.67 # SZS status Theorem
% 10.17/3.67 # SZS output start CNFRefutation
% See solution above
% 10.17/3.67 # Training examples: 0 positive, 0 negative
% 10.17/3.67
% 10.17/3.67 # -------------------------------------------------
% 10.17/3.67 # User time : 0.035 s
% 10.17/3.67 # System time : 0.006 s
% 10.17/3.67 # Total time : 0.041 s
% 10.17/3.67 # Maximum resident set size: 9488 pages
% 10.17/3.67
%------------------------------------------------------------------------------