TSTP Solution File: PRO012+4 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : PRO012+4 : 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 17:53:04 EDT 2022
% Result : Theorem 0.20s 0.42s
% Output : Proof 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
occurrence_of(sK15,tptp0),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g1,plain,
( ~ occurrence_of(sK15,tptp0)
| occurrence_of(sK14(sK15),tptp2)
| occurrence_of(sK14(sK15),tptp1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32)]) ).
cnf(g2,plain,
( ~ occurrence_of(sK15,tptp0)
| occurrence_of(sK12(sK15),tptp3) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32)]) ).
cnf(g3,plain,
( ~ occurrence_of(sK15,tptp0)
| min_precedes(sK13(sK15),sK14(sK15),tptp0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32)]) ).
cnf(g4,plain,
( ~ occurrence_of(sK15,tptp0)
| root_occ(sK12(sK15),sK15) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32)]) ).
cnf(g5,plain,
( ~ occurrence_of(sK15,tptp0)
| min_precedes(sK12(sK15),sK13(sK15),tptp0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32)]) ).
cnf(g6,plain,
sPE(sK15,sK15),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ occurrence_of(sK14(sK15),tptp1)
| ~ atomic(tptp1)
| arboreal(sK14(sK15)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_16)]) ).
cnf(g8,plain,
( ~ occurrence_of(sK12(sK15),tptp3)
| ~ atomic(tptp3)
| arboreal(sK12(sK15)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_16)]) ).
cnf(g9,plain,
( ~ min_precedes(sK13(sK15),sK14(sK15),tptp0)
| subactivity_occurrence(sK14(sK15),sK2(tptp0,sK13(sK15),sK14(sK15))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06)]) ).
cnf(g10,plain,
( ~ min_precedes(sK13(sK15),sK14(sK15),tptp0)
| subactivity_occurrence(sK13(sK15),sK2(tptp0,sK13(sK15),sK14(sK15))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06)]) ).
cnf(g11,plain,
( ~ min_precedes(sK13(sK15),sK14(sK15),tptp0)
| occurrence_of(sK2(tptp0,sK13(sK15),sK14(sK15)),tptp0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06)]) ).
cnf(g12,plain,
( ~ occurrence_of(sK12(sK15),tptp3)
| ~ occurrence_of(sK14(sK15),tptp2)
| ~ root_occ(sK12(sK15),sK15)
| ~ min_precedes(sK12(sK15),sK14(sK15),tptp0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g13,plain,
( ~ occurrence_of(sK12(sK15),tptp3)
| ~ occurrence_of(sK14(sK15),tptp1)
| ~ root_occ(sK12(sK15),sK15)
| ~ min_precedes(sK12(sK15),sK14(sK15),tptp0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g14,plain,
( ~ occurrence_of(sK15,tptp0)
| ~ root_occ(sK14(sK15),sK15)
| ~ min_precedes(sK13(sK15),sK14(sK15),tptp0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_10)]) ).
cnf(g15,plain,
( ~ occurrence_of(sK2(tptp0,sK13(sK15),sK14(sK15)),tptp0)
| ~ subactivity_occurrence(sK12(sK15),sK2(tptp0,sK13(sK15),sK14(sK15)))
| ~ subactivity_occurrence(sK14(sK15),sK2(tptp0,sK13(sK15),sK14(sK15)))
| ~ arboreal(sK12(sK15))
| ~ arboreal(sK14(sK15))
| sPE(sK12(sK15),sK14(sK15))
| min_precedes(sK12(sK15),sK14(sK15),tptp0)
| min_precedes(sK14(sK15),sK12(sK15),tptp0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04)]) ).
cnf(g16,plain,
( ~ occurrence_of(sK2(tptp0,sK13(sK15),sK14(sK15)),tptp0)
| ~ subactivity_occurrence(sK13(sK15),sK2(tptp0,sK13(sK15),sK14(sK15)))
| ~ min_precedes(sK12(sK15),sK13(sK15),tptp0)
| subactivity_occurrence(sK12(sK15),sK2(tptp0,sK13(sK15),sK14(sK15))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_27)]) ).
cnf(g17,plain,
atomic(tptp3),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_38)]) ).
cnf(g18,plain,
atomic(tptp1),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_37)]) ).
cnf(g19,plain,
( ~ occurrence_of(sK14(sK15),tptp2)
| ~ atomic(tptp2)
| arboreal(sK14(sK15)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_16)]) ).
cnf(g20,plain,
atomic(tptp2),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_36)]) ).
cnf(g21,plain,
( ~ sPE(sK12(sK15),sK14(sK15))
| ~ sPE(sK15,sK15)
| ~ root_occ(sK12(sK15),sK15)
| root_occ(sK14(sK15),sK15) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
( ~ occurrence_of(sK15,tptp0)
| ~ root_occ(sK12(sK15),sK15)
| ~ min_precedes(sK14(sK15),sK12(sK15),tptp0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_10)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PRO012+4 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : satcop --statistics %s
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 13 03:50:53 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.42 % symbols: 40
% 0.20/0.42 % clauses: 117
% 0.20/0.42 % start clauses: 3
% 0.20/0.42 % iterative deepening steps: 306
% 0.20/0.42 % maximum path limit: 3
% 0.20/0.42 % literal attempts: 163596
% 0.20/0.42 % depth failures: 136960
% 0.20/0.42 % regularity failures: 1124
% 0.20/0.42 % tautology failures: 6294
% 0.20/0.42 % reductions: 5462
% 0.20/0.42 % extensions: 157292
% 0.20/0.42 % SAT variables: 18717
% 0.20/0.42 % SAT clauses: 24977
% 0.20/0.42 % WalkSAT solutions: 24974
% 0.20/0.42 % CDCL solutions: 0
% 0.20/0.42 % SZS status Theorem for theBenchmark
% 0.20/0.42 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------