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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n023.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 : Sun Jul 17 22:24:16 EDT 2022

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

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

cnf(g1,plain,
    organization(sK0,sK6),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL)]) ).

cnf(g2,plain,
    reorganization_free(sK0,sK5,sK6),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL)]) ).

cnf(g3,plain,
    complexity(sK0,sK1,sK5),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL)]) ).

cnf(g4,plain,
    complexity(sK0,sK2,sK6),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL)]) ).

cnf(g5,plain,
    size(sK0,sK3,sK5),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL)]) ).

cnf(g6,plain,
    size(sK0,sK4,sK6),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL)]) ).

cnf(g7,plain,
    greater(sK4,sK3),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL)]) ).

cnf(g8,plain,
    greater(sK1,sK2),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL)]) ).

cnf(g9,plain,
    ( ~ organization(sK0,sK5)
    | time(sK5) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp15)]) ).

cnf(g10,plain,
    ( ~ organization(sK0,sK6)
    | time(sK6) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp15)]) ).

cnf(g11,plain,
    ( ~ reorganization_free(sK0,sK5,sK6)
    | reorganization_free(sK0,sK6,sK5) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp17)]) ).

cnf(g12,plain,
    ( ~ sPE(sK4,sK3)
    | ~ greater(sK4,sK3) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_1)]) ).

cnf(g13,plain,
    ( ~ greater(sK1,sK2)
    | ~ greater(sK6,sK5)
    | ~ organization(sK0,sK5)
    | ~ organization(sK0,sK6)
    | ~ reorganization_free(sK0,sK5,sK6)
    | ~ complexity(sK0,sK1,sK5)
    | ~ complexity(sK0,sK2,sK6) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL)]) ).

cnf(g14,plain,
    ( ~ time(sK6)
    | ~ time(sK5)
    | sPE(sK6,sK5)
    | greater(sK6,sK5)
    | greater(sK5,sK6) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp16)]) ).

cnf(g15,plain,
    ( ~ greater(sK4,sK3)
    | ~ greater(sK5,sK6)
    | ~ organization(sK0,sK6)
    | ~ organization(sK0,sK5)
    | ~ reorganization_free(sK0,sK6,sK5)
    | ~ size(sK0,sK4,sK6)
    | ~ size(sK0,sK3,sK5) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL)]) ).

cnf(g16,plain,
    ( ~ sPE(sK6,sK5)
    | ~ organization(sK0,sK6)
    | ~ organization(sK0,sK5)
    | ~ size(sK0,sK4,sK6)
    | ~ size(sK0,sK3,sK5)
    | sPE(sK4,sK3) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp19)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13  % Command  : satcop --statistics %s
% 0.13/0.35  % Computer : n023.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Thu Jun  9 11:41:23 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  % symbols: 15
% 0.13/0.36  % clauses: 26
% 0.13/0.36  % start clauses: 9
% 0.13/0.36  % iterative deepening steps: 53
% 0.13/0.36  % maximum path limit: 2
% 0.13/0.36  % literal attempts: 5713
% 0.13/0.36  % depth failures: 3904
% 0.13/0.36  % regularity failures: 32
% 0.13/0.36  % tautology failures: 373
% 0.13/0.36  % reductions: 361
% 0.13/0.36  % extensions: 4954
% 0.13/0.36  % SAT variables: 842
% 0.13/0.36  % SAT clauses: 1392
% 0.13/0.36  % WalkSAT solutions: 1386
% 0.13/0.36  % CDCL solutions: 0
% 0.13/0.36  % SZS status Theorem for theBenchmark
% 0.13/0.36  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------