TSTP Solution File: NUM924+6 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : NUM924+6 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n012.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 14:05:34 EDT 2022
% Result : Theorem 6.29s 1.12s
% Output : Proof 6.29s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)]) ).
cnf(g1,plain,
sPE(int,int),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
( ~ sPE(int,int)
| ~ sPE(times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)))
| ~ sPE(times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int)),zero_zero(int))
| ~ ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int)))
| ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096)]) ).
cnf(g4,plain,
( ~ comm_semiring_1(int)
| sPE(times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int)),zero_zero(int)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_232_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J)]) ).
cnf(g5,plain,
comm_semiring_1(int),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Ocomm__semiring__1)]) ).
cnf(g6,plain,
( ~ sPE(plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t))
| sPE(times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
sPE(plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_t)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM924+6 : TPTP v8.1.0. Released v5.3.0.
% 0.07/0.13 % Command : satcop --statistics %s
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jul 5 21:29:15 EDT 2022
% 0.14/0.34 % CPUTime :
% 6.29/1.12 % symbols: 75
% 6.29/1.12 % clauses: 911
% 6.29/1.12 % start clauses: 1
% 6.29/1.12 % iterative deepening steps: 916
% 6.29/1.12 % maximum path limit: 3
% 6.29/1.12 % literal attempts: 1079980
% 6.29/1.12 % depth failures: 988749
% 6.29/1.12 % regularity failures: 33872
% 6.29/1.12 % tautology failures: 8986
% 6.29/1.12 % reductions: 21072
% 6.29/1.12 % extensions: 1058763
% 6.29/1.12 % SAT variables: 163879
% 6.29/1.12 % SAT clauses: 178634
% 6.29/1.12 % WalkSAT solutions: 178624
% 6.29/1.12 % CDCL solutions: 8
% 6.29/1.12 % SZS status Theorem for theBenchmark
% 6.29/1.12 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------