↑ Up

SATCoP---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SEU112+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n018.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:43 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ subset(set_union2(finite_subsets(sK10),finite_subsets(sK11)),finite_subsets(set_union2(sK10,sK11))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_finsub_1)]) ).

cnf(g1,plain,
    sPE(finite_subsets(set_union2(sK10,sK11)),finite_subsets(set_union2(sK10,sK11))),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g2,plain,
    ( ~ subset(sK10,set_union2(sK10,sK11))
    | subset(finite_subsets(sK10),finite_subsets(set_union2(sK10,sK11))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_finsub_1)]) ).

cnf(g3,plain,
    sPE(set_union2(finite_subsets(sK11),finite_subsets(sK10)),set_union2(finite_subsets(sK10),finite_subsets(sK11))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0)]) ).

cnf(g4,plain,
    ( ~ subset(sK11,set_union2(sK10,sK11))
    | subset(finite_subsets(sK11),finite_subsets(set_union2(sK10,sK11))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_finsub_1)]) ).

cnf(g5,plain,
    ( ~ sPE(set_union2(finite_subsets(sK11),finite_subsets(sK10)),set_union2(finite_subsets(sK10),finite_subsets(sK11)))
    | ~ sPE(finite_subsets(set_union2(sK10,sK11)),finite_subsets(set_union2(sK10,sK11)))
    | ~ subset(set_union2(finite_subsets(sK11),finite_subsets(sK10)),finite_subsets(set_union2(sK10,sK11)))
    | subset(set_union2(finite_subsets(sK10),finite_subsets(sK11)),finite_subsets(set_union2(sK10,sK11))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    ( ~ subset(finite_subsets(sK11),finite_subsets(set_union2(sK10,sK11)))
    | ~ subset(finite_subsets(sK10),finite_subsets(set_union2(sK10,sK11)))
    | subset(set_union2(finite_subsets(sK11),finite_subsets(sK10)),finite_subsets(set_union2(sK10,sK11))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_xboole_1)]) ).

cnf(g7,plain,
    subset(sK10,set_union2(sK10,sK11)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1)]) ).

cnf(g8,plain,
    sPE(set_union2(sK11,sK10),set_union2(sK10,sK11)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0)]) ).

cnf(g9,plain,
    sPE(sK11,sK11),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ sPE(sK11,sK11)
    | ~ sPE(set_union2(sK11,sK10),set_union2(sK10,sK11))
    | ~ subset(sK11,set_union2(sK11,sK10))
    | subset(sK11,set_union2(sK10,sK11)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    subset(sK11,set_union2(sK11,sK10)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU112+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13  % Command  : satcop --statistics %s
% 0.14/0.34  % Computer : n018.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jun 20 11:31:20 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.21/0.38  % symbols: 34
% 0.21/0.38  % clauses: 96
% 0.21/0.38  % start clauses: 1
% 0.21/0.38  % iterative deepening steps: 391
% 0.21/0.38  % maximum path limit: 4
% 0.21/0.38  % literal attempts: 20946
% 0.21/0.38  % depth failures: 12744
% 0.21/0.38  % regularity failures: 1207
% 0.21/0.38  % tautology failures: 279
% 0.21/0.38  % reductions: 15
% 0.21/0.38  % extensions: 20590
% 0.21/0.38  % SAT variables: 6762
% 0.21/0.38  % SAT clauses: 9211
% 0.21/0.38  % WalkSAT solutions: 9205
% 0.21/0.38  % CDCL solutions: 0
% 0.21/0.38  % SZS status Theorem for theBenchmark
% 0.21/0.38  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------