TSTP Solution File: COL023-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : COL023-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n018.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 : Fri Jul 15 00:41:12 EDT 2022
% Result : Unsatisfiable 0.12s 0.35s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(apply(apply(apply(n,apply(n,b)),apply(b,combinator)),apply(n,apply(n,b))),apply(combinator,apply(apply(apply(n,apply(n,b)),apply(b,combinator)),apply(n,apply(n,b))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_fixed_point)]) ).
cnf(g1,plain,
( ~ sPE(apply(apply(apply(n,apply(n,b)),apply(b,combinator)),apply(n,apply(n,b))),apply(apply(apply(b,combinator),apply(apply(n,apply(n,b)),apply(b,combinator))),apply(n,apply(n,b))))
| ~ sPE(apply(apply(apply(b,combinator),apply(apply(n,apply(n,b)),apply(b,combinator))),apply(n,apply(n,b))),apply(combinator,apply(apply(apply(n,apply(n,b)),apply(b,combinator)),apply(n,apply(n,b)))))
| sPE(apply(apply(apply(n,apply(n,b)),apply(b,combinator)),apply(n,apply(n,b))),apply(combinator,apply(apply(apply(n,apply(n,b)),apply(b,combinator)),apply(n,apply(n,b))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(apply(apply(apply(b,combinator),apply(apply(n,apply(n,b)),apply(b,combinator))),apply(n,apply(n,b))),apply(combinator,apply(apply(apply(n,apply(n,b)),apply(b,combinator)),apply(n,apply(n,b))))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition)]) ).
cnf(g3,plain,
( ~ sPE(apply(apply(apply(n,apply(n,b)),apply(b,combinator)),apply(n,apply(n,b))),apply(apply(apply(apply(n,b),apply(n,apply(n,b))),apply(b,combinator)),apply(n,apply(n,b))))
| ~ sPE(apply(apply(apply(apply(n,b),apply(n,apply(n,b))),apply(b,combinator)),apply(n,apply(n,b))),apply(apply(apply(b,combinator),apply(apply(n,apply(n,b)),apply(b,combinator))),apply(n,apply(n,b))))
| sPE(apply(apply(apply(n,apply(n,b)),apply(b,combinator)),apply(n,apply(n,b))),apply(apply(apply(b,combinator),apply(apply(n,apply(n,b)),apply(b,combinator))),apply(n,apply(n,b)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(apply(apply(apply(n,apply(n,b)),apply(b,combinator)),apply(n,apply(n,b))),apply(apply(apply(apply(n,b),apply(n,apply(n,b))),apply(b,combinator)),apply(n,apply(n,b)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_definition)]) ).
cnf(g5,plain,
( ~ sPE(apply(apply(apply(n,b),apply(n,apply(n,b))),apply(b,combinator)),apply(apply(b,combinator),apply(apply(n,apply(n,b)),apply(b,combinator))))
| ~ sPE(apply(n,apply(n,b)),apply(n,apply(n,b)))
| sPE(apply(apply(apply(apply(n,b),apply(n,apply(n,b))),apply(b,combinator)),apply(n,apply(n,b))),apply(apply(apply(b,combinator),apply(apply(n,apply(n,b)),apply(b,combinator))),apply(n,apply(n,b)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ sPE(apply(apply(apply(n,b),apply(n,apply(n,b))),apply(b,combinator)),apply(apply(apply(b,apply(b,combinator)),apply(n,apply(n,b))),apply(b,combinator)))
| ~ sPE(apply(apply(apply(b,apply(b,combinator)),apply(n,apply(n,b))),apply(b,combinator)),apply(apply(b,combinator),apply(apply(n,apply(n,b)),apply(b,combinator))))
| sPE(apply(apply(apply(n,b),apply(n,apply(n,b))),apply(b,combinator)),apply(apply(b,combinator),apply(apply(n,apply(n,b)),apply(b,combinator)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
sPE(apply(apply(apply(b,apply(b,combinator)),apply(n,apply(n,b))),apply(b,combinator)),apply(apply(b,combinator),apply(apply(n,apply(n,b)),apply(b,combinator)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition)]) ).
cnf(g8,plain,
sPE(apply(apply(apply(n,b),apply(n,apply(n,b))),apply(b,combinator)),apply(apply(apply(b,apply(b,combinator)),apply(n,apply(n,b))),apply(b,combinator))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_definition)]) ).
cnf(g9,plain,
sPE(apply(n,apply(n,b)),apply(n,apply(n,b))),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COL023-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n018.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 : Tue May 31 15:34:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 % symbols: 6
% 0.12/0.35 % clauses: 7
% 0.12/0.35 % start clauses: 1
% 0.12/0.35 % iterative deepening steps: 218
% 0.12/0.35 % maximum path limit: 7
% 0.12/0.35 % literal attempts: 5112
% 0.12/0.35 % depth failures: 2275
% 0.12/0.35 % regularity failures: 365
% 0.12/0.35 % tautology failures: 327
% 0.12/0.35 % reductions: 0
% 0.12/0.35 % extensions: 5079
% 0.12/0.35 % SAT variables: 3759
% 0.12/0.35 % SAT clauses: 4836
% 0.12/0.35 % WalkSAT solutions: 4834
% 0.12/0.35 % CDCL solutions: 0
% 0.12/0.35 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.35 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------