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

% Computer : n014.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:55 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    disjoint(unordered_pair(sK5,sK6),sK7),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t55_zfmisc_1)]) ).

cnf(g1,plain,
    in(sK5,sK7),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t55_zfmisc_1)]) ).

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

cnf(g3,plain,
    ( ~ disjoint(unordered_pair(sK5,sK6),sK7)
    | sPE(set_intersection2(unordered_pair(sK5,sK6),sK7),empty_set) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0)]) ).

cnf(g4,plain,
    ( ~ sPE(set_intersection2(unordered_pair(sK5,sK6),sK7),empty_set)
    | ~ in(sK5,set_intersection2(unordered_pair(sK5,sK6),sK7)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0)]) ).

cnf(g5,plain,
    ( ~ sPE(set_intersection2(unordered_pair(sK5,sK6),sK7),empty_set)
    | sPE(empty_set,set_intersection2(unordered_pair(sK5,sK6),sK7)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    ( ~ disjoint(sK7,unordered_pair(sK5,sK6))
    | sPE(set_intersection2(sK7,unordered_pair(sK5,sK6)),empty_set) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0)]) ).

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

cnf(g8,plain,
    sPE(unordered_pair(sK5,sK6),unordered_pair(sK5,sK6)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    ( ~ sPE(set_intersection2(sK7,unordered_pair(sK5,sK6)),empty_set)
    | sPE(empty_set,set_intersection2(sK7,unordered_pair(sK5,sK6))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SET914+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n014.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 15:24:50 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 4.08/0.88  % symbols: 18
% 4.08/0.88  % clauses: 43
% 4.08/0.88  % start clauses: 2
% 4.08/0.88  % iterative deepening steps: 1304
% 4.08/0.88  % maximum path limit: 4
% 4.08/0.88  % literal attempts: 1160272
% 4.08/0.88  % depth failures: 929632
% 4.08/0.88  % regularity failures: 16893
% 4.08/0.88  % tautology failures: 23609
% 4.08/0.88  % reductions: 69239
% 4.08/0.88  % extensions: 1089771
% 4.08/0.88  % SAT variables: 105492
% 4.08/0.88  % SAT clauses: 132585
% 4.08/0.88  % WalkSAT solutions: 132581
% 4.08/0.88  % CDCL solutions: 1
% 4.08/0.88  % SZS status Theorem for theBenchmark
% 4.08/0.88  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------