%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : PLA002-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:20:21 AM UTC 2026
% Result : Unsatisfiable 0.84s 0.57s
% Output : CNFRefutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 52 ( 17 unt; 0 def)
% Number of atoms : 131 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 152 ( 73 ~; 79 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 68 ( 28 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(warm_or_cold,axiom,
! [VAR_0,VAR_1] :
( ~ situation(VAR_1)
| ~ situation(VAR_0)
| cold(VAR_1)
| warm(VAR_0) ),
file('theBenchmark.p',warm_or_cold) ).
cnf(c_2,plain,
( ~ situation(B)
| ~ situation(A)
| cold(B)
| warm(A) ),
inference(clausify,[status(thm)],[warm_or_cold]) ).
fof(climb_mountain_d_to_b,axiom,
! [VAR_0] :
( ~ situation(VAR_0)
| at(b,climb(b,VAR_0))
| ~ at(d,VAR_0)
| ~ warm(VAR_0) ),
file('theBenchmark.p',climb_mountain_d_to_b) ).
cnf(c_3,plain,
( ~ situation(A)
| at(b,climb(b,A))
| ~ at(d,A)
| ~ warm(A) ),
inference(clausify,[status(thm)],[climb_mountain_d_to_b]) ).
fof(cross_river_c_to_b,axiom,
! [VAR_0] :
( ~ situation(VAR_0)
| at(b,skate(b,VAR_0))
| ~ at(c,VAR_0)
| ~ cold(VAR_0) ),
file('theBenchmark.p',cross_river_c_to_b) ).
cnf(c_4,plain,
( ~ situation(A)
| at(b,skate(b,A))
| ~ at(c,A)
| ~ cold(A) ),
inference(clausify,[status(thm)],[cross_river_c_to_b]) ).
cnf(c_6,plain,
( ~ situation(B)
| ~ situation(A)
| cold(B)
| ~ situation(A)
| at(b,climb(b,A))
| ~ at(d,A) ),
inference(resolve,[status(thm)],[c_3,c_2]) ).
cnf(c_12,plain,
( ~ situation(A)
| ~ situation(B)
| ~ situation(B)
| at(b,climb(b,B))
| ~ at(d,B)
| ~ situation(A)
| at(b,skate(b,A))
| ~ at(c,A) ),
inference(resolve,[status(thm)],[c_4,c_6]) ).
cnf(c_4628,plain,
( ~ situation(A)
| ~ situation(B)
| at(b,climb(b,B))
| ~ at(d,B)
| ~ situation(A)
| at(b,skate(b,A))
| ~ at(c,A) ),
inference(copy,[status(thm)],[c_12]) ).
cnf(c_13,plain,
( ~ situation(B)
| at(b,climb(b,B))
| ~ at(d,B)
| ~ situation(A)
| at(b,skate(b,A))
| ~ at(c,A) ),
inference(copy,[status(thm)],[c_4628]) ).
fof(drive_b_to_a,axiom,
! [VAR_0] :
( ~ situation(VAR_0)
| at(a,drive(a,VAR_0))
| ~ at(b,VAR_0) ),
file('theBenchmark.p',drive_b_to_a) ).
cnf(c_19,plain,
( ~ situation(A)
| at(a,drive(a,A))
| ~ at(b,A) ),
inference(clausify,[status(thm)],[drive_b_to_a]) ).
fof(go_d_to_c,axiom,
! [VAR_0] :
( ~ situation(VAR_0)
| at(c,go(c,VAR_0))
| ~ at(d,VAR_0) ),
file('theBenchmark.p',go_d_to_c) ).
cnf(c_21,plain,
( ~ situation(A)
| at(c,go(c,A))
| ~ at(d,A) ),
inference(clausify,[status(thm)],[go_d_to_c]) ).
fof(go_f_to_d,axiom,
! [VAR_0] :
( ~ situation(VAR_0)
| at(d,go(d,VAR_0))
| ~ at(f,VAR_0) ),
file('theBenchmark.p',go_f_to_d) ).
cnf(c_25,plain,
( ~ situation(A)
| at(d,go(d,A))
| ~ at(f,A) ),
inference(clausify,[status(thm)],[go_f_to_d]) ).
fof(initial_situation,axiom,
situation(s0),
file('theBenchmark.p',initial_situation) ).
cnf(c_26,plain,
situation(s0),
inference(clausify,[status(thm)],[initial_situation]) ).
fof(drive_situation,axiom,
! [VAR_0,VAR_1] :
( situation(drive(VAR_1,VAR_0))
| ~ situation(VAR_0) ),
file('theBenchmark.p',drive_situation) ).
cnf(c_28,plain,
( situation(drive(B,A))
| ~ situation(A) ),
inference(clausify,[status(thm)],[drive_situation]) ).
fof(climb_situation,axiom,
! [VAR_0,VAR_1] :
( situation(climb(VAR_1,VAR_0))
| ~ situation(VAR_0) ),
file('theBenchmark.p',climb_situation) ).
cnf(c_29,plain,
( situation(climb(B,A))
| ~ situation(A) ),
inference(clausify,[status(thm)],[climb_situation]) ).
fof(skate_situation,axiom,
! [VAR_0,VAR_1] :
( situation(skate(VAR_1,VAR_0))
| ~ situation(VAR_0) ),
file('theBenchmark.p',skate_situation) ).
cnf(c_30,plain,
( situation(skate(B,A))
| ~ situation(A) ),
inference(clausify,[status(thm)],[skate_situation]) ).
fof(go_situation,axiom,
! [VAR_0,VAR_1] :
( situation(go(VAR_1,VAR_0))
| ~ situation(VAR_0) ),
file('theBenchmark.p',go_situation) ).
cnf(c_31,plain,
( situation(go(B,A))
| ~ situation(A) ),
inference(clausify,[status(thm)],[go_situation]) ).
fof(initial,axiom,
at(f,s0),
file('theBenchmark.p',initial) ).
cnf(c_32,plain,
at(f,s0),
inference(clausify,[status(thm)],[initial]) ).
fof(prove_you_can_get_to_a_in_a_situation,axiom,
! [VAR_0] :
( ~ situation(VAR_0)
| ~ at(a,VAR_0) ),
file('theBenchmark.p',prove_you_can_get_to_a_in_a_situation) ).
cnf(c_33,plain,
( ~ situation(A)
| ~ at(a,A) ),
inference(clausify,[status(thm)],[prove_you_can_get_to_a_in_a_situation]) ).
cnf(c_42,plain,
situation(go(A,s0)),
inference(resolve,[status(thm)],[c_31,c_26]) ).
cnf(c_4629,plain,
( ~ situation(s0)
| at(d,go(d,s0)) ),
inference(resolve,[status(thm)],[c_32,c_25]) ).
cnf(c_43,plain,
at(d,go(d,s0)),
inference(resolve,[status(thm)],[c_26,c_4629]) ).
cnf(c_70,plain,
situation(go(A,go(B,s0))),
inference(resolve,[status(thm)],[c_42,c_31]) ).
cnf(c_72,plain,
situation(climb(A,go(B,s0))),
inference(resolve,[status(thm)],[c_42,c_29]) ).
cnf(c_4630,plain,
( ~ situation(go(d,s0))
| at(c,go(c,go(d,s0))) ),
inference(resolve,[status(thm)],[c_43,c_21]) ).
cnf(c_79,plain,
at(c,go(c,go(d,s0))),
inference(resolve,[status(thm)],[c_42,c_4630]) ).
cnf(c_4631,plain,
( ~ situation(go(d,s0))
| at(b,climb(b,go(d,s0)))
| ~ situation(A)
| at(b,skate(b,A))
| ~ at(c,A) ),
inference(resolve,[status(thm)],[c_43,c_13]) ).
cnf(c_80,plain,
( at(b,climb(b,go(d,s0)))
| ~ situation(A)
| at(b,skate(b,A))
| ~ at(c,A) ),
inference(resolve,[status(thm)],[c_42,c_4631]) ).
cnf(c_204,plain,
situation(skate(A,go(B,go(C,s0)))),
inference(resolve,[status(thm)],[c_70,c_30]) ).
cnf(c_219,plain,
situation(drive(A,climb(B,go(C,s0)))),
inference(resolve,[status(thm)],[c_72,c_28]) ).
cnf(c_4632,plain,
( at(b,climb(b,go(d,s0)))
| ~ situation(go(c,go(d,s0)))
| at(b,skate(b,go(c,go(d,s0)))) ),
inference(resolve,[status(thm)],[c_80,c_79]) ).
cnf(c_266,plain,
( at(b,climb(b,go(d,s0)))
| at(b,skate(b,go(c,go(d,s0)))) ),
inference(resolve,[status(thm)],[c_70,c_4632]) ).
cnf(c_820,plain,
~ at(a,drive(A,climb(B,go(C,s0)))),
inference(resolve,[status(thm)],[c_33,c_219]) ).
cnf(c_953,plain,
situation(drive(A,skate(B,go(C,go(D,s0))))),
inference(resolve,[status(thm)],[c_204,c_28]) ).
cnf(c_4633,plain,
( ~ situation(skate(b,go(c,go(d,s0))))
| at(a,drive(a,skate(b,go(c,go(d,s0)))))
| at(b,climb(b,go(d,s0))) ),
inference(resolve,[status(thm)],[c_266,c_19]) ).
cnf(c_1172,plain,
( at(a,drive(a,skate(b,go(c,go(d,s0)))))
| at(b,climb(b,go(d,s0))) ),
inference(resolve,[status(thm)],[c_204,c_4633]) ).
cnf(c_4634,plain,
( ~ situation(climb(A,go(B,s0)))
| ~ at(b,climb(A,go(B,s0))) ),
inference(resolve,[status(thm)],[c_19,c_820]) ).
cnf(c_1180,plain,
~ at(b,climb(A,go(B,s0))),
inference(resolve,[status(thm)],[c_4634,c_72]) ).
cnf(c_1182,plain,
at(a,drive(a,skate(b,go(c,go(d,s0))))),
inference(resolve,[status(thm)],[c_1180,c_1172]) ).
cnf(c_4626,plain,
~ at(a,drive(A,skate(B,go(C,go(D,s0))))),
inference(resolve,[status(thm)],[c_33,c_953]) ).
cnf(c_4627,plain,
$false,
inference(resolve,[status(thm)],[c_4626,c_1182]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PLA002-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.37 % Computer : n010.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Sat Sep 26 04:42:31 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.37 % Process 2499237 was started by sandbox2 on n010,
% 0.08/0.37 % Sat Sep 26 04:42:31 2026
% 0.08/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.38
% 0.08/0.38 % From the command line: assign(max_seconds, 300).
% 0.84/0.57
% 0.84/0.57 % given #500 (T,wt=35): 375 situation(walk(A,climb(B,go(C,drive(D,s0))))). [resolve(108,a,27,a)].
% 0.84/0.57
% 0.84/0.57 % given #1000 (A,wt=37): 701 situation(skate(A,skate(B,drive(C,skate(D,s0))))). [resolve(186,a,30,a)].
% 0.84/0.57
% 0.84/0.57 % SZS status Unsatisfiable for theBenchmark
% 0.84/0.57
% 0.84/0.57 % Proof 1 at 0.13 (+ 0.06) seconds.
% 0.84/0.57 % Length of proof is 32.
% 0.84/0.57 % Level of proof is 8.
% 0.84/0.57 % Maximum clause weight is 45.000.
% 0.84/0.57 % Given clauses 1254.
% 0.84/0.57
% 0.84/0.57 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------