TSTP Solution File: SET863-2 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SET863-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n023.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:34 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0)]) ).

cnf(g1,plain,
    c_in(v_c,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1)]) ).

cnf(g2,plain,
    c_in(v_x,v_S,tc_set(t_a)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3)]) ).

cnf(g3,plain,
    c_lessequals(v_y,v_x,tc_set(t_a)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4)]) ).

cnf(g4,plain,
    c_in(v_xa,v_x,t_a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5)]) ).

cnf(g5,plain,
    ~ c_in(v_xa,v_y,t_a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6)]) ).

cnf(g6,plain,
    ( ~ c_in(v_x,v_S,tc_set(t_a))
    | ~ c_in(v_c,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
    | c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a))
    | c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Ochain__extend_0)]) ).

cnf(g7,plain,
    ( ~ c_in(v_x,v_S,tc_set(t_a))
    | ~ c_in(v_c,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_lessequals(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,tc_set(t_a))
    | c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Ochain__extend_1)]) ).

cnf(g8,plain,
    ( ~ c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a))
    | c_lessequals(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_y,tc_set(t_a)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_7)]) ).

cnf(g9,plain,
    ( c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),c_Zorn_Ochain__extend__1(v_c,v_x,t_a),t_a)
    | c_lessequals(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,tc_set(t_a)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_0)]) ).

cnf(g10,plain,
    ( ~ c_in(v_xa,v_x,t_a)
    | ~ c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
    | c_in(v_xa,v_y,t_a)
    | c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_c,tc_set(t_a)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__super__lemma_0)]) ).

cnf(g11,plain,
    ( ~ c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),v_x,t_a)
    | c_lessequals(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,tc_set(t_a)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_1)]) ).

cnf(g12,plain,
    ( ~ c_in(v_xa,v_x,t_a)
    | ~ c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_lessequals(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_y,tc_set(t_a))
    | c_in(v_xa,v_y,t_a) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__super__lemma_1)]) ).

cnf(g13,plain,
    ( ~ c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_c,tc_set(t_a))
    | c_lessequals(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_y,tc_set(t_a)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_7)]) ).

cnf(g14,plain,
    ( ~ c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),c_Zorn_Ochain__extend__1(v_c,v_x,t_a),t_a)
    | ~ c_lessequals(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_y,tc_set(t_a))
    | c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),v_y,t_a) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetD_0)]) ).

cnf(g15,plain,
    ( ~ c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),v_y,t_a)
    | ~ c_lessequals(v_y,v_x,tc_set(t_a))
    | c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),v_x,t_a) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetD_0)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SET863-2 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n023.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 : Mon Jul 11 07:43:55 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.42  % symbols: 19
% 0.18/0.42  % clauses: 14
% 0.18/0.42  % start clauses: 7
% 0.18/0.42  % iterative deepening steps: 148
% 0.18/0.42  % maximum path limit: 3
% 0.18/0.42  % literal attempts: 44059
% 0.18/0.42  % depth failures: 32888
% 0.18/0.42  % regularity failures: 50
% 0.18/0.42  % tautology failures: 341
% 0.18/0.42  % reductions: 1235
% 0.18/0.42  % extensions: 41905
% 0.18/0.42  % SAT variables: 9353
% 0.18/0.42  % SAT clauses: 9594
% 0.18/0.42  % WalkSAT solutions: 9593
% 0.18/0.42  % CDCL solutions: 0
% 0.18/0.42  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.42  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------