%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : PLA002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n018.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  : 600s
% DateTime : Mon Jul 18 17:32:16 EDT 2022

% Result   : Unsatisfiable 0.20s 0.42s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   20 (  12 unt;   1 nHn;  20 RR)
%            Number of literals    :   30 (   0 equ;  18 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    :   12 (  12 usr;   8 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( cold(u)
    | warm(v) ),
    file('PLA002-1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ at(b,u)
    | at(a,drive(a,u)) ),
    file('PLA002-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ cold(u)
    | ~ at(c,u)
    | at(b,skate(b,u)) ),
    file('PLA002-1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ warm(u)
    | ~ at(d,u)
    | at(b,climb(b,u)) ),
    file('PLA002-1.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ at(d,u)
    | at(c,go(c,u)) ),
    file('PLA002-1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ at(f,u)
    | at(d,go(d,u)) ),
    file('PLA002-1.p',unknown),
    [] ).

cnf(16,axiom,
    at(f,s0),
    file('PLA002-1.p',unknown),
    [] ).

cnf(17,axiom,
    ~ at(a,u),
    file('PLA002-1.p',unknown),
    [] ).

cnf(18,plain,
    ~ at(b,u),
    inference(mrr,[status(thm)],[5,17]),
    [iquote('0:MRR:5.1,17.0')] ).

cnf(19,plain,
    ( ~ warm(u)
    | ~ at(d,u) ),
    inference(mrr,[status(thm)],[9,18]),
    [iquote('0:MRR:9.2,18.0')] ).

cnf(20,plain,
    ( ~ cold(u)
    | ~ at(c,u) ),
    inference(mrr,[status(thm)],[7,18]),
    [iquote('0:MRR:7.2,18.0')] ).

cnf(23,plain,
    warm(u),
    inference(spt,[spt(split,[position(s1)])],[1]),
    [iquote('1:Spt:1.1')] ).

cnf(24,plain,
    ~ at(d,u),
    inference(mrr,[status(thm)],[19,23]),
    [iquote('1:MRR:19.0,23.0')] ).

cnf(25,plain,
    ~ at(f,u),
    inference(mrr,[status(thm)],[15,24]),
    [iquote('1:MRR:15.1,24.0')] ).

cnf(27,plain,
    $false,
    inference(unc,[status(thm)],[25,16]),
    [iquote('1:UnC:25.0,16.0')] ).

cnf(29,plain,
    cold(u),
    inference(spt,[spt(split,[position(s2)])],[1]),
    [iquote('1:Spt:27.0,1.0')] ).

cnf(30,plain,
    ~ at(c,u),
    inference(mrr,[status(thm)],[20,29]),
    [iquote('1:MRR:20.0,29.0')] ).

cnf(31,plain,
    ~ at(d,u),
    inference(mrr,[status(thm)],[11,30]),
    [iquote('1:MRR:11.1,30.0')] ).

cnf(32,plain,
    ~ at(f,u),
    inference(mrr,[status(thm)],[15,31]),
    [iquote('1:MRR:15.1,31.0')] ).

cnf(33,plain,
    $false,
    inference(unc,[status(thm)],[32,16]),
    [iquote('1:UnC:32.0,16.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : PLA002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n018.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue May 31 18:38:28 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.42  
% 0.20/0.42  SPASS V 3.9 
% 0.20/0.42  SPASS beiseite: Proof found.
% 0.20/0.42  % SZS status Theorem
% 0.20/0.42  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.42  SPASS derived 5 clauses, backtracked 9 clauses, performed 1 splits and kept 24 clauses.
% 0.20/0.42  SPASS allocated 75601 KBytes.
% 0.20/0.42  SPASS spent	0:00:00.06 on the problem.
% 0.20/0.42  		0:00:00.04 for the input.
% 0.20/0.42  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.42  		0:00:00.00 for inferences.
% 0.20/0.42  		0:00:00.00 for the backtracking.
% 0.20/0.42  		0:00:00.00 for the reduction.
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  Here is a proof with depth 1, length 20 :
% 0.20/0.42  % SZS output start Refutation
% See solution above
% 0.20/0.42  Formulae used in the proof : warm_or_cold drive_b_to_a cross_river_c_to_b climb_mountain_d_to_b go_d_to_c go_f_to_d initial prove_you_can_get_to_a
% 0.20/0.42  
%------------------------------------------------------------------------------