TSTP Solution File: SCT138+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SCT138+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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 : Mon Jul 18 21:16:32 EDT 2022
% Result : Theorem 7.48s 2.70s
% Output : CNFRefutation 7.48s
% 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_584,plain,
hAPP(hAPP(c_List_Olist_OCons(X1),X2),X3) != X3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-85e2qdck/lgb.p',i_0_584) ).
cnf(i_0_816,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-85e2qdck/lgb.p',i_0_816) ).
cnf(i_0_814,plain,
hAPP(c_COMBI(X1),X2) = X2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-85e2qdck/lgb.p',i_0_814) ).
cnf(c_0_820,plain,
hAPP(hAPP(c_List_Olist_OCons(X1),X2),X3) != X3,
i_0_584 ).
cnf(c_0_821,plain,
hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),hAPP(X5,X6)),
i_0_816 ).
cnf(c_0_822,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_820,c_0_821]) ).
cnf(c_0_823,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_822,c_0_821]) ).
cnf(c_0_824,plain,
hAPP(c_COMBI(X1),X2) = X2,
i_0_814 ).
cnf(c_0_825,plain,
hAPP(hAPP(hAPP(c_COMBS(X1,X2,X3),hAPP(c_COMBS(X4,X5,X6),c_List_Olist_OCons(X7))),c_COMBI(X8)),X9) != hAPP(X9,X9),
inference(spm,[status(thm)],[c_0_823,c_0_824]) ).
cnf(c_0_826,plain,
$false,
inference(er,[status(thm)],[c_0_825]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SCT138+1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n013.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 : Sat Jul 2 06:20:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.48/2.70 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.48/2.70 # No SInE strategy applied
% 7.48/2.70 # Trying AutoSched0 for 150 seconds
% 7.48/2.70 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.48/2.70 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.48/2.70 #
% 7.48/2.70 # Preprocessing time : 0.023 s
% 7.48/2.70 # Presaturation interreduction done
% 7.48/2.70
% 7.48/2.70 # Proof found!
% 7.48/2.70 # SZS status Theorem
% 7.48/2.70 # SZS output start CNFRefutation
% See solution above
% 7.48/2.70 # Training examples: 0 positive, 0 negative
% 7.48/2.70
% 7.48/2.70 # -------------------------------------------------
% 7.48/2.70 # User time : 0.108 s
% 7.48/2.70 # System time : 0.010 s
% 7.48/2.70 # Total time : 0.117 s
% 7.48/2.70 # Maximum resident set size: 7204 pages
% 7.48/2.70
%------------------------------------------------------------------------------