TSTP Solution File: SEU327+1 by SATCoP---0.1

View Problem - Process Solution

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

% Computer : n006.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:54 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    element(sK5,powerset(powerset(sK4))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_tops_2)]) ).

cnf(g1,plain,
    ~ sPE(sK5,empty_set),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_tops_2)]) ).

cnf(g2,plain,
    ~ sPE(meet_of_subsets(sK4,complements_of_subsets(sK4,sK5)),subset_complement(sK4,union_of_subsets(sK4,sK5))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_tops_2)]) ).

cnf(g3,plain,
    ( ~ element(sK5,powerset(powerset(sK4)))
    | sPE(sK5,empty_set)
    | sPE(subset_difference(sK4,cast_to_subset(sK4),union_of_subsets(sK4,sK5)),meet_of_subsets(sK4,complements_of_subsets(sK4,sK5))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t47_setfam_1)]) ).

cnf(g4,plain,
    ( ~ element(sK5,powerset(powerset(sK4)))
    | element(union_of_subsets(sK4,sK5),powerset(sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_setfam_1)]) ).

cnf(g5,plain,
    ( ~ sPE(subset_difference(sK4,cast_to_subset(sK4),union_of_subsets(sK4,sK5)),meet_of_subsets(sK4,complements_of_subsets(sK4,sK5)))
    | sPE(meet_of_subsets(sK4,complements_of_subsets(sK4,sK5)),subset_difference(sK4,cast_to_subset(sK4),union_of_subsets(sK4,sK5))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    ( ~ element(union_of_subsets(sK4,sK5),powerset(sK4))
    | sPE(subset_complement(sK4,union_of_subsets(sK4,sK5)),set_difference(sK4,union_of_subsets(sK4,sK5))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_subset_1)]) ).

cnf(g7,plain,
    ( ~ element(sK4,powerset(sK4))
    | ~ element(union_of_subsets(sK4,sK5),powerset(sK4))
    | sPE(subset_difference(sK4,sK4,union_of_subsets(sK4,sK5)),set_difference(sK4,union_of_subsets(sK4,sK5))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k6_subset_1)]) ).

cnf(g8,plain,
    sPE(cast_to_subset(sK4),sK4),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_subset_1)]) ).

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

cnf(g10,plain,
    ( ~ sPE(subset_complement(sK4,union_of_subsets(sK4,sK5)),set_difference(sK4,union_of_subsets(sK4,sK5)))
    | sPE(set_difference(sK4,union_of_subsets(sK4,sK5)),subset_complement(sK4,union_of_subsets(sK4,sK5))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    sPE(union_of_subsets(sK4,sK5),union_of_subsets(sK4,sK5)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ subset(sK4,sK4)
    | element(sK4,powerset(sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset)]) ).

cnf(g13,plain,
    subset(sK4,sK4),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski)]) ).

cnf(g14,plain,
    ( ~ sPE(meet_of_subsets(sK4,complements_of_subsets(sK4,sK5)),subset_difference(sK4,sK4,union_of_subsets(sK4,sK5)))
    | ~ sPE(subset_difference(sK4,sK4,union_of_subsets(sK4,sK5)),subset_complement(sK4,union_of_subsets(sK4,sK5)))
    | sPE(meet_of_subsets(sK4,complements_of_subsets(sK4,sK5)),subset_complement(sK4,union_of_subsets(sK4,sK5))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ sPE(meet_of_subsets(sK4,complements_of_subsets(sK4,sK5)),subset_difference(sK4,cast_to_subset(sK4),union_of_subsets(sK4,sK5)))
    | ~ sPE(subset_difference(sK4,cast_to_subset(sK4),union_of_subsets(sK4,sK5)),subset_difference(sK4,sK4,union_of_subsets(sK4,sK5)))
    | sPE(meet_of_subsets(sK4,complements_of_subsets(sK4,sK5)),subset_difference(sK4,sK4,union_of_subsets(sK4,sK5))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g16,plain,
    ( ~ sPE(sK4,sK4)
    | ~ sPE(cast_to_subset(sK4),sK4)
    | ~ sPE(union_of_subsets(sK4,sK5),union_of_subsets(sK4,sK5))
    | sPE(subset_difference(sK4,cast_to_subset(sK4),union_of_subsets(sK4,sK5)),subset_difference(sK4,sK4,union_of_subsets(sK4,sK5))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g17,plain,
    ( ~ sPE(subset_difference(sK4,sK4,union_of_subsets(sK4,sK5)),set_difference(sK4,union_of_subsets(sK4,sK5)))
    | ~ sPE(set_difference(sK4,union_of_subsets(sK4,sK5)),subset_complement(sK4,union_of_subsets(sK4,sK5)))
    | sPE(subset_difference(sK4,sK4,union_of_subsets(sK4,sK5)),subset_complement(sK4,union_of_subsets(sK4,sK5))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU327+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : satcop --statistics %s
% 0.12/0.34  % Computer : n006.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun 19 10:43:55 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 4.21/0.99  % symbols: 33
% 4.21/0.99  % clauses: 132
% 4.21/0.99  % start clauses: 3
% 4.21/0.99  % iterative deepening steps: 531
% 4.21/0.99  % maximum path limit: 4
% 4.21/0.99  % literal attempts: 1365093
% 4.21/0.99  % depth failures: 1191160
% 4.21/0.99  % regularity failures: 8660
% 4.21/0.99  % tautology failures: 6938
% 4.21/0.99  % reductions: 66845
% 4.21/0.99  % extensions: 1297577
% 4.21/0.99  % SAT variables: 229910
% 4.21/0.99  % SAT clauses: 232718
% 4.21/0.99  % WalkSAT solutions: 232714
% 4.21/0.99  % CDCL solutions: 3
% 4.21/0.99  % SZS status Theorem for theBenchmark
% 4.21/0.99  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------