TSTP Solution File: NUM925+3 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : NUM925+3 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n021.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:37 EDT 2022
% Result : Theorem 222.74s 28.38s
% Output : Proof 223.51s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
sPE(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))),zero_zero_int),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)]) ).
cnf(g1,plain,
( ~ sPE(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))),zero_zero_int)
| ~ is_int(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))))
| is_int(zero_zero_int) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
( ~ sPE(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))),zero_zero_int)
| sPE(zero_zero_int,hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
is_int(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',gsy_c_hAPP_000tc__Nat__Onat_000tc__Int__Oint)]) ).
cnf(g4,plain,
( ~ sPE(zero_zero_int,hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))))
| ~ is_int(zero_zero_int)
| ~ is_int(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))))
| ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_718_zless__le)]) ).
cnf(g5,plain,
( ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))))
| hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_266_zero__less__power)]) ).
cnf(g6,plain,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_n1pos)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : NUM925+3 : TPTP v8.1.0. Released v5.3.0.
% 0.09/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n021.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 : Tue Jul 5 11:35:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 222.74/28.38 % symbols: 134
% 222.74/28.38 % clauses: 1862
% 222.74/28.38 % start clauses: 1
% 222.74/28.38 % iterative deepening steps: 2782
% 222.74/28.38 % maximum path limit: 3
% 222.74/28.38 % literal attempts: 9047017
% 222.74/28.38 % depth failures: 8868012
% 222.74/28.38 % regularity failures: 65875
% 222.74/28.38 % tautology failures: 25068
% 222.74/28.38 % reductions: 43397
% 222.74/28.38 % extensions: 9003597
% 222.74/28.38 % SAT variables: 3869515
% 222.74/28.38 % SAT clauses: 3698217
% 222.74/28.38 % WalkSAT solutions: 3697738
% 222.74/28.38 % CDCL solutions: 470
% 222.74/28.38 % SZS status Theorem for theBenchmark
% 222.74/28.38 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------