↑ Up

SATCoP---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : FLD025-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n019.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 : Sat Jul 16 02:26:23 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    equalish(a,b),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_equals_b_5)]) ).

cnf(g1,plain,
    equalish(c,d),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_equals_d_6)]) ).

cnf(g2,plain,
    ~ equalish(multiply(a,c),multiply(d,b)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_not_equal_to_multiply_7)]) ).

cnf(g3,plain,
    ( ~ equalish(a,b)
    | ~ defined(c)
    | equalish(multiply(a,c),multiply(b,c)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication)]) ).

cnf(g4,plain,
    defined(c),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined)]) ).

cnf(g5,plain,
    defined(b),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined)]) ).

cnf(g6,plain,
    ( ~ equalish(multiply(a,c),multiply(c,b))
    | ~ equalish(multiply(c,b),multiply(d,b))
    | equalish(multiply(a,c),multiply(d,b)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).

cnf(g7,plain,
    ( ~ equalish(c,d)
    | ~ defined(b)
    | equalish(multiply(c,b),multiply(d,b)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication)]) ).

cnf(g8,plain,
    ( ~ equalish(multiply(a,c),multiply(b,c))
    | ~ equalish(multiply(b,c),multiply(c,b))
    | equalish(multiply(a,c),multiply(c,b)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).

cnf(g9,plain,
    ( ~ defined(b)
    | ~ defined(c)
    | equalish(multiply(b,c),multiply(c,b)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_multiplication)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : FLD025-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n019.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jun  7 01:58:25 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % symbols: 15
% 0.12/0.35  % clauses: 34
% 0.12/0.35  % start clauses: 3
% 0.12/0.35  % iterative deepening steps: 88
% 0.12/0.35  % maximum path limit: 3
% 0.12/0.35  % literal attempts: 11477
% 0.12/0.35  % depth failures: 7917
% 0.12/0.35  % regularity failures: 403
% 0.12/0.35  % tautology failures: 1063
% 0.12/0.35  % reductions: 601
% 0.12/0.35  % extensions: 10675
% 0.12/0.35  % SAT variables: 3182
% 0.12/0.35  % SAT clauses: 4350
% 0.12/0.35  % WalkSAT solutions: 4345
% 0.12/0.35  % CDCL solutions: 0
% 0.12/0.35  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.35  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------