%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : NUM571+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n009.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 14:02:04 EDT 2022
% Result : Theorem 104.04s 13.45s
% Output : Proof 104.65s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__)]) ).
cnf(g1,plain,
( sPE(xi,sz00)
| isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3702_02)]) ).
cnf(g2,plain,
( sPE(xi,sz00)
| aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3702_02)]) ).
cnf(g3,plain,
( ~ sPE(xS,sdtlpdtrp0(xN,xi))
| ~ isCountable0(xS)
| isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
isCountable0(xS),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435)]) ).
cnf(g5,plain,
( ~ sPE(sdtlpdtrp0(xN,xi),xS)
| sPE(xS,sdtlpdtrp0(xN,xi)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
aSubsetOf0(xS,szNzAzT0),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435)]) ).
cnf(g7,plain,
sPE(szNzAzT0,szNzAzT0),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(xS,sdtlpdtrp0(xN,xi))
| ~ sPE(szNzAzT0,szNzAzT0)
| ~ aSubsetOf0(xS,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
sPE(xN,xN),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
sPE(sdtlpdtrp0(xN,sz00),xS),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3623)]) ).
cnf(g11,plain,
( ~ sPE(xN,xN)
| ~ sPE(xi,sz00)
| sPE(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,sz00)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,sz00))
| ~ sPE(sdtlpdtrp0(xN,sz00),xS)
| sPE(sdtlpdtrp0(xN,xi),xS) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM571+3 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.12 % Command : satcop --statistics %s
% 0.13/0.33 % Computer : n009.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 : Wed Jul 6 06:12:07 EDT 2022
% 0.13/0.33 % CPUTime :
% 104.04/13.45 % symbols: 78
% 104.04/13.45 % clauses: 302
% 104.04/13.45 % start clauses: 3
% 104.04/13.45 % iterative deepening steps: 1046
% 104.04/13.45 % maximum path limit: 4
% 104.04/13.45 % literal attempts: 50251328
% 104.04/13.45 % depth failures: 48942859
% 104.04/13.45 % regularity failures: 257762
% 104.04/13.45 % tautology failures: 117609
% 104.04/13.45 % reductions: 47818
% 104.04/13.45 % extensions: 50200654
% 104.04/13.45 % SAT variables: 1643071
% 104.04/13.45 % SAT clauses: 1520944
% 104.04/13.45 % WalkSAT solutions: 1520941
% 104.04/13.45 % CDCL solutions: 1
% 104.04/13.45 % SZS status Theorem for theBenchmark
% 104.04/13.45 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------