%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PLA002-2 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n020.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 : 300s
% DateTime : Tue May 5 05:01:18 PM UTC 2026
% Result : Unsatisfiable 2.01s 1.89s
% Output : CNFRefutation 2.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of clauses : 45 ( 6 unt; 7 nHn; 30 RR)
% Number of literals : 115 ( 0 equ; 76 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 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 : 72 ( 29 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(warm_or_cold,hypothesis,
( warm(X1)
| cold(X2)
| ~ situation(X1)
| ~ situation(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',warm_or_cold) ).
cnf(go_situation,hypothesis,
( situation(go(X2,X1))
| ~ situation(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',go_situation) ).
cnf(prove_you_can_get_to_a_in_a_situation,negated_conjecture,
( ~ at(a,X1)
| ~ situation(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_you_can_get_to_a_in_a_situation) ).
cnf(walk_situation,hypothesis,
( situation(walk(X2,X1))
| ~ situation(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk_situation) ).
cnf(walk_b_to_a,hypothesis,
( at(a,walk(a,X1))
| ~ at(b,X1)
| ~ situation(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk_b_to_a) ).
cnf(climb_situation,hypothesis,
( situation(climb(X2,X1))
| ~ situation(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',climb_situation) ).
cnf(initial_situation,hypothesis,
situation(s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_situation) ).
cnf(climb_mountain_d_to_b,hypothesis,
( at(b,climb(b,X1))
| ~ warm(X1)
| ~ at(d,X1)
| ~ situation(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',climb_mountain_d_to_b) ).
cnf(skate_situation,hypothesis,
( situation(skate(X2,X1))
| ~ situation(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',skate_situation) ).
cnf(cross_river_c_to_b,hypothesis,
( at(b,skate(b,X1))
| ~ cold(X1)
| ~ at(c,X1)
| ~ situation(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cross_river_c_to_b) ).
cnf(go_f_to_d,hypothesis,
( at(d,go(d,X1))
| ~ at(f,X1)
| ~ situation(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',go_f_to_d) ).
cnf(initial,hypothesis,
at(f,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial) ).
cnf(go_d_to_c,hypothesis,
( at(c,go(c,X1))
| ~ at(d,X1)
| ~ situation(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',go_d_to_c) ).
cnf(c_0_13,hypothesis,
( warm(X1)
| cold(X2)
| ~ situation(X1)
| ~ situation(X2) ),
warm_or_cold ).
cnf(c_0_14,hypothesis,
( situation(go(X2,X1))
| ~ situation(X1) ),
go_situation ).
cnf(c_0_15,negated_conjecture,
( ~ at(a,X1)
| ~ situation(X1) ),
prove_you_can_get_to_a_in_a_situation ).
cnf(c_0_16,hypothesis,
( situation(walk(X2,X1))
| ~ situation(X1) ),
walk_situation ).
cnf(c_0_17,hypothesis,
( cold(go(X1,X2))
| warm(X3)
| ~ situation(X3)
| ~ situation(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,hypothesis,
( at(a,walk(a,X1))
| ~ at(b,X1)
| ~ situation(X1) ),
walk_b_to_a ).
cnf(c_0_19,negated_conjecture,
( ~ at(a,walk(X1,X2))
| ~ situation(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,hypothesis,
( cold(go(X1,X2))
| warm(go(X3,X4))
| ~ situation(X2)
| ~ situation(X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_21,hypothesis,
( ~ at(b,X1)
| ~ situation(X1) ),
inference(csr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,hypothesis,
( situation(climb(X2,X1))
| ~ situation(X1) ),
climb_situation ).
cnf(c_0_23,hypothesis,
( cold(go(X1,go(X2,X3)))
| warm(go(X4,X5))
| ~ situation(X5)
| ~ situation(X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_24,hypothesis,
situation(s0),
initial_situation ).
cnf(c_0_25,hypothesis,
( at(b,climb(b,X1))
| ~ warm(X1)
| ~ at(d,X1)
| ~ situation(X1) ),
climb_mountain_d_to_b ).
cnf(c_0_26,hypothesis,
( ~ at(b,climb(X1,X2))
| ~ situation(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,hypothesis,
( cold(go(X1,go(X2,X3)))
| warm(go(X4,s0))
| ~ situation(X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,hypothesis,
( situation(skate(X2,X1))
| ~ situation(X1) ),
skate_situation ).
cnf(c_0_29,hypothesis,
( ~ at(d,X1)
| ~ situation(X1)
| ~ warm(X1) ),
inference(csr,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,hypothesis,
( cold(go(X1,go(X2,s0)))
| warm(go(X3,s0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_31,hypothesis,
( at(b,skate(b,X1))
| ~ cold(X1)
| ~ at(c,X1)
| ~ situation(X1) ),
cross_river_c_to_b ).
cnf(c_0_32,hypothesis,
( ~ at(b,skate(X1,X2))
| ~ situation(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_33,hypothesis,
( cold(go(X1,go(X2,s0)))
| ~ at(d,go(X3,s0))
| ~ situation(go(X3,s0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,hypothesis,
( at(d,go(d,X1))
| ~ at(f,X1)
| ~ situation(X1) ),
go_f_to_d ).
cnf(c_0_35,hypothesis,
at(f,s0),
initial ).
cnf(c_0_36,hypothesis,
( ~ at(c,X1)
| ~ situation(X1)
| ~ cold(X1) ),
inference(csr,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,hypothesis,
( cold(go(X1,go(X2,s0)))
| ~ situation(go(d,s0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_24])]) ).
cnf(c_0_38,hypothesis,
( ~ at(c,go(X1,go(X2,s0)))
| ~ situation(go(X1,go(X2,s0)))
| ~ situation(go(d,s0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,hypothesis,
( ~ at(c,go(X1,go(X2,s0)))
| ~ situation(go(d,s0))
| ~ situation(go(X2,s0)) ),
inference(spm,[status(thm)],[c_0_38,c_0_14]) ).
cnf(c_0_40,hypothesis,
( at(c,go(c,X1))
| ~ at(d,X1)
| ~ situation(X1) ),
go_d_to_c ).
cnf(c_0_41,hypothesis,
( ~ at(d,go(X1,s0))
| ~ situation(go(d,s0))
| ~ situation(go(X1,s0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,hypothesis,
( ~ at(d,go(X1,s0))
| ~ situation(go(X1,s0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_14]),c_0_24])]) ).
cnf(c_0_43,hypothesis,
~ at(d,go(X1,s0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_14]),c_0_24])]) ).
cnf(c_0_44,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_34]),c_0_35]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PLA002-2 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n020.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 01:26:05 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 2.01/1.89 % Version : CSE_E---1.7
% 2.01/1.89 % Problem : theBenchmark.p
% 2.01/1.89 % SZS status Unsatisfiable for theBenchmark.p
% 2.01/1.89 % SZS output start CNFRefutation
% See solution above
% 2.01/1.89 % Total time : 1.369s
%------------------------------------------------------------------------------