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

% Computer : n022.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:05:09 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ disjoint(union(sK7),sK8),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t98_zfmisc_1)]) ).

cnf(g1,plain,
    ( in(sK6(union(sK7),sK8),set_intersection2(union(sK7),sK8))
    | disjoint(union(sK7),sK8) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0)]) ).

cnf(g2,plain,
    sPE(union(sK7),union(sK7)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    sPE(set_intersection2(union(sK7),sK8),set_intersection2(union(sK7),sK8)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    sPE(set_intersection2(union(sK7),sK8),set_intersection2(sK8,union(sK7))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0)]) ).

cnf(g5,plain,
    sPE(sK6(union(sK7),sK8),sK6(union(sK7),sK8)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    ( ~ sPE(sK6(union(sK7),sK8),sK6(union(sK7),sK8))
    | ~ sPE(set_intersection2(union(sK7),sK8),set_intersection2(sK8,union(sK7)))
    | ~ in(sK6(union(sK7),sK8),set_intersection2(union(sK7),sK8))
    | in(sK6(union(sK7),sK8),set_intersection2(sK8,union(sK7))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    ( ~ sPE(set_intersection2(union(sK7),sK8),set_intersection2(union(sK7),sK8))
    | ~ in(sK6(union(sK7),sK8),set_intersection2(union(sK7),sK8))
    | in(sK6(union(sK7),sK8),union(sK7)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0)]) ).

cnf(g8,plain,
    ( ~ sPE(union(sK7),union(sK7))
    | ~ in(sK6(union(sK7),sK8),union(sK7))
    | in(sK1(sK7,union(sK7),sK6(union(sK7),sK8)),sK7) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski)]) ).

cnf(g9,plain,
    ( ~ sPE(union(sK7),union(sK7))
    | ~ in(sK6(union(sK7),sK8),union(sK7))
    | in(sK6(union(sK7),sK8),sK1(sK7,union(sK7),sK6(union(sK7),sK8))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski)]) ).

cnf(g10,plain,
    sPE(set_intersection2(sK8,union(sK7)),set_intersection2(sK8,union(sK7))),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ in(sK1(sK7,union(sK7),sK6(union(sK7),sK8)),sK7)
    | disjoint(sK1(sK7,union(sK7),sK6(union(sK7),sK8)),sK8) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t98_zfmisc_1)]) ).

cnf(g12,plain,
    ( ~ sPE(set_intersection2(sK8,union(sK7)),set_intersection2(sK8,union(sK7)))
    | ~ in(sK6(union(sK7),sK8),set_intersection2(sK8,union(sK7)))
    | in(sK6(union(sK7),sK8),sK8) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0)]) ).

cnf(g13,plain,
    ( ~ sPE(set_intersection2(sK1(sK7,union(sK7),sK6(union(sK7),sK8)),sK8),set_intersection2(sK1(sK7,union(sK7),sK6(union(sK7),sK8)),sK8))
    | ~ in(sK6(union(sK7),sK8),sK1(sK7,union(sK7),sK6(union(sK7),sK8)))
    | ~ in(sK6(union(sK7),sK8),sK8)
    | in(sK6(union(sK7),sK8),set_intersection2(sK1(sK7,union(sK7),sK6(union(sK7),sK8)),sK8)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0)]) ).

cnf(g14,plain,
    sPE(set_intersection2(sK1(sK7,union(sK7),sK6(union(sK7),sK8)),sK8),set_intersection2(sK1(sK7,union(sK7),sK6(union(sK7),sK8)),sK8)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ in(sK6(union(sK7),sK8),set_intersection2(sK1(sK7,union(sK7),sK6(union(sK7),sK8)),sK8))
    | ~ disjoint(sK1(sK7,union(sK7),sK6(union(sK7),sK8)),sK8) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET945+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n022.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 01:46:40 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 45.95/6.12  % symbols: 18
% 45.95/6.12  % clauses: 41
% 45.95/6.12  % start clauses: 2
% 45.95/6.12  % iterative deepening steps: 4691
% 45.95/6.12  % maximum path limit: 6
% 45.95/6.12  % literal attempts: 7885841
% 45.95/6.12  % depth failures: 5856507
% 45.95/6.12  % regularity failures: 204689
% 45.95/6.12  % tautology failures: 171046
% 45.95/6.12  % reductions: 259484
% 45.95/6.12  % extensions: 7623719
% 45.95/6.12  % SAT variables: 810130
% 45.95/6.12  % SAT clauses: 1051689
% 45.95/6.12  % WalkSAT solutions: 1051676
% 45.95/6.12  % CDCL solutions: 11
% 45.95/6.12  % SZS status Theorem for theBenchmark
% 45.95/6.12  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------