TSTP Solution File: NUM331+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : NUM331+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n007.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:00:05 EDT 2022
% Result : Theorem 31.81s 4.41s
% Output : Proof 31.81s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
sum(n6,n7,sK0),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',communative_sum_n6_n7)]) ).
cnf(g1,plain,
sum(n7,n6,sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',communative_sum_n6_n7)]) ).
cnf(g2,plain,
~ sPE(sK0,sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',communative_sum_n6_n7)]) ).
cnf(g3,plain,
( ~ sum(n7,n6,sK0)
| ~ sum(n7,n6,sK1)
| sPE(sK0,sK1) ),
inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',unique_sum)]) ).
cnf(g4,plain,
rdn_translate(n7,rdn_pos(rdnn(n7))),
inference(ground_cnf,[],[file('Axioms/NUM005+0.ax',rdn7)]) ).
cnf(g5,plain,
rdn_translate(n6,rdn_pos(rdnn(n6))),
inference(ground_cnf,[],[file('Axioms/NUM005+0.ax',rdn6)]) ).
cnf(g6,plain,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
inference(ground_cnf,[],[file('Axioms/NUM005+0.ax',rdn13)]) ).
cnf(g7,plain,
rdn_digit_add(rdnn(n7),rdnn(n6),rdnn(n3),rdnn(n1)),
inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',rdn_digit_add_n7_n6_n3_n1)]) ).
cnf(g8,plain,
( ~ sum(n6,n7,n13)
| ~ sum(n6,n7,sK0)
| sPE(n13,sK0) ),
inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',unique_sum)]) ).
cnf(g9,plain,
rdn_digit_add(rdnn(n6),rdnn(n7),rdnn(n3),rdnn(n1)),
inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',rdn_digit_add_n6_n7_n3_n1)]) ).
cnf(g10,plain,
( ~ rdn_translate(n6,rdn_pos(rdnn(n6)))
| ~ rdn_translate(n7,rdn_pos(rdnn(n7)))
| ~ rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1))))
| ~ rdn_add_with_carry(rdnn(n0),rdnn(n6),rdnn(n7),rdn(rdnn(n3),rdnn(n1)))
| sum(n6,n7,n13) ),
inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',sum_entry_point_pos_pos)]) ).
cnf(g11,plain,
rdn_digit_add(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0)),
inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',rdn_digit_add_n1_n0_n1_n0)]) ).
cnf(g12,plain,
rdn_digit_add(rdnn(n3),rdnn(n0),rdnn(n3),rdnn(n0)),
inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',rdn_digit_add_n3_n0_n3_n0)]) ).
cnf(g13,plain,
( ~ rdn_digit_add(rdnn(n7),rdnn(n6),rdnn(n3),rdnn(n1))
| ~ rdn_digit_add(rdnn(n3),rdnn(n0),rdnn(n3),rdnn(n0))
| ~ rdn_digit_add(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0))
| rdn_add_with_carry(rdnn(n0),rdnn(n7),rdnn(n6),rdn(rdnn(n3),rdnn(n1))) ),
inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',add_digit_digit_rdn)]) ).
cnf(g14,plain,
sPE(rdn_pos(rdn(rdnn(n3),rdnn(n1))),rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ rdn_translate(n7,rdn_pos(rdnn(n7)))
| ~ rdn_translate(n6,rdn_pos(rdnn(n6)))
| ~ rdn_translate(sK0,rdn_pos(rdn(rdnn(n3),rdnn(n1))))
| ~ rdn_add_with_carry(rdnn(n0),rdnn(n7),rdnn(n6),rdn(rdnn(n3),rdnn(n1)))
| sum(n7,n6,sK0) ),
inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',sum_entry_point_pos_pos)]) ).
cnf(g16,plain,
( ~ rdn_digit_add(rdnn(n6),rdnn(n7),rdnn(n3),rdnn(n1))
| ~ rdn_digit_add(rdnn(n3),rdnn(n0),rdnn(n3),rdnn(n0))
| ~ rdn_digit_add(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0))
| rdn_add_with_carry(rdnn(n0),rdnn(n6),rdnn(n7),rdn(rdnn(n3),rdnn(n1))) ),
inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',add_digit_digit_rdn)]) ).
cnf(g17,plain,
( ~ sPE(n13,sK0)
| ~ sPE(rdn_pos(rdn(rdnn(n3),rdnn(n1))),rdn_pos(rdn(rdnn(n3),rdnn(n1))))
| ~ rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1))))
| rdn_translate(sK0,rdn_pos(rdn(rdnn(n3),rdnn(n1)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM331+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.14 % Command : satcop --statistics %s
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jul 6 04:32:13 EDT 2022
% 0.13/0.35 % CPUTime :
% 31.81/4.41 % symbols: 274
% 31.81/4.41 % clauses: 426
% 31.81/4.41 % start clauses: 3
% 31.81/4.41 % iterative deepening steps: 10911
% 31.81/4.41 % maximum path limit: 4
% 31.81/4.41 % literal attempts: 14074198
% 31.81/4.41 % depth failures: 9404820
% 31.81/4.41 % regularity failures: 620947
% 31.81/4.41 % tautology failures: 1038504
% 31.81/4.41 % reductions: 841009
% 31.81/4.41 % extensions: 13201276
% 31.81/4.41 % SAT variables: 269470
% 31.81/4.41 % SAT clauses: 542482
% 31.81/4.41 % WalkSAT solutions: 542481
% 31.81/4.41 % CDCL solutions: 0
% 31.81/4.41 % SZS status Theorem for theBenchmark
% 31.81/4.41 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------