%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SET916+1 : TPTP v8.1.0. Released v3.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:04:56 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ in(sK5,sK6),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t57_zfmisc_1)]) ).

cnf(g1,plain,
    ~ in(sK7,sK6),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t57_zfmisc_1)]) ).

cnf(g2,plain,
    ~ disjoint(unordered_pair(sK5,sK7),sK6),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t57_zfmisc_1)]) ).

cnf(g3,plain,
    ( in(sK4(unordered_pair(sK5,sK7),sK6),set_intersection2(unordered_pair(sK5,sK7),sK6))
    | disjoint(unordered_pair(sK5,sK7),sK6) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0)]) ).

cnf(g4,plain,
    sPE(sK6,sK6),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g5,plain,
    sPE(unordered_pair(sK5,sK7),unordered_pair(sK5,sK7)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    sPE(set_intersection2(unordered_pair(sK5,sK7),sK6),set_intersection2(sK6,unordered_pair(sK5,sK7))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0)]) ).

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

cnf(g8,plain,
    ( ~ sPE(set_intersection2(unordered_pair(sK5,sK7),sK6),set_intersection2(sK6,unordered_pair(sK5,sK7)))
    | ~ in(sK4(unordered_pair(sK5,sK7),sK6),set_intersection2(unordered_pair(sK5,sK7),sK6))
    | in(sK4(unordered_pair(sK5,sK7),sK6),unordered_pair(sK5,sK7)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0)]) ).

cnf(g9,plain,
    ( ~ sPE(unordered_pair(sK5,sK7),unordered_pair(sK5,sK7))
    | ~ in(sK4(unordered_pair(sK5,sK7),sK6),unordered_pair(sK5,sK7))
    | sPE(sK4(unordered_pair(sK5,sK7),sK6),sK5)
    | sPE(sK4(unordered_pair(sK5,sK7),sK6),sK7) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski)]) ).

cnf(g10,plain,
    ( ~ sPE(sK4(unordered_pair(sK5,sK7),sK6),sK7)
    | ~ sPE(sK6,sK6)
    | ~ in(sK4(unordered_pair(sK5,sK7),sK6),sK6)
    | in(sK7,sK6) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(sK4(unordered_pair(sK5,sK7),sK6),sK5)
    | ~ sPE(sK6,sK6)
    | ~ in(sK4(unordered_pair(sK5,sK7),sK6),sK6)
    | in(sK5,sK6) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET916+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.12/0.34  % Computer : n016.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 : Mon Jul 11 08:38:57 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 3.59/0.83  % symbols: 17
% 3.59/0.83  % clauses: 41
% 3.59/0.83  % start clauses: 3
% 3.59/0.83  % iterative deepening steps: 1437
% 3.59/0.83  % maximum path limit: 4
% 3.59/0.83  % literal attempts: 1240461
% 3.59/0.83  % depth failures: 943575
% 3.59/0.83  % regularity failures: 22191
% 3.59/0.83  % tautology failures: 14811
% 3.59/0.83  % reductions: 41223
% 3.59/0.83  % extensions: 1196098
% 3.59/0.83  % SAT variables: 77378
% 3.59/0.83  % SAT clauses: 101720
% 3.59/0.83  % WalkSAT solutions: 101715
% 3.59/0.83  % CDCL solutions: 0
% 3.59/0.83  % SZS status Theorem for theBenchmark
% 3.59/0.83  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------