↑ Up

SATCoP---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SEU109+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 14:11:42 EDT 2022

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

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

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

cnf(g2,plain,
    ~ empty(sK14),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t21_finsub_1)]) ).

cnf(g3,plain,
    preboolean(sK14),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t21_finsub_1)]) ).

cnf(g4,plain,
    ( ~ preboolean(set_intersection2(sK13,sK14))
    | empty(set_intersection2(sK13,sK14)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t21_finsub_1)]) ).

cnf(g5,plain,
    ( ~ preboolean(sK13)
    | in(empty_set,sK13)
    | empty(sK13) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_finsub_1)]) ).

cnf(g6,plain,
    ( ~ preboolean(sK14)
    | in(empty_set,sK14)
    | empty(sK14) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_finsub_1)]) ).

cnf(g7,plain,
    ( in(sK11(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
    | preboolean(set_intersection2(sK13,sK14)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_finsub_1)]) ).

cnf(g8,plain,
    ( ~ empty(set_intersection2(sK13,sK14))
    | sPE(set_intersection2(sK13,sK14),empty_set) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole)]) ).

cnf(g9,plain,
    ( in(sK12(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
    | preboolean(set_intersection2(sK13,sK14)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_finsub_1)]) ).

cnf(g10,plain,
    ( ~ in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14))
    | ~ in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14))
    | preboolean(set_intersection2(sK13,sK14)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_finsub_1)]) ).

cnf(g11,plain,
    sPE(set_intersection2(sK13,sK14),set_intersection2(sK14,sK13)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0)]) ).

cnf(g12,plain,
    ( ~ in(empty_set,empty_set)
    | ~ in(empty_set,empty_set) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden)]) ).

cnf(g13,plain,
    ( ~ sPE(empty_set,set_intersection2(sK13,sK14))
    | ~ in(empty_set,sK13)
    | ~ in(empty_set,sK14)
    | in(empty_set,empty_set) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0)]) ).

cnf(g14,plain,
    ( ~ sPE(set_intersection2(sK13,sK14),empty_set)
    | sPE(empty_set,set_intersection2(sK13,sK14)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ in(sK11(set_intersection2(sK13,sK14)),sK14)
    | ~ in(sK12(set_intersection2(sK13,sK14)),sK14)
    | ~ preboolean(sK14)
    | in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK14) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_finsub_1)]) ).

cnf(g16,plain,
    ( ~ sPE(set_intersection2(sK13,sK14),set_intersection2(sK14,sK13))
    | ~ in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK14)
    | ~ in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK13)
    | in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0)]) ).

cnf(g17,plain,
    ( ~ in(sK11(set_intersection2(sK13,sK14)),sK13)
    | ~ in(sK12(set_intersection2(sK13,sK14)),sK13)
    | ~ preboolean(sK13)
    | in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK13) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_finsub_1)]) ).

cnf(g18,plain,
    ( ~ sPE(set_intersection2(sK13,sK14),set_intersection2(sK14,sK13))
    | ~ in(sK12(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
    | in(sK12(set_intersection2(sK13,sK14)),sK14) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0)]) ).

cnf(g19,plain,
    ( ~ sPE(set_intersection2(sK13,sK14),set_intersection2(sK14,sK13))
    | ~ in(sK12(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
    | in(sK12(set_intersection2(sK13,sK14)),sK13) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0)]) ).

cnf(g20,plain,
    ( ~ sPE(set_intersection2(sK13,sK14),set_intersection2(sK14,sK13))
    | ~ in(sK11(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
    | in(sK11(set_intersection2(sK13,sK14)),sK13) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0)]) ).

cnf(g21,plain,
    ( ~ in(sK11(set_intersection2(sK13,sK14)),sK14)
    | ~ in(sK12(set_intersection2(sK13,sK14)),sK14)
    | ~ preboolean(sK14)
    | in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK14) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_finsub_1)]) ).

cnf(g22,plain,
    ( ~ sPE(set_intersection2(sK13,sK14),set_intersection2(sK14,sK13))
    | ~ in(sK11(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
    | in(sK11(set_intersection2(sK13,sK14)),sK14) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0)]) ).

cnf(g23,plain,
    ( ~ sPE(set_intersection2(sK13,sK14),set_intersection2(sK14,sK13))
    | ~ in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK14)
    | ~ in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK13)
    | in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0)]) ).

cnf(g24,plain,
    ( ~ in(sK11(set_intersection2(sK13,sK14)),sK13)
    | ~ in(sK12(set_intersection2(sK13,sK14)),sK13)
    | ~ preboolean(sK13)
    | in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK13) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_finsub_1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU109+1 : TPTP v8.1.0. Released v3.2.0.
% 0.13/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jun 18 20:22:16 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.39  % symbols: 39
% 0.13/0.39  % clauses: 118
% 0.13/0.39  % start clauses: 5
% 0.13/0.39  % iterative deepening steps: 164
% 0.13/0.39  % maximum path limit: 3
% 0.13/0.39  % literal attempts: 99141
% 0.13/0.39  % depth failures: 74343
% 0.13/0.39  % regularity failures: 4197
% 0.13/0.39  % tautology failures: 565
% 0.13/0.39  % reductions: 9401
% 0.13/0.39  % extensions: 89110
% 0.13/0.39  % SAT variables: 17299
% 0.13/0.39  % SAT clauses: 20653
% 0.13/0.39  % WalkSAT solutions: 20652
% 0.13/0.39  % CDCL solutions: 0
% 0.13/0.39  % SZS status Theorem for theBenchmark
% 0.13/0.39  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------