↑ Up

SATCoP---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : NUM015-1 : TPTP v8.1.0. Released v1.0.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 13:58:13 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ( ~ divides(a,a)
    | ~ prime(a) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_has_prime_divisor)]) ).

cnf(g1,plain,
    divides(a,a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',divide_self)]) ).

cnf(g2,plain,
    ( prime(a)
    | less(divisor(a),a) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor2)]) ).

cnf(g3,plain,
    ( divides(divisor(a),a)
    | prime(a) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prime)]) ).

cnf(g4,plain,
    ( prime(a)
    | less(n1,divisor(a)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor1)]) ).

cnf(g5,plain,
    ( ~ less(divisor(a),a)
    | ~ less(n1,divisor(a))
    | prime(factor_of(divisor(a))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',factor1)]) ).

cnf(g6,plain,
    ( ~ less(divisor(a),a)
    | ~ less(n1,divisor(a))
    | divides(factor_of(divisor(a)),divisor(a)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',factor2)]) ).

cnf(g7,plain,
    ( ~ divides(factor_of(divisor(a)),a)
    | ~ prime(factor_of(divisor(a))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_has_prime_divisor)]) ).

cnf(g8,plain,
    ( ~ divides(factor_of(divisor(a)),divisor(a))
    | ~ divides(divisor(a),a)
    | divides(factor_of(divisor(a)),a) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive_divide)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : NUM015-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : satcop --statistics %s
% 0.11/0.33  % Computer : n006.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Wed Jul  6 14:31:06 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.11/0.33  % symbols: 9
% 0.11/0.33  % clauses: 9
% 0.11/0.33  % start clauses: 1
% 0.11/0.33  % iterative deepening steps: 59
% 0.11/0.33  % maximum path limit: 3
% 0.11/0.33  % literal attempts: 502
% 0.11/0.33  % depth failures: 270
% 0.11/0.33  % regularity failures: 0
% 0.11/0.33  % tautology failures: 7
% 0.11/0.33  % reductions: 0
% 0.11/0.33  % extensions: 449
% 0.11/0.33  % SAT variables: 187
% 0.11/0.33  % SAT clauses: 212
% 0.11/0.33  % WalkSAT solutions: 204
% 0.11/0.33  % CDCL solutions: 0
% 0.11/0.33  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.33  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------