TSTP Solution File: SET597+3 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SET597+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n005.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:02:18 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ( sPE(sK2,union(sK3,sK4))
    | subset(sK3,sK2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th56)]) ).

cnf(g1,plain,
    ( sPE(sK2,union(sK3,sK4))
    | subset(sK4,sK2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th56)]) ).

cnf(g2,plain,
    ( ~ sPE(sK2,union(sK3,sK4))
    | ~ subset(sK3,sK2)
    | ~ subset(sK4,sK2)
    | subset(sK3,sK5) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th56)]) ).

cnf(g3,plain,
    ( ~ sPE(sK2,union(sK3,sK4))
    | ~ subset(sK3,sK2)
    | ~ subset(sK4,sK2)
    | subset(sK4,sK5) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th56)]) ).

cnf(g4,plain,
    ( ~ sPE(sK2,union(sK3,sK4))
    | ~ subset(sK2,sK5)
    | ~ subset(sK3,sK2)
    | ~ subset(sK4,sK2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th56)]) ).

cnf(g5,plain,
    ( ~ sPE(sK2,union(sK3,sK4))
    | sPE(union(sK3,sK4),sK2) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    ( ~ sPE(union(sK3,sK4),sK2)
    | sPE(sK2,union(sK3,sK4)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    ( ~ member(sK0(sK2,sK5),sK5)
    | subset(sK2,sK5) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn)]) ).

cnf(g8,plain,
    ( subset(sK2,sK5)
    | member(sK0(sK2,sK5),sK2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn)]) ).

cnf(g9,plain,
    sPE(sK4,sK4),
    inference(ground_cnf,[],[theory(equality)]) ).

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

cnf(g11,plain,
    ( ~ subset(union(sK3,sK4),sK2)
    | ~ subset(sK2,union(sK3,sK4))
    | sPE(union(sK3,sK4),sK2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn)]) ).

cnf(g12,plain,
    ( ~ subset(sK3,union(sK3,sK4))
    | ~ subset(sK4,union(sK3,sK4))
    | sPE(sK2,union(sK3,sK4))
    | subset(sK2,union(sK3,sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th56)]) ).

cnf(g13,plain,
    subset(sK3,union(sK3,sK4)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_of_union)]) ).

cnf(g14,plain,
    sPE(union(sK4,sK3),union(sK3,sK4)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_union)]) ).

cnf(g15,plain,
    ( ~ subset(sK3,sK2)
    | ~ subset(sK4,sK2)
    | subset(union(sK3,sK4),sK2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_subset)]) ).

cnf(g16,plain,
    ( ~ sPE(sK4,sK4)
    | ~ sPE(union(sK4,sK3),union(sK3,sK4))
    | ~ subset(sK4,union(sK4,sK3))
    | subset(sK4,union(sK3,sK4)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g17,plain,
    subset(sK4,union(sK4,sK3)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_of_union)]) ).

cnf(g18,plain,
    ( ~ sPE(sK3,sK3)
    | ~ sPE(union(sK3,sK4),sK2)
    | ~ subset(sK3,union(sK3,sK4))
    | subset(sK3,sK2) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g19,plain,
    sPE(sK0(sK2,sK5),sK0(sK2,sK5)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g20,plain,
    ( ~ subset(sK4,sK5)
    | ~ member(sK0(sK2,sK5),sK4)
    | member(sK0(sK2,sK5),sK5) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn)]) ).

cnf(g21,plain,
    ( ~ subset(sK3,sK5)
    | ~ member(sK0(sK2,sK5),sK3)
    | member(sK0(sK2,sK5),sK5) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn)]) ).

cnf(g22,plain,
    ( ~ sPE(sK4,sK4)
    | ~ sPE(union(sK3,sK4),sK2)
    | ~ subset(sK4,union(sK3,sK4))
    | subset(sK4,sK2) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g23,plain,
    ( ~ sPE(sK0(sK2,sK5),sK0(sK2,sK5))
    | ~ sPE(sK2,union(sK3,sK4))
    | ~ member(sK0(sK2,sK5),sK2)
    | member(sK0(sK2,sK5),union(sK3,sK4)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g24,plain,
    ( ~ member(sK0(sK2,sK5),union(sK3,sK4))
    | member(sK0(sK2,sK5),sK3)
    | member(sK0(sK2,sK5),sK4) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET597+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13  % Command  : satcop --statistics %s
% 0.12/0.34  % Computer : n005.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jul 10 15:42:22 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.40  % symbols: 12
% 0.19/0.40  % clauses: 34
% 0.19/0.40  % start clauses: 6
% 0.19/0.40  % iterative deepening steps: 150
% 0.19/0.40  % maximum path limit: 3
% 0.19/0.40  % literal attempts: 97762
% 0.19/0.40  % depth failures: 81483
% 0.19/0.40  % regularity failures: 2981
% 0.19/0.40  % tautology failures: 2301
% 0.19/0.40  % reductions: 1255
% 0.19/0.40  % extensions: 95759
% 0.19/0.40  % SAT variables: 6289
% 0.19/0.40  % SAT clauses: 9827
% 0.19/0.40  % WalkSAT solutions: 9820
% 0.19/0.40  % CDCL solutions: 3
% 0.19/0.40  % SZS status Theorem for theBenchmark
% 0.19/0.40  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------