TSTP Solution File: SET693+4 by SATCoP---0.1

View Problem - Process Solution

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

% Computer : n005.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:03:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ( subset(sK4,sK3)
    | equal_set(sK3,union(sK3,sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI20)]) ).

cnf(g1,plain,
    ( ~ subset(sK4,sK3)
    | ~ equal_set(sK3,union(sK3,sK4)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI20)]) ).

cnf(g2,plain,
    ( ~ subset(sK3,union(sK3,sK4))
    | ~ subset(union(sK3,sK4),sK3)
    | equal_set(sK3,union(sK3,sK4)) ),
    inference(ground_cnf,[],[file('Axioms/SET006+0.ax',equal_set)]) ).

cnf(g3,plain,
    ( subset(sK4,sK3)
    | member(sK0(sK4,sK3),sK4) ),
    inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).

cnf(g4,plain,
    ( ~ equal_set(sK3,union(sK3,sK4))
    | subset(union(sK3,sK4),sK3) ),
    inference(ground_cnf,[],[file('Axioms/SET006+0.ax',equal_set)]) ).

cnf(g5,plain,
    ( ~ member(sK0(sK4,sK3),sK3)
    | subset(sK4,sK3) ),
    inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).

cnf(g6,plain,
    ( ~ member(sK0(sK3,union(sK3,sK4)),union(sK3,sK4))
    | subset(sK3,union(sK3,sK4)) ),
    inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).

cnf(g7,plain,
    ( subset(sK3,union(sK3,sK4))
    | member(sK0(sK3,union(sK3,sK4)),sK3) ),
    inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).

cnf(g8,plain,
    ( subset(union(sK3,sK4),sK3)
    | member(sK0(union(sK3,sK4),sK3),union(sK3,sK4)) ),
    inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).

cnf(g9,plain,
    ( ~ member(sK0(union(sK3,sK4),sK3),sK3)
    | subset(union(sK3,sK4),sK3) ),
    inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).

cnf(g10,plain,
    ( ~ member(sK0(sK3,union(sK3,sK4)),sK3)
    | member(sK0(sK3,union(sK3,sK4)),union(sK3,sK4)) ),
    inference(ground_cnf,[],[file('Axioms/SET006+0.ax',union)]) ).

cnf(g11,plain,
    ( ~ member(sK0(union(sK3,sK4),sK3),union(sK3,sK4))
    | member(sK0(union(sK3,sK4),sK3),sK3)
    | member(sK0(union(sK3,sK4),sK3),sK4) ),
    inference(ground_cnf,[],[file('Axioms/SET006+0.ax',union)]) ).

cnf(g12,plain,
    ( ~ member(sK0(sK4,sK3),sK4)
    | member(sK0(sK4,sK3),union(sK3,sK4)) ),
    inference(ground_cnf,[],[file('Axioms/SET006+0.ax',union)]) ).

cnf(g13,plain,
    ( ~ subset(sK4,sK3)
    | ~ member(sK0(union(sK3,sK4),sK3),sK4)
    | member(sK0(union(sK3,sK4),sK3),sK3) ),
    inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).

cnf(g14,plain,
    ( ~ subset(union(sK3,sK4),sK3)
    | ~ member(sK0(sK4,sK3),union(sK3,sK4))
    | member(sK0(sK4,sK3),sK3) ),
    inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET693+4 : TPTP v8.1.0. Released v2.2.0.
% 0.13/0.12  % Command  : satcop --statistics %s
% 0.13/0.33  % Computer : n005.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul 11 05:52:52 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.37  % symbols: 19
% 0.20/0.37  % clauses: 48
% 0.20/0.37  % start clauses: 2
% 0.20/0.37  % iterative deepening steps: 130
% 0.20/0.37  % maximum path limit: 3
% 0.20/0.37  % literal attempts: 19444
% 0.20/0.37  % depth failures: 13897
% 0.20/0.37  % regularity failures: 1131
% 0.20/0.37  % tautology failures: 354
% 0.20/0.37  % reductions: 979
% 0.20/0.37  % extensions: 18323
% 0.20/0.37  % SAT variables: 5338
% 0.20/0.37  % SAT clauses: 6534
% 0.20/0.37  % WalkSAT solutions: 6528
% 0.20/0.37  % CDCL solutions: 0
% 0.20/0.37  % SZS status Theorem for theBenchmark
% 0.20/0.37  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------