TSTP Solution File: RNG006-3 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : RNG006-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n028.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 20:40:10 EDT 2022

% Result   : Unsatisfiable 7.95s 1.36s
% Output   : Proof 7.95s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ product(a,bS_Ic,aPb_S_IaPc),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_times_bS_Ic_is_aPb_S__IaPc)]) ).

cnf(g1,plain,
    sum(aPb,additive_inverse(aPc),aPb_S_IaPc),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',aPb_plus_IaPc)]) ).

cnf(g2,plain,
    sPE(bS_Ic,bS_Ic),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    product(a,bS_Ic,multiply(a,bS_Ic)),
    inference(ground_cnf,[],[file('Axioms/RNG001-0.ax',closure_of_multiplication)]) ).

cnf(g4,plain,
    product(a,b,aPb),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_b)]) ).

cnf(g5,plain,
    sPE(a,a),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    product(a,c,aPc),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_c)]) ).

cnf(g7,plain,
    sum(b,additive_inverse(c),bS_Ic),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_plus_inverse_c)]) ).

cnf(g8,plain,
    ( ~ sPE(a,a)
    | ~ sPE(bS_Ic,bS_Ic)
    | ~ sPE(multiply(a,bS_Ic),aPb_S_IaPc)
    | ~ product(a,bS_Ic,multiply(a,bS_Ic))
    | product(a,bS_Ic,aPb_S_IaPc) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    sum(aPc,additive_inverse(aPc),additive_identity),
    inference(ground_cnf,[],[file('Axioms/RNG001-0.ax',right_inverse)]) ).

cnf(g10,plain,
    ( ~ sum(bS_Ic,c,b)
    | sum(c,bS_Ic,b) ),
    inference(ground_cnf,[],[file('Axioms/RNG001-0.ax',commutativity_of_addition)]) ).

cnf(g11,plain,
    sum(additive_inverse(c),c,additive_identity),
    inference(ground_cnf,[],[file('Axioms/RNG001-0.ax',left_inverse)]) ).

cnf(g12,plain,
    sum(b,additive_identity,b),
    inference(ground_cnf,[],[file('Axioms/RNG001-0.ax',additive_identity2)]) ).

cnf(g13,plain,
    sum(additive_identity,multiply(a,bS_Ic),multiply(a,bS_Ic)),
    inference(ground_cnf,[],[file('Axioms/RNG001-0.ax',additive_identity1)]) ).

cnf(g14,plain,
    ( ~ sum(additive_identity,multiply(a,bS_Ic),multiply(a,bS_Ic))
    | ~ sum(additive_identity,multiply(a,bS_Ic),aPb_S_IaPc)
    | sPE(multiply(a,bS_Ic),aPb_S_IaPc) ),
    inference(ground_cnf,[],[file('Axioms/RNG001-0.ax',addition_is_well_defined)]) ).

cnf(g15,plain,
    ( ~ sum(multiply(a,bS_Ic),additive_identity,aPb_S_IaPc)
    | sum(additive_identity,multiply(a,bS_Ic),aPb_S_IaPc) ),
    inference(ground_cnf,[],[file('Axioms/RNG001-0.ax',commutativity_of_addition)]) ).

cnf(g16,plain,
    ( ~ sum(aPc,multiply(a,bS_Ic),aPb)
    | sum(multiply(a,bS_Ic),aPc,aPb) ),
    inference(ground_cnf,[],[file('Axioms/RNG001-0.ax',commutativity_of_addition)]) ).

cnf(g17,plain,
    ( ~ sum(multiply(a,bS_Ic),aPc,aPb)
    | ~ sum(aPc,additive_inverse(aPc),additive_identity)
    | ~ sum(aPb,additive_inverse(aPc),aPb_S_IaPc)
    | sum(multiply(a,bS_Ic),additive_identity,aPb_S_IaPc) ),
    inference(ground_cnf,[],[file('Axioms/RNG001-0.ax',associativity_of_addition1)]) ).

cnf(g18,plain,
    ( ~ sum(b,additive_inverse(c),bS_Ic)
    | ~ sum(b,additive_identity,b)
    | ~ sum(additive_inverse(c),c,additive_identity)
    | sum(bS_Ic,c,b) ),
    inference(ground_cnf,[],[file('Axioms/RNG001-0.ax',associativity_of_addition2)]) ).

cnf(g19,plain,
    ( ~ sum(c,bS_Ic,b)
    | ~ product(a,c,aPc)
    | ~ product(a,bS_Ic,multiply(a,bS_Ic))
    | ~ product(a,b,aPb)
    | sum(aPc,multiply(a,bS_Ic),aPb) ),
    inference(ground_cnf,[],[file('Axioms/RNG001-0.ax',distributivity1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : RNG006-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n028.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon May 30 19:07:05 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 7.95/1.36  % symbols: 15
% 7.95/1.36  % clauses: 30
% 7.95/1.36  % start clauses: 1
% 7.95/1.36  % iterative deepening steps: 5793
% 7.95/1.36  % maximum path limit: 4
% 7.95/1.36  % literal attempts: 2330067
% 7.95/1.36  % depth failures: 1671733
% 7.95/1.36  % regularity failures: 17975
% 7.95/1.36  % tautology failures: 29143
% 7.95/1.36  % reductions: 0
% 7.95/1.36  % extensions: 2324313
% 7.95/1.36  % SAT variables: 176901
% 7.95/1.36  % SAT clauses: 477082
% 7.95/1.36  % WalkSAT solutions: 477081
% 7.95/1.36  % CDCL solutions: 0
% 7.95/1.36  % SZS status Unsatisfiable for theBenchmark
% 7.95/1.36  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------