%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : PLA001-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/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 : Thu Sep 24 08:54:00 AM UTC 2026
% Result : Unsatisfiable 0.66s 0.94s
% Output : Proof 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 9
% Syntax : Number of clauses : 34 ( 26 unt; 0 nHn; 34 RR)
% Number of literals : 48 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 12 ( 3 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 : 11 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(drive1,axiom,
( at(ToCity,Loaves,s(s(Time)),drive(ToCity,Situation))
| ~ next_to(FromCity,ToCity)
| ~ at(FromCity,Loaves,Time,Situation) ),
file('theBenchmark.p',drive1) ).
cnf(buy_in_city,axiom,
( at(City,s(Loaves),s(Time),buy(Situation))
| ~ at(City,Loaves,Time,Situation) ),
file('theBenchmark.p',buy_in_city) ).
cnf(map6,hypothesis,
next_to(cheyenne,northPlatte),
file('theBenchmark.p',map6) ).
cnf(map7,hypothesis,
next_to(northPlatte,grandIsland),
file('theBenchmark.p',map7) ).
cnf(map8,hypothesis,
next_to(grandIsland,lincoln),
file('theBenchmark.p',map8) ).
cnf(map9,hypothesis,
next_to(lincoln,omaha),
file('theBenchmark.p',map9) ).
cnf(map10,hypothesis,
next_to(omaha,desMoines),
file('theBenchmark.p',map10) ).
cnf(initial,hypothesis,
at(cheyenne,none,start,initial_situation),
file('theBenchmark.p',initial) ).
cnf(prove_you_gat_get_there_with_bread,negated_conjecture,
~ at(desMoines,s(none),Time,Situation),
file('theBenchmark.p',prove_you_gat_get_there_with_bread) ).
cnf(t1,plain,
~ at(desMoines,s(none),s(s(s(s(s(s(s(s(s(s(s(start))))))))))),buy(drive(desMoines,drive(omaha,drive(lincoln,drive(grandIsland,drive(northPlatte,initial_situation))))))),
inference(start,[status(thm),parent(0:0)],[prove_you_gat_get_there_with_bread]) ).
cnf(t2,plain,
( ~ at(desMoines,none,s(s(s(s(s(s(s(s(s(s(start)))))))))),drive(desMoines,drive(omaha,drive(lincoln,drive(grandIsland,drive(northPlatte,initial_situation))))))
| at(desMoines,s(none),s(s(s(s(s(s(s(s(s(s(s(start))))))))))),buy(drive(desMoines,drive(omaha,drive(lincoln,drive(grandIsland,drive(northPlatte,initial_situation))))))) ),
inference(extension,[status(thm),parent(t1:1)],[buy_in_city]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ next_to(omaha,desMoines)
| ~ at(omaha,none,s(s(s(s(s(s(s(s(start)))))))),drive(omaha,drive(lincoln,drive(grandIsland,drive(northPlatte,initial_situation)))))
| at(desMoines,none,s(s(s(s(s(s(s(s(s(s(start)))))))))),drive(desMoines,drive(omaha,drive(lincoln,drive(grandIsland,drive(northPlatte,initial_situation)))))) ),
inference(extension,[status(thm),parent(t2:2)],[drive1]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ next_to(lincoln,omaha)
| ~ at(lincoln,none,s(s(s(s(s(s(start)))))),drive(lincoln,drive(grandIsland,drive(northPlatte,initial_situation))))
| at(omaha,none,s(s(s(s(s(s(s(s(start)))))))),drive(omaha,drive(lincoln,drive(grandIsland,drive(northPlatte,initial_situation))))) ),
inference(extension,[status(thm),parent(t4:2)],[drive1]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( ~ next_to(grandIsland,lincoln)
| ~ at(grandIsland,none,s(s(s(s(start)))),drive(grandIsland,drive(northPlatte,initial_situation)))
| at(lincoln,none,s(s(s(s(s(s(start)))))),drive(lincoln,drive(grandIsland,drive(northPlatte,initial_situation)))) ),
inference(extension,[status(thm),parent(t6:2)],[drive1]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
( ~ next_to(northPlatte,grandIsland)
| ~ at(northPlatte,none,s(s(start)),drive(northPlatte,initial_situation))
| at(grandIsland,none,s(s(s(s(start)))),drive(grandIsland,drive(northPlatte,initial_situation))) ),
inference(extension,[status(thm),parent(t8:2)],[drive1]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
( ~ next_to(cheyenne,northPlatte)
| ~ at(cheyenne,none,start,initial_situation)
| at(northPlatte,none,s(s(start)),drive(northPlatte,initial_situation)) ),
inference(extension,[status(thm),parent(t10:2)],[drive1]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
at(cheyenne,none,start,initial_situation),
inference(extension,[status(thm),parent(t12:2)],[initial]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
next_to(cheyenne,northPlatte),
inference(extension,[status(thm),parent(t12:3)],[map6]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t12:3]) ).
cnf(t18,plain,
next_to(northPlatte,grandIsland),
inference(extension,[status(thm),parent(t10:3)],[map7]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t10:3]) ).
cnf(t20,plain,
next_to(grandIsland,lincoln),
inference(extension,[status(thm),parent(t8:3)],[map8]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t8:3]) ).
cnf(t22,plain,
next_to(lincoln,omaha),
inference(extension,[status(thm),parent(t6:3)],[map9]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t6:3]) ).
cnf(t24,plain,
next_to(omaha,desMoines),
inference(extension,[status(thm),parent(t4:3)],[map10]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t4:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PLA001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n010.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Sat Sep 19 19:39:38 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.66/0.94 % SZS status Unsatisfiable for theBenchmark
% 0.66/0.94 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------