TSTP Solution File: PLA002-2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : PLA002-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n017.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:31:55 EDT 2022
% Result : Unsatisfiable 0.13s 0.36s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
situation(s0),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_situation)]) ).
cnf(g1,plain,
( ~ situation(walk(a,climb(b,go(d,s0))))
| ~ at(a,walk(a,climb(b,go(d,s0)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_you_can_get_to_a_in_a_situation)]) ).
cnf(g2,plain,
( ~ situation(climb(b,go(d,s0)))
| ~ at(b,climb(b,go(d,s0)))
| at(a,walk(a,climb(b,go(d,s0)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk_b_to_a)]) ).
cnf(g3,plain,
( ~ situation(go(d,s0))
| situation(climb(b,go(d,s0))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_situation)]) ).
cnf(g4,plain,
( ~ situation(s0)
| situation(go(d,s0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_situation)]) ).
cnf(g5,plain,
( ~ warm(go(d,s0))
| ~ situation(go(d,s0))
| ~ at(d,go(d,s0))
| at(b,climb(b,go(d,s0))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_mountain_d_to_b)]) ).
cnf(g6,plain,
( ~ situation(s0)
| ~ at(f,s0)
| at(d,go(d,s0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_f_to_d)]) ).
cnf(g7,plain,
at(f,s0),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial)]) ).
cnf(g8,plain,
( ~ situation(climb(b,go(d,s0)))
| situation(walk(a,climb(b,go(d,s0)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk_situation)]) ).
cnf(g9,plain,
( ~ situation(drive(a,skate(b,go(c,go(d,s0)))))
| ~ at(a,drive(a,skate(b,go(c,go(d,s0))))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_you_can_get_to_a_in_a_situation)]) ).
cnf(g10,plain,
( ~ situation(skate(b,go(c,go(d,s0))))
| ~ at(b,skate(b,go(c,go(d,s0))))
| at(a,drive(a,skate(b,go(c,go(d,s0))))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',drive_b_to_a)]) ).
cnf(g11,plain,
( ~ cold(go(c,go(d,s0)))
| ~ situation(go(c,go(d,s0)))
| ~ at(c,go(c,go(d,s0)))
| at(b,skate(b,go(c,go(d,s0)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cross_river_c_to_b)]) ).
cnf(g12,plain,
( ~ situation(go(d,s0))
| ~ at(d,go(d,s0))
| at(c,go(c,go(d,s0))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_d_to_c)]) ).
cnf(g13,plain,
( ~ situation(go(d,s0))
| situation(go(c,go(d,s0))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_situation)]) ).
cnf(g14,plain,
( ~ situation(go(d,s0))
| ~ situation(go(c,go(d,s0)))
| warm(go(d,s0))
| cold(go(c,go(d,s0))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',warm_or_cold)]) ).
cnf(g15,plain,
( ~ situation(go(c,go(d,s0)))
| situation(skate(b,go(c,go(d,s0)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',skate_situation)]) ).
cnf(g16,plain,
( ~ situation(skate(b,go(c,go(d,s0))))
| situation(drive(a,skate(b,go(c,go(d,s0))))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',drive_situation)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PLA002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue May 31 18:59:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 % symbols: 18
% 0.13/0.36 % clauses: 23
% 0.13/0.36 % start clauses: 1
% 0.13/0.36 % iterative deepening steps: 292
% 0.13/0.36 % maximum path limit: 8
% 0.13/0.36 % literal attempts: 6518
% 0.13/0.36 % depth failures: 2552
% 0.13/0.36 % regularity failures: 0
% 0.13/0.36 % tautology failures: 0
% 0.13/0.36 % reductions: 0
% 0.13/0.36 % extensions: 6245
% 0.13/0.36 % SAT variables: 16564
% 0.13/0.36 % SAT clauses: 11998
% 0.13/0.36 % WalkSAT solutions: 12002
% 0.13/0.36 % CDCL solutions: 0
% 0.13/0.36 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.36 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------