TSTP Solution File: PUZ001+2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : PUZ001+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n023.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:07 EDT 2022
% Result : Theorem 2.64s 0.85s
% Output : Proof 2.64s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
sPE('AuntAgatha','AuntAgatha'),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g1,plain,
( sPE('AuntAgatha','Butler')
| predicate2(sK4('AuntAgatha'),hate,'AuntAgatha','AuntAgatha') ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
cnf(g2,plain,
sPE(kill,kill),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
predicate2(sK2,kill,sK0,'AuntAgatha'),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
cnf(g4,plain,
( sPE(sK0,sK5(sK0))
| predicate2(sK6(sK0),hate,'Butler',sK0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
cnf(g5,plain,
( ~ predicate1(sK1,live,sK0)
| ~ modifier_pp(sK1,in,'DreadburyMansion')
| sPE(sK0,'AuntAgatha')
| sPE(sK0,'Butler')
| sPE(sK0,'Charles') ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
cnf(g6,plain,
modifier_pp(sK1,in,'DreadburyMansion'),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
cnf(g7,plain,
predicate1(sK1,live,sK0),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
cnf(g8,plain,
~ predicate2(sK2,kill,'AuntAgatha','AuntAgatha'),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)]) ).
cnf(g9,plain,
( ~ sPE(sK2,sK2)
| ~ sPE(kill,kill)
| ~ sPE(sK0,'AuntAgatha')
| ~ sPE('AuntAgatha','AuntAgatha')
| ~ predicate2(sK2,kill,sK0,'AuntAgatha')
| predicate2(sK2,kill,'AuntAgatha','AuntAgatha') ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
sPE(sK2,sK2),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(sK0,'Butler')
| sPE(sK6(sK0),sK6('Butler')) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
sPE(hate,hate),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
~ sPE('AuntAgatha','Butler'),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
cnf(g14,plain,
sPE('Butler','Butler'),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(sK2,sK2)
| ~ sPE(kill,kill)
| ~ sPE(sK0,'Charles')
| ~ sPE('AuntAgatha','AuntAgatha')
| ~ predicate2(sK2,kill,sK0,'AuntAgatha')
| predicate2(sK2,kill,'Charles','AuntAgatha') ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( predicate2(sK6(sK0),hate,'Butler',sK0)
| property2(sK5(sK0),rich,comp_than,'AuntAgatha') ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
cnf(g17,plain,
( ~ sPE(sK0,sK5(sK0))
| ~ predicate2(sK2,kill,sK0,'AuntAgatha')
| ~ property2(sK5(sK0),rich,comp_than,'AuntAgatha') ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
cnf(g18,plain,
( ~ sPE(sK6(sK0),sK6('Butler'))
| ~ sPE(hate,hate)
| ~ sPE('Butler','Butler')
| ~ sPE(sK0,'Butler')
| ~ predicate2(sK6(sK0),hate,'Butler',sK0)
| predicate2(sK6('Butler'),hate,'Butler','Butler') ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
sPE(sK6('Butler'),sK6('Butler')),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ predicate2(sK2,kill,'Charles','AuntAgatha')
| predicate2(sK3('Charles','AuntAgatha',sK2),hate,'Charles','AuntAgatha') ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
cnf(g21,plain,
( sPE(sK8('Butler'),'Butler')
| predicate2(sK4(sK8('Butler')),hate,'AuntAgatha',sK8('Butler')) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
cnf(g22,plain,
( ~ sPE(sK8('Butler'),'Butler')
| sPE('Butler',sK8('Butler')) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ predicate2(sK4('AuntAgatha'),hate,'AuntAgatha','AuntAgatha')
| ~ predicate2(sK3('Charles','AuntAgatha',sK2),hate,'Charles','AuntAgatha') ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
cnf(g24,plain,
( ~ sPE(sK6('Butler'),sK6('Butler'))
| ~ sPE(hate,hate)
| ~ sPE('Butler','Butler')
| ~ sPE('Butler',sK8('Butler'))
| ~ predicate2(sK6('Butler'),hate,'Butler','Butler')
| predicate2(sK6('Butler'),hate,'Butler',sK8('Butler')) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
~ predicate2(sK6('Butler'),hate,'Butler',sK8('Butler')),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
cnf(g26,plain,
( ~ predicate2(sK4(sK8('Butler')),hate,'AuntAgatha',sK8('Butler'))
| predicate2(sK7(sK8('Butler'),sK4(sK8('Butler'))),hate,'Butler',sK8('Butler')) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
cnf(g27,plain,
~ predicate2(sK7(sK8('Butler'),sK4(sK8('Butler'))),hate,'Butler',sK8('Butler')),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',background)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PUZ001+2 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.12 % Command : satcop --statistics %s
% 0.13/0.33 % Computer : n023.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 : Sun May 29 00:58:57 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.64/0.85 % symbols: 25
% 2.64/0.85 % clauses: 28
% 2.64/0.85 % start clauses: 1
% 2.64/0.85 % iterative deepening steps: 764
% 2.64/0.85 % maximum path limit: 7
% 2.64/0.85 % literal attempts: 410639
% 2.64/0.85 % depth failures: 266527
% 2.64/0.85 % regularity failures: 15284
% 2.64/0.85 % tautology failures: 45810
% 2.64/0.85 % reductions: 5671
% 2.64/0.85 % extensions: 404541
% 2.64/0.85 % SAT variables: 72384
% 2.64/0.85 % SAT clauses: 90461
% 2.64/0.85 % WalkSAT solutions: 90459
% 2.64/0.85 % CDCL solutions: 0
% 2.64/0.85 % SZS status Theorem for theBenchmark
% 2.64/0.85 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------