↑ Up

SATCoP---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SEU307+1 : TPTP v8.1.0. Released v3.3.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:13:42 EDT 2022

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

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

cnf(g1,plain,
    element(sK6,powerset(the_carrier(sK5))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_pre_topc)]) ).

cnf(g2,plain,
    ~ sPE(subset_intersection2(the_carrier(sK5),sK6,cast_as_carrier_subset(sK5)),sK6),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_pre_topc)]) ).

cnf(g3,plain,
    ( ~ one_sorted_str(sK5)
    | element(cast_as_carrier_subset(sK5),powerset(the_carrier(sK5))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_pre_topc)]) ).

cnf(g4,plain,
    ( ~ one_sorted_str(sK5)
    | sPE(cast_as_carrier_subset(sK5),the_carrier(sK5)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_pre_topc)]) ).

cnf(g5,plain,
    ( ~ element(sK6,powerset(the_carrier(sK5)))
    | subset(sK6,the_carrier(sK5)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset)]) ).

cnf(g6,plain,
    ( ~ subset(sK6,the_carrier(sK5))
    | sPE(set_intersection2(sK6,the_carrier(sK5)),sK6) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1)]) ).

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

cnf(g8,plain,
    ( ~ sPE(subset_intersection2(the_carrier(sK5),sK6,cast_as_carrier_subset(sK5)),set_intersection2(sK6,cast_as_carrier_subset(sK5)))
    | ~ sPE(set_intersection2(sK6,cast_as_carrier_subset(sK5)),sK6)
    | sPE(subset_intersection2(the_carrier(sK5),sK6,cast_as_carrier_subset(sK5)),sK6) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    ( ~ element(sK6,powerset(the_carrier(sK5)))
    | ~ element(cast_as_carrier_subset(sK5),powerset(the_carrier(sK5)))
    | sPE(subset_intersection2(the_carrier(sK5),sK6,cast_as_carrier_subset(sK5)),set_intersection2(sK6,cast_as_carrier_subset(sK5))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k5_subset_1)]) ).

cnf(g10,plain,
    ( ~ sPE(set_intersection2(sK6,cast_as_carrier_subset(sK5)),set_intersection2(sK6,the_carrier(sK5)))
    | ~ sPE(set_intersection2(sK6,the_carrier(sK5)),sK6)
    | sPE(set_intersection2(sK6,cast_as_carrier_subset(sK5)),sK6) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(sK6,sK6)
    | ~ sPE(cast_as_carrier_subset(sK5),the_carrier(sK5))
    | sPE(set_intersection2(sK6,cast_as_carrier_subset(sK5)),set_intersection2(sK6,the_carrier(sK5))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SEU307+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n022.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 Jun 19 10:52:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 3.28/0.75  % symbols: 30
% 3.28/0.75  % clauses: 138
% 3.28/0.75  % start clauses: 3
% 3.28/0.75  % iterative deepening steps: 304
% 3.28/0.75  % maximum path limit: 4
% 3.28/0.75  % literal attempts: 1023671
% 3.28/0.75  % depth failures: 783638
% 3.28/0.75  % regularity failures: 4944
% 3.28/0.75  % tautology failures: 10378
% 3.28/0.75  % reductions: 147542
% 3.28/0.75  % extensions: 875431
% 3.28/0.75  % SAT variables: 88324
% 3.28/0.75  % SAT clauses: 113349
% 3.28/0.75  % WalkSAT solutions: 113342
% 3.28/0.75  % CDCL solutions: 5
% 3.28/0.75  % SZS status Theorem for theBenchmark
% 3.28/0.75  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------