%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : PLA001-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.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:20 AM UTC 2026
% Result : Unsatisfiable 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 21 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 18 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 47 ( 12 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(drive1,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( at(VAR_4,VAR_1,s(s(VAR_2)),drive(VAR_4,VAR_3))
| ~ next_to(VAR_0,VAR_4)
| ~ at(VAR_0,VAR_1,VAR_2,VAR_3) ),
file('theBenchmark.p',drive1) ).
cnf(c_3,plain,
( at(E,B,s(s(C)),drive(E,D))
| ~ next_to(A,E)
| ~ at(A,B,C,D) ),
inference(clausify,[status(thm)],[drive1]) ).
fof(map6,axiom,
next_to(cheyenne,northPlatte),
file('theBenchmark.p',map6) ).
cnf(c_8,plain,
next_to(cheyenne,northPlatte),
inference(clausify,[status(thm)],[map6]) ).
fof(map7,axiom,
next_to(northPlatte,grandIsland),
file('theBenchmark.p',map7) ).
cnf(c_9,plain,
next_to(northPlatte,grandIsland),
inference(clausify,[status(thm)],[map7]) ).
fof(map8,axiom,
next_to(grandIsland,lincoln),
file('theBenchmark.p',map8) ).
cnf(c_10,plain,
next_to(grandIsland,lincoln),
inference(clausify,[status(thm)],[map8]) ).
fof(map9,axiom,
next_to(lincoln,omaha),
file('theBenchmark.p',map9) ).
cnf(c_11,plain,
next_to(lincoln,omaha),
inference(clausify,[status(thm)],[map9]) ).
fof(map10,axiom,
next_to(omaha,desMoines),
file('theBenchmark.p',map10) ).
cnf(c_12,plain,
next_to(omaha,desMoines),
inference(clausify,[status(thm)],[map10]) ).
cnf(c_13,plain,
( at(desMoines,A,s(s(B)),drive(desMoines,C))
| ~ at(omaha,A,B,C) ),
inference(resolve,[status(thm)],[c_12,c_3]) ).
cnf(c_15,plain,
( at(omaha,A,s(s(B)),drive(omaha,C))
| ~ at(lincoln,A,B,C) ),
inference(resolve,[status(thm)],[c_11,c_3]) ).
cnf(c_17,plain,
( at(lincoln,A,s(s(B)),drive(lincoln,C))
| ~ at(grandIsland,A,B,C) ),
inference(resolve,[status(thm)],[c_10,c_3]) ).
cnf(c_19,plain,
( at(grandIsland,A,s(s(B)),drive(grandIsland,C))
| ~ at(northPlatte,A,B,C) ),
inference(resolve,[status(thm)],[c_9,c_3]) ).
cnf(c_21,plain,
( at(northPlatte,A,s(s(B)),drive(northPlatte,C))
| ~ at(cheyenne,A,B,C) ),
inference(resolve,[status(thm)],[c_8,c_3]) ).
fof(prove_you_gat_get_there_with_bread,axiom,
! [VAR_0,VAR_1] : ~ at(desMoines,s(none),VAR_0,VAR_1),
file('theBenchmark.p',prove_you_gat_get_there_with_bread) ).
cnf(c_33,plain,
~ at(desMoines,s(none),A,B),
inference(clausify,[status(thm)],[prove_you_gat_get_there_with_bread]) ).
fof(initial,axiom,
at(cheyenne,none,start,initial_situation),
file('theBenchmark.p',initial) ).
cnf(c_34,plain,
at(cheyenne,none,start,initial_situation),
inference(clausify,[status(thm)],[initial]) ).
fof(buy_in_city,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( at(VAR_0,s(VAR_1),s(VAR_2),buy(VAR_3))
| ~ at(VAR_0,VAR_1,VAR_2,VAR_3) ),
file('theBenchmark.p',buy_in_city) ).
cnf(c_35,plain,
( at(A,s(B),s(C),buy(D))
| ~ at(A,B,C,D) ),
inference(clausify,[status(thm)],[buy_in_city]) ).
cnf(c_37,plain,
~ at(omaha,s(none),A,B),
inference(resolve,[status(thm)],[c_33,c_13]) ).
cnf(c_39,plain,
at(northPlatte,none,s(s(start)),drive(northPlatte,initial_situation)),
inference(resolve,[status(thm)],[c_21,c_34]) ).
cnf(c_43,plain,
~ at(omaha,none,A,B),
inference(resolve,[status(thm)],[c_37,c_35]) ).
cnf(c_45,plain,
~ at(lincoln,none,A,B),
inference(resolve,[status(thm)],[c_43,c_15]) ).
cnf(c_46,plain,
~ at(grandIsland,none,A,B),
inference(resolve,[status(thm)],[c_45,c_17]) ).
cnf(c_47,plain,
~ at(northPlatte,none,A,B),
inference(resolve,[status(thm)],[c_46,c_19]) ).
cnf(c_48,plain,
$false,
inference(resolve,[status(thm)],[c_47,c_39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PLA001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.42 % Computer : n020.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Sat Sep 26 04:43:05 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/0.43 % Process 635039 was started by sandbox on n020,
% 0.15/0.43 % Sat Sep 26 04:43:05 2026
% 0.15/0.43 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.15/0.43
% 0.15/0.43 % From the command line: assign(max_seconds, 300).
% 0.15/0.45
% 0.15/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.45
% 0.15/0.45 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.15/0.45 % Length of proof is 21.
% 0.15/0.45 % Level of proof is 7.
% 0.15/0.45 % Maximum clause weight is 14.000.
% 0.15/0.45 % Given clauses 29.
% 0.15/0.45
% 0.15/0.45 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------