%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : PLA002-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 : 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 : Thu Sep 24 08:54:00 AM UTC 2026
% Result : Unsatisfiable 0.14s 5.41s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 17 unt; 2 nHn; 30 RR)
% Number of literals : 49 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 8 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(warm_or_cold,hypothesis,
( cold(Situation2)
| warm(Situation1) ),
file('theBenchmark.p',warm_or_cold) ).
cnf(drive_b_to_a,hypothesis,
( at(a,drive(a,Situation))
| ~ at(b,Situation) ),
file('theBenchmark.p',drive_b_to_a) ).
cnf(cross_river_c_to_b,hypothesis,
( at(b,skate(b,Situation))
| ~ at(c,Situation)
| ~ cold(Situation) ),
file('theBenchmark.p',cross_river_c_to_b) ).
cnf(climb_mountain_d_to_b,hypothesis,
( at(b,climb(b,Situation))
| ~ at(d,Situation)
| ~ warm(Situation) ),
file('theBenchmark.p',climb_mountain_d_to_b) ).
cnf(go_d_to_c,hypothesis,
( at(c,go(c,Situation))
| ~ at(d,Situation) ),
file('theBenchmark.p',go_d_to_c) ).
cnf(go_f_to_d,hypothesis,
( at(d,go(d,Situation))
| ~ at(f,Situation) ),
file('theBenchmark.p',go_f_to_d) ).
cnf(initial,hypothesis,
at(f,s0),
file('theBenchmark.p',initial) ).
cnf(prove_you_can_get_to_a,negated_conjecture,
~ at(a,S),
file('theBenchmark.p',prove_you_can_get_to_a) ).
cnf(t1,plain,
~ at(a,drive(a,skate(b,go(c,go(d,s0))))),
inference(start,[status(thm),parent(0:0)],[prove_you_can_get_to_a]) ).
cnf(t2,plain,
( ~ at(b,skate(b,go(c,go(d,s0))))
| at(a,drive(a,skate(b,go(c,go(d,s0))))) ),
inference(extension,[status(thm),parent(t1:1)],[drive_b_to_a]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ at(c,go(c,go(d,s0)))
| ~ cold(go(c,go(d,s0)))
| at(b,skate(b,go(c,go(d,s0)))) ),
inference(extension,[status(thm),parent(t2:2)],[cross_river_c_to_b]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( warm(go(d,s0))
| cold(go(c,go(d,s0))) ),
inference(extension,[status(thm),parent(t4:2)],[warm_or_cold]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( ~ at(d,go(d,s0))
| at(b,climb(b,go(d,s0)))
| ~ warm(go(d,s0)) ),
inference(extension,[status(thm),parent(t6:2)],[climb_mountain_d_to_b]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
( at(a,drive(a,climb(b,go(d,s0))))
| ~ at(b,climb(b,go(d,s0))) ),
inference(extension,[status(thm),parent(t8:2)],[drive_b_to_a]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
~ at(a,drive(a,climb(b,go(d,s0)))),
inference(extension,[status(thm),parent(t10:2)],[prove_you_can_get_to_a]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
( ~ at(f,s0)
| at(d,go(d,s0)) ),
inference(extension,[status(thm),parent(t8:3)],[go_f_to_d]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t8:3]) ).
cnf(t16,plain,
at(f,s0),
inference(extension,[status(thm),parent(t14:2)],[initial]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
( ~ at(d,go(d,s0))
| at(c,go(c,go(d,s0))) ),
inference(extension,[status(thm),parent(t4:3)],[go_d_to_c]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t4:3]) ).
cnf(t20,plain,
( ~ at(f,s0)
| at(d,go(d,s0)) ),
inference(extension,[status(thm),parent(t18:2)],[go_f_to_d]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).
cnf(t22,plain,
at(f,s0),
inference(extension,[status(thm),parent(t20:2)],[initial]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PLA002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_NHN 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.10/5.37 % Computer : n020.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Sat Sep 19 19:40:39 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.14/5.41 % SZS status Unsatisfiable for theBenchmark
% 0.14/5.41 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------