%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : PUZ129+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n029.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 : Mon Jul 18 18:26:19 EDT 2022

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

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

cnf(g1,plain,
    cyclist(sK7),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)]) ).

cnf(g2,plain,
    sPE(sK6,sK7),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)]) ).

cnf(g3,plain,
    ( ~ cyclist(sK7)
    | property1(sK2(sK7),industrious,pos) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)]) ).

cnf(g4,plain,
    ( ~ property1(sK2(sK7),industrious,pos)
    | ~ grocer(sK2(sK7))
    | property1(sK1(sK2(sK7)),honest,pos) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)]) ).

cnf(g5,plain,
    ( ~ property1(sK2(sK7),industrious,pos)
    | ~ grocer(sK2(sK7))
    | sPE(sK2(sK7),sK1(sK2(sK7))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)]) ).

cnf(g6,plain,
    ( ~ cyclist(sK7)
    | sPE(sK7,sK2(sK7)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)]) ).

cnf(g7,plain,
    ( ~ sPE(sK7,sK2(sK7))
    | ~ person(sK7)
    | person(sK2(sK7)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    ( ~ sPE(sK6,sK7)
    | ~ grocer(sK6)
    | grocer(sK7) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

cnf(g10,plain,
    ( ~ sPE(sK2(sK7),sK1(sK2(sK7)))
    | ~ sPE(industrious,industrious)
    | ~ sPE(pos,pos)
    | ~ property1(sK2(sK7),industrious,pos)
    | property1(sK1(sK2(sK7)),industrious,pos) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    sPE(industrious,industrious),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ person(sK1(sK2(sK7)))
    | ~ property1(sK1(sK2(sK7)),honest,pos)
    | ~ property1(sK1(sK2(sK7)),industrious,pos)
    | property1(sK0(sK1(sK2(sK7))),healthy,pos) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)]) ).

cnf(g13,plain,
    ( ~ person(sK1(sK2(sK7)))
    | ~ property1(sK1(sK2(sK7)),honest,pos)
    | ~ property1(sK1(sK2(sK7)),industrious,pos)
    | sPE(sK1(sK2(sK7)),sK0(sK1(sK2(sK7)))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)]) ).

cnf(g14,plain,
    ( ~ sPE(sK2(sK7),sK1(sK2(sK7)))
    | ~ grocer(sK2(sK7))
    | grocer(sK1(sK2(sK7))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ sPE(sK2(sK7),sK1(sK2(sK7)))
    | ~ person(sK2(sK7))
    | person(sK1(sK2(sK7))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g16,plain,
    ( ~ sPE(sK6,sK7)
    | ~ sPE(sK7,sK2(sK7))
    | sPE(sK6,sK2(sK7)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g17,plain,
    ( ~ sPE(sK6,sK2(sK7))
    | ~ grocer(sK6)
    | grocer(sK2(sK7)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g18,plain,
    ( ~ grocer(sK7)
    | person(sK4(sK7)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)]) ).

cnf(g19,plain,
    ( ~ grocer(sK7)
    | sPE(sK7,sK4(sK7)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)]) ).

cnf(g20,plain,
    ( ~ sPE(sK7,sK4(sK7))
    | sPE(sK4(sK7),sK7) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g21,plain,
    ( ~ sPE(sK4(sK7),sK7)
    | ~ person(sK4(sK7))
    | person(sK7) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g22,plain,
    ( ~ sPE(sK1(sK2(sK7)),sK0(sK1(sK2(sK7))))
    | ~ property1(sK0(sK1(sK2(sK7))),healthy,pos)
    | ~ grocer(sK1(sK2(sK7))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PUZ129+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : satcop --statistics %s
% 0.13/0.33  % Computer : n029.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 : Sat May 28 21:20:27 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.38  % symbols: 20
% 0.20/0.38  % clauses: 31
% 0.20/0.38  % start clauses: 18
% 0.20/0.38  % iterative deepening steps: 199
% 0.20/0.38  % maximum path limit: 2
% 0.20/0.38  % literal attempts: 38729
% 0.20/0.38  % depth failures: 30575
% 0.20/0.38  % regularity failures: 52
% 0.20/0.38  % tautology failures: 291
% 0.20/0.38  % reductions: 217
% 0.20/0.38  % extensions: 35311
% 0.20/0.38  % SAT variables: 9836
% 0.20/0.38  % SAT clauses: 12023
% 0.20/0.38  % WalkSAT solutions: 12018
% 0.20/0.38  % CDCL solutions: 0
% 0.20/0.38  % SZS status Theorem for theBenchmark
% 0.20/0.38  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------