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

% Computer : n032.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:11:42 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    subset(sK12,sK13),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_finsub_1)]) ).

cnf(g1,plain,
    ~ subset(finite_subsets(sK12),finite_subsets(sK13)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_finsub_1)]) ).

cnf(g2,plain,
    ( in(sK0(finite_subsets(sK12),finite_subsets(sK13)),finite_subsets(sK12))
    | subset(finite_subsets(sK12),finite_subsets(sK13)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski)]) ).

cnf(g3,plain,
    ( ~ in(sK0(finite_subsets(sK12),finite_subsets(sK13)),finite_subsets(sK13))
    | subset(finite_subsets(sK12),finite_subsets(sK13)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski)]) ).

cnf(g4,plain,
    preboolean(finite_subsets(sK12)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_finsub_1)]) ).

cnf(g5,plain,
    ( ~ sPE(finite_subsets(sK12),finite_subsets(sK12))
    | ~ in(sK0(finite_subsets(sK12),finite_subsets(sK13)),finite_subsets(sK12))
    | ~ preboolean(finite_subsets(sK12))
    | subset(sK0(finite_subsets(sK12),finite_subsets(sK13)),sK12) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1)]) ).

cnf(g6,plain,
    ( ~ sPE(finite_subsets(sK12),finite_subsets(sK12))
    | ~ in(sK0(finite_subsets(sK12),finite_subsets(sK13)),finite_subsets(sK12))
    | ~ preboolean(finite_subsets(sK12))
    | finite(sK0(finite_subsets(sK12),finite_subsets(sK13))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1)]) ).

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

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

cnf(g9,plain,
    preboolean(finite_subsets(sK13)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_finsub_1)]) ).

cnf(g10,plain,
    ( ~ sPE(finite_subsets(sK13),finite_subsets(sK13))
    | ~ finite(sK0(finite_subsets(sK12),finite_subsets(sK13)))
    | ~ preboolean(finite_subsets(sK13))
    | ~ subset(sK0(finite_subsets(sK12),finite_subsets(sK13)),sK13)
    | in(sK0(finite_subsets(sK12),finite_subsets(sK13)),finite_subsets(sK13)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1)]) ).

cnf(g11,plain,
    ( ~ subset(sK0(finite_subsets(sK12),finite_subsets(sK13)),sK12)
    | ~ subset(sK12,sK13)
    | subset(sK0(finite_subsets(sK12),finite_subsets(sK13)),sK13) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SEU110+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.11  % Command  : satcop --statistics %s
% 0.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 600
% 0.11/0.31  % DateTime : Sun Jun 19 20:40:18 EDT 2022
% 0.11/0.31  % CPUTime  : 
% 0.15/0.32  % symbols: 36
% 0.15/0.32  % clauses: 102
% 0.15/0.32  % start clauses: 2
% 0.15/0.32  % iterative deepening steps: 78
% 0.15/0.32  % maximum path limit: 3
% 0.15/0.32  % literal attempts: 7040
% 0.15/0.32  % depth failures: 5503
% 0.15/0.32  % regularity failures: 135
% 0.15/0.32  % tautology failures: 184
% 0.15/0.32  % reductions: 20
% 0.15/0.32  % extensions: 6916
% 0.15/0.32  % SAT variables: 1849
% 0.15/0.32  % SAT clauses: 2409
% 0.15/0.32  % WalkSAT solutions: 2404
% 0.15/0.32  % CDCL solutions: 0
% 0.15/0.32  % SZS status Theorem for theBenchmark
% 0.15/0.32  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------