TSTP Solution File: ITP006+2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : ITP006+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n027.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 00:30:56 EDT 2022
% Result : Theorem 4.33s 1.33s
% Output : Proof 4.33s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
ne(sK13),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT)]) ).
cnf(g1,plain,
ne(sK14),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT)]) ).
cnf(g2,plain,
mem(sK15,arr(sK14,sK13)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT)]) ).
cnf(g3,plain,
mem(sK16,arr(sK13,bool)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT)]) ).
cnf(g4,plain,
mem(sK17,arr(sK13,bool)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT)]) ).
cnf(g5,plain,
p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK14,sK13),sK15),sK16)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT)]) ).
cnf(g6,plain,
~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK14,sK13),sK15),sK17)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT)]) ).
cnf(g7,plain,
( ~ ne(sK14)
| ~ ne(sK13)
| ~ mem(sK15,arr(sK14,sK13))
| ~ mem(sK17,arr(sK13,bool))
| ~ mem(sK15,arr(sK14,sK13))
| ~ mem(sK17,arr(sK13,bool))
| p(ap(sK17,ap(sK15,sK8(sK14,sK13,sK15,sK17,sK15,sK17))))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK14,sK13),sK15),sK17)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__REWRITES)]) ).
cnf(g8,plain,
( ~ mem(ap(sK15,sK8(sK14,sK13,sK15,sK17,sK15,sK17)),sK13)
| ~ p(ap(sK17,ap(sK15,sK8(sK14,sK13,sK15,sK17,sK15,sK17))))
| p(ap(sK16,ap(sK15,sK8(sK14,sK13,sK15,sK17,sK15,sK17)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT)]) ).
cnf(g9,plain,
( ~ ne(sK14)
| ~ ne(sK13)
| ~ mem(sK15,arr(sK14,sK13))
| ~ mem(sK17,arr(sK13,bool))
| ~ mem(sK15,arr(sK14,sK13))
| ~ mem(sK17,arr(sK13,bool))
| mem(sK8(sK14,sK13,sK15,sK17,sK15,sK17),sK14)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK14,sK13),sK15),sK17)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__REWRITES)]) ).
cnf(g10,plain,
( ~ ne(sK14)
| ~ ne(sK13)
| ~ mem(sK15,arr(sK14,sK13))
| ~ mem(sK16,arr(sK13,bool))
| ~ mem(sK15,arr(sK14,sK13))
| ~ mem(sK16,arr(sK13,bool))
| ~ mem(sK8(sK14,sK13,sK15,sK17,sK15,sK17),sK14)
| ~ p(ap(sK16,ap(sK15,sK8(sK14,sK13,sK15,sK17,sK15,sK17))))
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK14,sK13),sK15),sK16)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__REWRITES)]) ).
cnf(g11,plain,
( ~ mem(sK15,arr(sK14,sK13))
| ~ mem(sK8(sK14,sK13,sK15,sK17,sK15,sK17),sK14)
| mem(ap(sK15,sK8(sK14,sK13,sK15,sK17,sK15,sK17)),sK13) ),
inference(ground_cnf,[],[file('Axioms/ITP001/ITP001+2.ax',ap_tp)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : ITP006+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.03/0.14 % Command : satcop --statistics %s
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 2 21:13:50 EDT 2022
% 0.14/0.35 % CPUTime :
% 4.33/1.33 % symbols: 68
% 4.33/1.33 % clauses: 225
% 4.33/1.33 % start clauses: 8
% 4.33/1.33 % iterative deepening steps: 98
% 4.33/1.33 % maximum path limit: 2
% 4.33/1.33 % literal attempts: 613358
% 4.33/1.33 % depth failures: 537994
% 4.33/1.33 % regularity failures: 502
% 4.33/1.33 % tautology failures: 7307
% 4.33/1.33 % reductions: 55801
% 4.33/1.33 % extensions: 556892
% 4.33/1.33 % SAT variables: 334994
% 4.33/1.33 % SAT clauses: 313447
% 4.33/1.33 % WalkSAT solutions: 313438
% 4.33/1.33 % CDCL solutions: 5
% 4.33/1.33 % SZS status Theorem for theBenchmark
% 4.33/1.33 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------