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

View Problem - Process Solution

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

% Computer : n016.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:19 EDT 2022

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

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

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

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

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

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

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

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

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

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

cnf(g9,plain,
    sPE(intersection(sK4,sK3),intersection(sK3,sK4)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection)]) ).

cnf(g10,plain,
    subset(intersection(sK3,sK4),sK3),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_is_subset)]) ).

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

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

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

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

cnf(g15,plain,
    sPE(sK5,sK5),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

cnf(g18,plain,
    ( ~ subset(sK5,sK3)
    | ~ subset(sK5,sK4)
    | subset(sK5,intersection(sK3,sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_subsets)]) ).

cnf(g19,plain,
    ( ~ sPE(sK5,sK5)
    | ~ sPE(intersection(sK3,sK4),sK2)
    | ~ subset(sK5,intersection(sK3,sK4))
    | subset(sK5,sK2) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14  % Problem  : SET598+3 : TPTP v8.1.0. Released v2.2.0.
% 0.09/0.15  % Command  : satcop --statistics %s
% 0.14/0.37  % Computer : n016.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit : 300
% 0.14/0.37  % WCLimit  : 600
% 0.14/0.37  % DateTime : Mon Jul 11 09:05:42 EDT 2022
% 0.14/0.37  % CPUTime  : 
% 0.22/0.45  % symbols: 12
% 0.22/0.45  % clauses: 34
% 0.22/0.45  % start clauses: 6
% 0.22/0.45  % iterative deepening steps: 158
% 0.22/0.45  % maximum path limit: 3
% 0.22/0.45  % literal attempts: 82558
% 0.22/0.45  % depth failures: 68654
% 0.22/0.45  % regularity failures: 2445
% 0.22/0.45  % tautology failures: 1850
% 0.22/0.45  % reductions: 1142
% 0.22/0.45  % extensions: 80652
% 0.22/0.45  % SAT variables: 5158
% 0.22/0.45  % SAT clauses: 7863
% 0.22/0.45  % WalkSAT solutions: 7855
% 0.22/0.45  % CDCL solutions: 3
% 0.22/0.45  % SZS status Theorem for theBenchmark
% 0.22/0.45  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------