TSTP Solution File: SEU146+2 by SATCoP---0.1

View Problem - Process Solution

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

% Computer : n012.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 14:12:01 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ( sPE(sK7,singleton(sK8))
    | sPE(sK7,empty_set)
    | subset(sK7,singleton(sK8)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_zfmisc_1)]) ).

cnf(g1,plain,
    ( ~ sPE(sK7,empty_set)
    | ~ subset(sK7,singleton(sK8)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_zfmisc_1)]) ).

cnf(g2,plain,
    ( ~ sPE(sK7,singleton(sK8))
    | ~ subset(sK7,singleton(sK8)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_zfmisc_1)]) ).

cnf(g3,plain,
    ( ~ sPE(sK7,singleton(sK8))
    | subset(sK7,singleton(sK8)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0)]) ).

cnf(g4,plain,
    ( in(sK4(sK7,singleton(sK8)),sK7)
    | subset(sK7,singleton(sK8)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski)]) ).

cnf(g5,plain,
    ( ~ subset(sK7,empty_set)
    | sPE(sK7,empty_set) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_1)]) ).

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

cnf(g7,plain,
    ( ~ subset(sK7,singleton(sK8))
    | sPE(set_difference(sK7,singleton(sK8)),empty_set) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_xboole_1)]) ).

cnf(g8,plain,
    ( ~ subset(sK7,singleton(sK8))
    | sPE(set_intersection2(sK7,singleton(sK8)),sK7) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1)]) ).

cnf(g9,plain,
    ( ~ proper_subset(singleton(sK8),sK7)
    | ~ subset(sK7,singleton(sK8)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_xboole_1)]) ).

cnf(g10,plain,
    ( ~ in(sK11(sK7,sK7),sK7)
    | ~ in(sK11(sK7,sK7),sK7)
    | sPE(sK7,sK7) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski)]) ).

cnf(g11,plain,
    ( ~ subset(singleton(sK8),sK7)
    | sPE(singleton(sK8),sK7)
    | proper_subset(singleton(sK8),sK7) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_xboole_0)]) ).

cnf(g12,plain,
    ( ~ in(sK8,sK7)
    | subset(singleton(sK8),sK7) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1)]) ).

cnf(g13,plain,
    ( ~ sPE(sK7,sK7)
    | ~ sPE(set_difference(sK7,singleton(sK8)),empty_set)
    | ~ subset(sK7,set_difference(sK7,singleton(sK8)))
    | subset(sK7,empty_set) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    ( sPE(sK7,sK7)
    | in(sK11(sK7,sK7),sK7)
    | in(sK11(sK7,sK7),sK7) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski)]) ).

cnf(g15,plain,
    ( ~ sPE(sK7,empty_set)
    | ~ in(sK4(sK7,singleton(sK8)),sK7) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0)]) ).

cnf(g16,plain,
    ( ~ sPE(sK7,sK7)
    | ~ sPE(set_intersection2(sK7,singleton(sK8)),sK7)
    | ~ subset(sK7,set_intersection2(sK7,singleton(sK8)))
    | subset(sK7,sK7) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g17,plain,
    ( ~ sPE(set_intersection2(sK7,singleton(sK8)),sK7)
    | subset(sK7,set_intersection2(sK7,singleton(sK8))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0)]) ).

cnf(g18,plain,
    ( ~ subset(sK7,sK7)
    | in(sK8,sK7)
    | subset(sK7,set_difference(sK7,singleton(sK8))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_zfmisc_1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SEU146+2 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14  % Command  : satcop --statistics %s
% 0.13/0.35  % Computer : n012.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jun 19 01:04:38 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.50  % symbols: 32
% 0.20/0.50  % clauses: 140
% 0.20/0.50  % start clauses: 3
% 0.20/0.50  % iterative deepening steps: 328
% 0.20/0.50  % maximum path limit: 3
% 0.20/0.50  % literal attempts: 266229
% 0.20/0.50  % depth failures: 239114
% 0.20/0.50  % regularity failures: 4572
% 0.20/0.50  % tautology failures: 1640
% 0.20/0.50  % reductions: 5858
% 0.20/0.50  % extensions: 259580
% 0.20/0.50  % SAT variables: 17367
% 0.20/0.50  % SAT clauses: 20905
% 0.20/0.50  % WalkSAT solutions: 20900
% 0.20/0.50  % CDCL solutions: 1
% 0.20/0.50  % SZS status Theorem for theBenchmark
% 0.20/0.50  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------