%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : PLA002-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n016.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 : Fri Sep 25 02:30:57 PM UTC 2026
% Result : Unsatisfiable 2.43s 1.33s
% Output : CNFRefutation 2.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 13
% Syntax : Number of formulae : 50 ( 8 unt; 0 def)
% Number of atoms : 127 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 170 ( 93 ~; 77 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 51 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ situation(X1)
| ~ situation(X0)
| cold(X1)
| warm(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',warm_or_cold) ).
fof(f4,axiom,
! [X0] :
( ~ situation(X0)
| at(a,walk(a,X0))
| ~ at(b,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk_b_to_a) ).
fof(f7,axiom,
! [X0] :
( ~ situation(X0)
| at(b,skate(b,X0))
| ~ at(c,X0)
| ~ cold(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cross_river_c_to_b) ).
fof(f9,axiom,
! [X0] :
( ~ situation(X0)
| at(b,climb(b,X0))
| ~ at(d,X0)
| ~ warm(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',climb_mountain_d_to_b) ).
fof(f11,axiom,
! [X0] :
( ~ situation(X0)
| at(c,go(c,X0))
| ~ at(d,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',go_d_to_c) ).
fof(f15,axiom,
! [X0] :
( ~ situation(X0)
| at(d,go(d,X0))
| ~ at(f,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',go_f_to_d) ).
fof(f16,axiom,
situation(s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_situation) ).
fof(f17,axiom,
! [X0,X1] :
( situation(walk(X1,X0))
| ~ situation(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk_situation) ).
fof(f19,axiom,
! [X0,X1] :
( situation(climb(X1,X0))
| ~ situation(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',climb_situation) ).
fof(f20,axiom,
! [X0,X1] :
( situation(skate(X1,X0))
| ~ situation(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',skate_situation) ).
fof(f21,axiom,
! [X0,X1] :
( situation(go(X1,X0))
| ~ situation(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',go_situation) ).
fof(f22,axiom,
at(f,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial) ).
fof(f23,negated_conjecture,
! [X0] :
( ~ situation(X0)
| ~ at(a,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_you_can_get_to_a_in_a_situation) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] :
( cold(X1)
| warm(X0)
| ~ situation(X1)
| ~ situation(X0) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_75,plain,
! [X0: $i] :
( at(a,walk(a,X0))
| ~ situation(X0)
| ~ at(b,X0) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_78,plain,
! [X0: $i] :
( at(b,skate(b,X0))
| ~ situation(X0)
| ~ cold(X0)
| ~ at(c,X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_80,plain,
! [X0: $i] :
( at(b,climb(b,X0))
| ~ situation(X0)
| ~ warm(X0)
| ~ at(d,X0) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_82,plain,
! [X0: $i] :
( at(c,go(c,X0))
| ~ situation(X0)
| ~ at(d,X0) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_86,plain,
! [X0: $i] :
( at(d,go(d,X0))
| ~ situation(X0)
| ~ at(f,X0) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_87,plain,
situation(s0),
inference(cnf_transformation,[],[f16]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i] :
( situation(walk(X1,X0))
| ~ situation(X0) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i] :
( situation(climb(X1,X0))
| ~ situation(X0) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_91,plain,
! [X0: $i,X1: $i] :
( situation(skate(X1,X0))
| ~ situation(X0) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_92,plain,
! [X0: $i,X1: $i] :
( situation(go(X1,X0))
| ~ situation(X0) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_93,plain,
at(f,s0),
inference(cnf_transformation,[],[f22]) ).
tcf(c_94,negated_conjecture,
! [X0: $i] :
( ~ situation(X0)
| ~ at(a,X0) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_522,plain,
! [X0: $i] :
( ~ iPr_def_10
| cold(X0)
| ~ situation(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_72]) ).
tcf(c_523,plain,
! [X0: $i] :
( ~ iPr_def_11
| warm(X0)
| ~ situation(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_72]) ).
tcf(c_524,plain,
( iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_72]) ).
tcf(c_525,negated_conjecture,
! [X0: $i] :
( ~ situation(X0)
| ~ at(a,X0) ),
inference(demodulation,[status(thm)],[c_94]) ).
tcf(c_767,plain,
! [X0: $i] :
( ~ situation(X0)
| ~ at(b,X0)
| ~ situation(walk(a,X0)) ),
inference(superposition,[status(thm)],[c_75,c_525]) ).
tcf(c_852,plain,
! [X0: $i,X1: $i] :
( cold(go(X1,X0))
| ~ iPr_def_10
| ~ situation(X0) ),
inference(superposition,[status(thm)],[c_92,c_522]) ).
tcf(c_1122,plain,
! [X0: $i] :
( ~ situation(X0)
| ~ at(b,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_767,c_88]) ).
tcf(c_1315,plain,
! [X0: $i] :
( ~ situation(X0)
| ~ cold(X0)
| ~ at(c,X0)
| ~ situation(skate(b,X0)) ),
inference(superposition,[status(thm)],[c_78,c_1122]) ).
tcf(c_1338,plain,
! [X0: $i] :
( ~ situation(X0)
| ~ cold(X0)
| ~ at(c,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1315,c_91]) ).
tcf(c_1349,plain,
! [X0: $i] :
( ~ situation(X0)
| ~ at(d,X0)
| ~ situation(go(c,X0))
| ~ cold(go(c,X0)) ),
inference(superposition,[status(thm)],[c_82,c_1338]) ).
tcf(c_1425,plain,
! [X0: $i] :
( ~ situation(X0)
| ~ at(d,X0)
| ~ cold(go(c,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1349,c_92]) ).
tcf(c_1435,plain,
! [X0: $i] :
( ~ iPr_def_10
| ~ situation(X0)
| ~ at(d,X0) ),
inference(superposition,[status(thm)],[c_852,c_1425]) ).
tcf(c_1487,plain,
! [X0: $i] :
( ~ iPr_def_10
| ~ situation(X0)
| ~ at(f,X0)
| ~ situation(go(d,X0)) ),
inference(superposition,[status(thm)],[c_86,c_1435]) ).
tcf(c_1583,plain,
! [X0: $i] :
( ~ iPr_def_10
| ~ situation(X0)
| ~ at(f,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1487,c_92]) ).
tcf(c_1594,plain,
( ~ iPr_def_10
| ~ situation(s0) ),
inference(superposition,[status(thm)],[c_93,c_1583]) ).
tcf(c_1595,plain,
~ iPr_def_10,
inference(forward_subsumption_resolution,[status(thm)],[c_1594,c_87]) ).
tcf(c_1596,plain,
iPr_def_11,
inference(backward_subsumption_resolution,[status(thm)],[c_524,c_1595]) ).
tcf(c_1647,plain,
! [X0: $i] :
( at(b,climb(b,X0))
| ~ situation(X0)
| ~ at(d,X0) ),
inference(global_subsumption_just,[status(thm)],[c_80,c_80,c_523,c_1596]) ).
tcf(c_1656,plain,
! [X0: $i] :
( ~ situation(X0)
| ~ at(d,X0)
| ~ situation(climb(b,X0)) ),
inference(superposition,[status(thm)],[c_1647,c_1122]) ).
tcf(c_1700,plain,
! [X0: $i] :
( ~ situation(X0)
| ~ at(d,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1656,c_90]) ).
tcf(c_1707,plain,
! [X0: $i] :
( ~ situation(X0)
| ~ at(f,X0)
| ~ situation(go(d,X0)) ),
inference(superposition,[status(thm)],[c_86,c_1700]) ).
tcf(c_1720,plain,
! [X0: $i] :
( ~ situation(X0)
| ~ at(f,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1707,c_92]) ).
tcf(c_1727,plain,
~ situation(s0),
inference(superposition,[status(thm)],[c_93,c_1720]) ).
tcf(c_1728,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1727,c_87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PLA002-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.39 % Computer : n016.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Thu Sep 24 06:12:30 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.44
% 0.12/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.44
% 0.12/0.45 % Detected problem language: tptp
% 0.12/0.46 % Proving...
% 2.43/1.33 % SZS status Started for theBenchmark.p
% 2.43/1.33 % SZS status Unsatisfiable for theBenchmark.p
% 2.43/1.33
% 2.43/1.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.43/1.33
% 2.43/1.33 % ------ iProver source info
% 2.43/1.33
% 2.43/1.33 % git: date: 2026-07-19 20:42:38 +0200
% 2.43/1.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.43/1.33 % git: non_committed_changes: false
% 2.43/1.33
% 2.43/1.33 % ------ Parsing...% successful
% 2.43/1.33
% 2.43/1.33
% 2.43/1.33 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.43/1.33
% 2.43/1.33 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.43/1.33
% 2.43/1.33 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.43/1.33 % ------ Proving...
% 2.43/1.33 % ------ Problem Properties
% 2.43/1.33
% 2.43/1.33 %
% 2.43/1.33 % clauses 23
% 2.43/1.33 % conjectures 1
% 2.43/1.33 % EPR 6
% 2.43/1.33 % Horn 22
% 2.43/1.33 % unary 2
% 2.43/1.33 % binary 7
% 2.43/1.33 % lits 62
% 2.43/1.33 % lits eq 0
% 2.43/1.33 % fd_pure 0
% 2.43/1.33 % fd_pseudo 0
% 2.43/1.33 % fd_cond 0
% 2.43/1.33 % fd_pseudo_cond 0
% 2.43/1.33 % AC symbols 0
% 2.43/1.33
% 2.43/1.33 % ------ Schedule dynamic 5 is on
% 2.43/1.33
% 2.43/1.33 % ------ no equalities: superposition off
% 2.43/1.33
% 2.43/1.33 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.43/1.33
% 2.43/1.33
% 2.43/1.33 % ------
% 2.43/1.33 % Current options:
% 2.43/1.33 % ------
% 2.43/1.33
% 2.43/1.33
% 2.43/1.33 %
% 2.43/1.33
% 2.43/1.33 % ------ Proving...
% 2.43/1.33 %
% 2.43/1.33
% 2.43/1.33 % SZS status Unsatisfiable for theBenchmark.p
% 2.43/1.33
% 2.43/1.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.43/1.34
% 2.43/1.34
%------------------------------------------------------------------------------