↑ Up

SATCoP---0.1.UNS-Prf.s

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

% Computer : n021.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 : Tue Jul 19 05:04:00 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    v_P(v_a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0)]) ).

cnf(g1,plain,
    c_in(v_a,c_insert(v_a,c_emptyset,tc_IntDef_Oint),tc_IntDef_Oint),
    inference(ground_cnf,[],[file('Axioms/MSC001-0.ax',cls_Set_OsingletonI_0)]) ).

cnf(g2,plain,
    ( ~ sPE(v_a,v_x(c_insert(v_a,c_emptyset,tc_IntDef_Oint)))
    | ~ v_P(v_a)
    | v_P(v_x(c_insert(v_a,c_emptyset,tc_IntDef_Oint))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    ( ~ c_in(v_a,c_insert(v_a,c_emptyset,tc_IntDef_Oint),tc_IntDef_Oint)
    | ~ v_P(v_x(c_insert(v_a,c_emptyset,tc_IntDef_Oint))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2)]) ).

cnf(g4,plain,
    ( ~ sPE(v_x(c_insert(v_a,c_emptyset,tc_IntDef_Oint)),v_a)
    | sPE(v_a,v_x(c_insert(v_a,c_emptyset,tc_IntDef_Oint))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g5,plain,
    ( ~ c_in(v_x(c_insert(v_a,c_emptyset,tc_IntDef_Oint)),c_insert(v_a,c_emptyset,tc_IntDef_Oint),tc_IntDef_Oint)
    | sPE(v_x(c_insert(v_a,c_emptyset,tc_IntDef_Oint)),v_a) ),
    inference(ground_cnf,[],[file('Axioms/MSC001-0.ax',cls_Set_OsingletonD__dest_0)]) ).

cnf(g6,plain,
    ( ~ c_in(v_a,c_insert(v_a,c_emptyset,tc_IntDef_Oint),tc_IntDef_Oint)
    | c_in(v_x(c_insert(v_a,c_emptyset,tc_IntDef_Oint)),c_insert(v_a,c_emptyset,tc_IntDef_Oint),tc_IntDef_Oint) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET820-1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n021.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 : Sun Jul 10 00:49:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 91.49/11.92  % symbols: 206
% 91.49/11.92  % clauses: 1549
% 91.49/11.92  % start clauses: 3
% 91.49/11.92  % iterative deepening steps: 4884
% 91.49/11.92  % maximum path limit: 4
% 91.49/11.92  % literal attempts: 5817567
% 91.49/11.92  % depth failures: 5501541
% 91.49/11.92  % regularity failures: 79776
% 91.49/11.92  % tautology failures: 31064
% 91.49/11.92  % reductions: 23306
% 91.49/11.92  % extensions: 5785037
% 91.49/11.92  % SAT variables: 2761576
% 91.49/11.92  % SAT clauses: 2719111
% 91.49/11.92  % WalkSAT solutions: 2718939
% 91.49/11.92  % CDCL solutions: 165
% 91.49/11.92  % SZS status Unsatisfiable for theBenchmark
% 91.49/11.92  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------