TSTP Solution File: SET586+3 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SET586+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n003.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 05:02:11 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    subset(sK2,sK3),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_intersection_of_subset)]) ).

cnf(g1,plain,
    ~ subset(intersection(sK2,sK4),intersection(sK3,sK4)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_intersection_of_subset)]) ).

cnf(g2,plain,
    ( ~ member(sK0(intersection(sK2,sK4),intersection(sK3,sK4)),intersection(sK3,sK4))
    | subset(intersection(sK2,sK4),intersection(sK3,sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn)]) ).

cnf(g3,plain,
    ( member(sK0(intersection(sK2,sK4),intersection(sK3,sK4)),intersection(sK2,sK4))
    | subset(intersection(sK2,sK4),intersection(sK3,sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn)]) ).

cnf(g4,plain,
    ( ~ member(sK0(intersection(sK2,sK4),intersection(sK3,sK4)),intersection(sK2,sK4))
    | member(sK0(intersection(sK2,sK4),intersection(sK3,sK4)),sK4) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn)]) ).

cnf(g5,plain,
    ( ~ member(sK0(intersection(sK2,sK4),intersection(sK3,sK4)),intersection(sK2,sK4))
    | member(sK0(intersection(sK2,sK4),intersection(sK3,sK4)),sK2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn)]) ).

cnf(g6,plain,
    sPE(intersection(sK3,sK4),intersection(sK4,sK3)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection)]) ).

cnf(g7,plain,
    ( ~ sPE(intersection(sK3,sK4),intersection(sK4,sK3))
    | ~ member(sK0(intersection(sK2,sK4),intersection(sK3,sK4)),intersection(sK4,sK3))
    | member(sK0(intersection(sK2,sK4),intersection(sK3,sK4)),intersection(sK3,sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn)]) ).

cnf(g8,plain,
    ( ~ member(sK0(intersection(sK2,sK4),intersection(sK3,sK4)),sK4)
    | ~ member(sK0(intersection(sK2,sK4),intersection(sK3,sK4)),sK3)
    | member(sK0(intersection(sK2,sK4),intersection(sK3,sK4)),intersection(sK4,sK3)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn)]) ).

cnf(g9,plain,
    ( ~ member(sK0(intersection(sK2,sK4),intersection(sK3,sK4)),sK2)
    | ~ subset(sK2,sK3)
    | member(sK0(intersection(sK2,sK4),intersection(sK3,sK4)),sK3) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SET586+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n003.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 : Mon Jul 11 07:24:15 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.36  % symbols: 11
% 0.18/0.36  % clauses: 25
% 0.18/0.36  % start clauses: 2
% 0.18/0.36  % iterative deepening steps: 217
% 0.18/0.36  % maximum path limit: 4
% 0.18/0.36  % literal attempts: 35746
% 0.18/0.36  % depth failures: 26370
% 0.18/0.36  % regularity failures: 1230
% 0.18/0.36  % tautology failures: 1523
% 0.18/0.36  % reductions: 680
% 0.18/0.36  % extensions: 34803
% 0.18/0.36  % SAT variables: 3778
% 0.18/0.36  % SAT clauses: 6090
% 0.18/0.36  % WalkSAT solutions: 6088
% 0.18/0.36  % CDCL solutions: 0
% 0.18/0.36  % SZS status Theorem for theBenchmark
% 0.18/0.36  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------