%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : NUM925+5 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n023.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:38 EDT 2022
% Result : Theorem 10.45s 1.64s
% Output : Proof 10.45s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
sPE(power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(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(power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit1(pls)))),zero_zero(int))
| ~ power(int)
| ~ mult_zero(int)
| ~ no_zero_divisors(int)
| ~ zero_neq_one(int)
| sPE(ti(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),zero_zero(int)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_86_power__eq__0__iff__number__of)]) ).
cnf(g2,plain,
mult_zero(int),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Omult__zero)]) ).
cnf(g3,plain,
power(int),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Power_Opower)]) ).
cnf(g4,plain,
no_zero_divisors(int),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Ono__zero__divisors)]) ).
cnf(g5,plain,
zero_neq_one(int),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Ozero__neq__one)]) ).
cnf(g6,plain,
sPE(int,int),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
~ ord_less(int,pls,zero_zero(int)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_57_bin__less__0__simps_I1_J)]) ).
cnf(g8,plain,
linordered_idom(int),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Olinordered__idom)]) ).
cnf(g9,plain,
sPE(pls,zero_zero(int)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_73_Pls__def)]) ).
cnf(g10,plain,
ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_n1pos)]) ).
cnf(g11,plain,
( ~ sPE(pls,zero_zero(int))
| sPE(zero_zero(int),pls) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(int,int)
| ~ sPE(zero_zero(int),pls)
| ~ sPE(ti(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),zero_zero(int))
| ~ ord_less(int,zero_zero(int),ti(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n))))
| ord_less(int,pls,zero_zero(int)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ linordered_idom(int)
| ~ ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n)))
| ord_less(int,zero_zero(int),ti(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_c_Orderings_Oord__class_Oless_0_arg2)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM925+5 : TPTP v8.1.0. Released v5.3.0.
% 0.10/0.12 % Command : satcop --statistics %s
% 0.11/0.31 % Computer : n023.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Wed Jul 6 17:38:26 EDT 2022
% 0.11/0.31 % CPUTime :
% 10.45/1.64 % symbols: 31
% 10.45/1.64 % clauses: 225
% 10.45/1.64 % start clauses: 1
% 10.45/1.64 % iterative deepening steps: 1956
% 10.45/1.64 % maximum path limit: 4
% 10.45/1.64 % literal attempts: 1786363
% 10.45/1.64 % depth failures: 1631747
% 10.45/1.64 % regularity failures: 27959
% 10.45/1.64 % tautology failures: 9458
% 10.45/1.64 % reductions: 30729
% 10.45/1.64 % extensions: 1755547
% 10.45/1.64 % SAT variables: 456908
% 10.45/1.64 % SAT clauses: 459858
% 10.45/1.64 % WalkSAT solutions: 459850
% 10.45/1.64 % CDCL solutions: 6
% 10.45/1.64 % SZS status Theorem for theBenchmark
% 10.45/1.64 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------