%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : PLA002-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n010.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 : Mon Jun 24 13:36:24 EDT 2024

% Result   : Unsatisfiable 0.48s 1.15s
% Output   : CNFRefutation 0.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   18 (   7 unt;   1 nHn;  16 RR)
%            Number of literals    :   31 (   0 equ;  20 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :   19 (  11 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    ( warm(X0)
    | cold(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',warm_or_cold) ).

cnf(c_50,plain,
    ( ~ at(a,X0)
    | at(b,walk(b,X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk_a_to_b) ).

cnf(c_53,plain,
    ( ~ at(b,X0)
    | at(a,drive(a,X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',drive_b_to_a) ).

cnf(c_55,plain,
    ( ~ at(c,X0)
    | ~ cold(X0)
    | at(b,skate(b,X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cross_river_c_to_b) ).

cnf(c_57,plain,
    ( ~ at(d,X0)
    | ~ warm(X0)
    | at(b,climb(b,X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_mountain_d_to_b) ).

cnf(c_59,plain,
    ( ~ at(d,X0)
    | at(c,go(c,X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_d_to_c) ).

cnf(c_63,plain,
    ( ~ at(f,X0)
    | at(d,go(d,X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_f_to_d) ).

cnf(c_64,plain,
    at(f,s0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial) ).

cnf(c_65,negated_conjecture,
    ~ at(a,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_you_can_get_to_a) ).

cnf(c_82,plain,
    ~ at(a,X0),
    inference(global_subsumption_just,[status(thm)],[c_50,c_65]) ).

cnf(c_89,plain,
    ~ at(b,X0),
    inference(backward_subsumption_resolution,[status(thm)],[c_53,c_82]) ).

cnf(c_93,plain,
    ( ~ at(d,X0)
    | ~ warm(X0) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_57,c_89]) ).

cnf(c_94,plain,
    ( ~ at(c,X0)
    | ~ cold(X0) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_55,c_89]) ).

cnf(c_133,plain,
    ( ~ at(d,X0)
    | cold(X1) ),
    inference(resolution,[status(thm)],[c_49,c_93]) ).

cnf(c_143,plain,
    ( ~ at(c,X0)
    | ~ at(d,X1) ),
    inference(resolution,[status(thm)],[c_133,c_94]) ).

cnf(c_152,plain,
    ~ at(d,X0),
    inference(backward_subsumption_resolution,[status(thm)],[c_59,c_143]) ).

cnf(c_161,plain,
    ~ at(f,X0),
    inference(backward_subsumption_resolution,[status(thm)],[c_63,c_152]) ).

cnf(c_169,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_64,c_161]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : PLA002-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.12  % Command  : run_iprover %s %d THM
% 0.13/0.33  % Computer : n010.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Tue Jun 18 16:43:39 EDT 2024
% 0.13/0.33  % CPUTime  : 
% 0.21/0.47  Running first-order theorem proving
% 0.21/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.48/1.15  % SZS status Started for theBenchmark.p
% 0.48/1.15  % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.15  
% 0.48/1.15  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.15  
% 0.48/1.15  ------  iProver source info
% 0.48/1.15  
% 0.48/1.15  git: date: 2024-06-12 09:56:46 +0000
% 0.48/1.15  git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.48/1.15  git: non_committed_changes: false
% 0.48/1.15  
% 0.48/1.15  ------ Parsing...successful
% 0.48/1.15  
% 0.48/1.15  
% 0.48/1.15  
% 0.48/1.15  ------ Preprocessing... sf_s  rm: 2 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e 
% 0.48/1.15  
% 0.48/1.15  % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.15  
% 0.48/1.15  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.15  
% 0.48/1.15  
%------------------------------------------------------------------------------