TSTP Solution File: NUM345+1 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : NUM345+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n006.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:09 EDT 2022

% Result   : Theorem 12.54s 1.92s
% Output   : Proof 12.54s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    sum(n2,n3,sK0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_n2_n3_less_n6)]) ).

cnf(g1,plain,
    ~ less(sK0,n6),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_n2_n3_less_n6)]) ).

cnf(g2,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    inference(ground_cnf,[],[file('Axioms/NUM005+0.ax',rdn2)]) ).

cnf(g3,plain,
    sPE(n6,n6),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    rdn_translate(n6,rdn_pos(rdnn(n6))),
    inference(ground_cnf,[],[file('Axioms/NUM005+0.ax',rdn6)]) ).

cnf(g5,plain,
    rdn_positive_less(rdnn(n5),rdnn(n6)),
    inference(ground_cnf,[],[file('Axioms/NUM005+1.ax',rdn_positive_less56)]) ).

cnf(g6,plain,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    inference(ground_cnf,[],[file('Axioms/NUM005+0.ax',rdn3)]) ).

cnf(g7,plain,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    inference(ground_cnf,[],[file('Axioms/NUM005+0.ax',rdn5)]) ).

cnf(g8,plain,
    ( ~ sPE(sK0,n5)
    | sPE(n5,sK0) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    ( ~ sPE(n5,sK0)
    | ~ sPE(n6,n6)
    | ~ less(n5,n6)
    | less(sK0,n6) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ rdn_translate(n5,rdn_pos(rdnn(n5)))
    | ~ rdn_translate(n6,rdn_pos(rdnn(n6)))
    | ~ rdn_positive_less(rdnn(n5),rdnn(n6))
    | less(n5,n6) ),
    inference(ground_cnf,[],[file('Axioms/NUM005+1.ax',less_entry_point_pos_pos)]) ).

cnf(g11,plain,
    rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
    inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',rdn_digit_add_n2_n3_n5_n0)]) ).

cnf(g12,plain,
    rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
    inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',rdn_digit_add_n5_n0_n5_n0)]) ).

cnf(g13,plain,
    ( ~ rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0))
    | ~ rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0))
    | rdn_add_with_carry(rdnn(n0),rdnn(n2),rdnn(n3),rdnn(n5)) ),
    inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',add_digit_digit_digit)]) ).

cnf(g14,plain,
    ( ~ sum(n2,n3,sK0)
    | ~ sum(n2,n3,n5)
    | sPE(sK0,n5) ),
    inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',unique_sum)]) ).

cnf(g15,plain,
    ( ~ rdn_translate(n2,rdn_pos(rdnn(n2)))
    | ~ rdn_translate(n3,rdn_pos(rdnn(n3)))
    | ~ rdn_translate(n5,rdn_pos(rdnn(n5)))
    | ~ rdn_add_with_carry(rdnn(n0),rdnn(n2),rdnn(n3),rdnn(n5))
    | sum(n2,n3,n5) ),
    inference(ground_cnf,[],[file('Axioms/NUM005+2.ax',sum_entry_point_pos_pos)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : NUM345+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.13  % Command  : satcop --statistics %s
% 0.12/0.34  % Computer : n006.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jul  7 12:41:51 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 12.54/1.92  % symbols: 273
% 12.54/1.92  % clauses: 425
% 12.54/1.92  % start clauses: 2
% 12.54/1.92  % iterative deepening steps: 6014
% 12.54/1.92  % maximum path limit: 4
% 12.54/1.92  % literal attempts: 5710677
% 12.54/1.92  % depth failures: 4059982
% 12.54/1.92  % regularity failures: 223621
% 12.54/1.92  % tautology failures: 382059
% 12.54/1.92  % reductions: 318579
% 12.54/1.92  % extensions: 5380590
% 12.54/1.92  % SAT variables: 196117
% 12.54/1.92  % SAT clauses: 400856
% 12.54/1.92  % WalkSAT solutions: 400853
% 12.54/1.92  % CDCL solutions: 0
% 12.54/1.92  % SZS status Theorem for theBenchmark
% 12.54/1.92  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------