↑ Up

SATCoP---0.1.UNS-Prf.s

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

% Computer : n032.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 : Thu Jul 14 17:59:27 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ sPE(c_Polynomial_Opoly(v_pa____,v_x____,tc_Complex_Ocomplex),c_Polynomial_Opoly(v_q____,c_HOL_Ominus__class_Ominus(v_x____,v_c____,tc_Complex_Ocomplex),tc_Complex_Ocomplex)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0)]) ).

cnf(g1,plain,
    ( ~ sPE(c_Polynomial_Opoly(v_q____,c_HOL_Ominus__class_Ominus(v_x____,v_c____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_Polynomial_Opoly(v_pa____,v_x____,tc_Complex_Ocomplex))
    | sPE(c_Polynomial_Opoly(v_pa____,v_x____,tc_Complex_Ocomplex),c_Polynomial_Opoly(v_q____,c_HOL_Ominus__class_Ominus(v_x____,v_c____,tc_Complex_Ocomplex),tc_Complex_Ocomplex)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g2,plain,
    sPE(c_Polynomial_Opoly(v_q____,c_HOL_Ominus__class_Ominus(v_x____,v_c____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_Polynomial_Opoly(v_pa____,v_x____,tc_Complex_Ocomplex)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_th_0)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : ALG396-1 : TPTP v8.1.0. Released v4.1.0.
% 0.09/0.10  % Command  : satcop --statistics %s
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 600
% 0.09/0.28  % DateTime : Tue Jun  7 22:06:21 EDT 2022
% 0.09/0.28  % CPUTime  : 
% 0.09/0.30  % symbols: 91
% 0.09/0.30  % clauses: 958
% 0.09/0.30  % start clauses: 1
% 0.09/0.30  % iterative deepening steps: 23
% 0.09/0.30  % maximum path limit: 2
% 0.09/0.30  % literal attempts: 1184
% 0.09/0.30  % depth failures: 1114
% 0.09/0.30  % regularity failures: 3
% 0.09/0.30  % tautology failures: 7
% 0.09/0.30  % reductions: 11
% 0.09/0.30  % extensions: 1162
% 0.09/0.30  % SAT variables: 798
% 0.09/0.30  % SAT clauses: 721
% 0.09/0.30  % WalkSAT solutions: 718
% 0.09/0.30  % CDCL solutions: 0
% 0.09/0.30  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.30  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------