TSTP Solution File: SET017+1 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SET017+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n018.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 04:57:27 EDT 2022

% Result   : Theorem 4.79s 0.95s
% Output   : Proof 4.79s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    member(sK8,universal_class),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_cancellation)]) ).

cnf(g1,plain,
    member(sK9,universal_class),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_cancellation)]) ).

cnf(g2,plain,
    sPE(unordered_pair(sK7,sK8),unordered_pair(sK7,sK9)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_cancellation)]) ).

cnf(g3,plain,
    ~ sPE(sK8,sK9),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_cancellation)]) ).

cnf(g4,plain,
    ( ~ member(sK8,universal_class)
    | ~ member(sK9,universal_class)
    | sPE(first(ordered_pair(sK8,sK9)),sK8) ),
    inference(ground_cnf,[],[file('Axioms/SET005+0.ax',first_second)]) ).

cnf(g5,plain,
    ( ~ member(sK9,universal_class)
    | ~ member(sK9,universal_class)
    | sPE(second(ordered_pair(sK9,sK9)),sK9) ),
    inference(ground_cnf,[],[file('Axioms/SET005+0.ax',first_second)]) ).

cnf(g6,plain,
    ( ~ sPE(unordered_pair(sK7,sK8),unordered_pair(sK7,sK9))
    | subclass(unordered_pair(sK7,sK9),unordered_pair(sK7,sK8)) ),
    inference(ground_cnf,[],[file('Axioms/SET005+0.ax',extensionality)]) ).

cnf(g7,plain,
    ( ~ sPE(sK9,sK8)
    | sPE(sK8,sK9) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    ( ~ sPE(second(ordered_pair(sK9,sK9)),sK9)
    | sPE(sK9,second(ordered_pair(sK9,sK9))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    ( ~ sPE(sK9,second(ordered_pair(sK9,sK9)))
    | ~ sPE(second(ordered_pair(sK9,sK9)),sK9)
    | sPE(sK9,sK9) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    sPE(universal_class,universal_class),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ subclass(unordered_pair(sK7,sK9),unordered_pair(sK7,sK8))
    | ~ member(sK9,unordered_pair(sK7,sK9))
    | member(sK9,unordered_pair(sK7,sK8)) ),
    inference(ground_cnf,[],[file('Axioms/SET005+0.ax',subclass_defn)]) ).

cnf(g12,plain,
    ( ~ sPE(first(ordered_pair(sK8,sK9)),sK8)
    | sPE(sK8,first(ordered_pair(sK8,sK9))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    ( ~ sPE(sK8,first(ordered_pair(sK8,sK9)))
    | ~ sPE(universal_class,universal_class)
    | ~ member(sK8,universal_class)
    | member(first(ordered_pair(sK8,sK9)),universal_class) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    ( ~ sPE(sK9,sK9)
    | ~ member(sK9,universal_class)
    | member(sK9,unordered_pair(sK8,sK9)) ),
    inference(ground_cnf,[],[file('Axioms/SET005+0.ax',unordered_pair_defn)]) ).

cnf(g15,plain,
    ( ~ member(sK8,unordered_pair(sK7,sK9))
    | sPE(sK8,sK7)
    | sPE(sK8,sK9) ),
    inference(ground_cnf,[],[file('Axioms/SET005+0.ax',unordered_pair_defn)]) ).

cnf(g16,plain,
    ( ~ sPE(first(ordered_pair(sK8,sK9)),sK8)
    | ~ sPE(unordered_pair(sK7,sK8),unordered_pair(sK7,sK9))
    | ~ member(first(ordered_pair(sK8,sK9)),unordered_pair(sK7,sK8))
    | member(sK8,unordered_pair(sK7,sK9)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g17,plain,
    ( ~ sPE(first(ordered_pair(sK8,sK9)),sK8)
    | ~ member(first(ordered_pair(sK8,sK9)),universal_class)
    | member(first(ordered_pair(sK8,sK9)),unordered_pair(sK7,sK8)) ),
    inference(ground_cnf,[],[file('Axioms/SET005+0.ax',unordered_pair_defn)]) ).

cnf(g18,plain,
    ( ~ sPE(sK8,sK7)
    | ~ sPE(sK9,sK9)
    | sPE(unordered_pair(sK8,sK9),unordered_pair(sK7,sK9)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g19,plain,
    ( ~ sPE(sK9,sK9)
    | ~ sPE(unordered_pair(sK8,sK9),unordered_pair(sK7,sK9))
    | ~ member(sK9,unordered_pair(sK8,sK9))
    | member(sK9,unordered_pair(sK7,sK9)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g20,plain,
    ( ~ sPE(sK8,sK7)
    | ~ sPE(sK7,sK9)
    | sPE(sK8,sK9) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g21,plain,
    ( ~ sPE(sK9,sK7)
    | sPE(sK7,sK9) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g22,plain,
    ( ~ member(sK9,unordered_pair(sK7,sK8))
    | sPE(sK9,sK7)
    | sPE(sK9,sK8) ),
    inference(ground_cnf,[],[file('Axioms/SET005+0.ax',unordered_pair_defn)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET017+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n018.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 16:58:43 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 4.79/0.95  % symbols: 43
% 4.79/0.95  % clauses: 127
% 4.79/0.95  % start clauses: 4
% 4.79/0.95  % iterative deepening steps: 374
% 4.79/0.95  % maximum path limit: 3
% 4.79/0.95  % literal attempts: 838689
% 4.79/0.95  % depth failures: 757858
% 4.79/0.95  % regularity failures: 11967
% 4.79/0.95  % tautology failures: 5449
% 4.79/0.95  % reductions: 33147
% 4.79/0.95  % extensions: 804853
% 4.79/0.95  % SAT variables: 213441
% 4.79/0.95  % SAT clauses: 203072
% 4.79/0.95  % WalkSAT solutions: 203065
% 4.79/0.95  % CDCL solutions: 0
% 4.79/0.95  % SZS status Theorem for theBenchmark
% 4.79/0.95  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------