↑ Up

Prover9---2026-6A.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : PLA002-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n008.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 : Sun Sep 27 08:20:20 AM UTC 2026

% Result   : Unsatisfiable 0.12s 0.41s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   25 (   9 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   49 (  25   ~;  24   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   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   :   26 (   9 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(warm_or_cold,axiom,
    ! [VAR_0,VAR_1] :
      ( cold(VAR_1)
      | warm(VAR_0) ),
    file('theBenchmark.p',warm_or_cold) ).

cnf(c_2,plain,
    ( cold(B)
    | warm(A) ),
    inference(clausify,[status(thm)],[warm_or_cold]) ).

fof(climb_mountain_d_to_b,axiom,
    ! [VAR_0] :
      ( at(b,climb(b,VAR_0))
      | ~ at(d,VAR_0)
      | ~ warm(VAR_0) ),
    file('theBenchmark.p',climb_mountain_d_to_b) ).

cnf(c_3,plain,
    ( at(b,climb(b,A))
    | ~ at(d,A)
    | ~ warm(A) ),
    inference(clausify,[status(thm)],[climb_mountain_d_to_b]) ).

fof(cross_river_c_to_b,axiom,
    ! [VAR_0] :
      ( at(b,skate(b,VAR_0))
      | ~ at(c,VAR_0)
      | ~ cold(VAR_0) ),
    file('theBenchmark.p',cross_river_c_to_b) ).

cnf(c_4,plain,
    ( at(b,skate(b,A))
    | ~ at(c,A)
    | ~ cold(A) ),
    inference(clausify,[status(thm)],[cross_river_c_to_b]) ).

cnf(c_6,plain,
    ( cold(B)
    | at(b,climb(b,A))
    | ~ at(d,A) ),
    inference(resolve,[status(thm)],[c_3,c_2]) ).

cnf(c_10,plain,
    ( at(b,climb(b,B))
    | ~ at(d,B)
    | at(b,skate(b,A))
    | ~ at(c,A) ),
    inference(resolve,[status(thm)],[c_4,c_6]) ).

fof(drive_b_to_a,axiom,
    ! [VAR_0] :
      ( at(a,drive(a,VAR_0))
      | ~ at(b,VAR_0) ),
    file('theBenchmark.p',drive_b_to_a) ).

cnf(c_15,plain,
    ( at(a,drive(a,A))
    | ~ at(b,A) ),
    inference(clausify,[status(thm)],[drive_b_to_a]) ).

fof(go_d_to_c,axiom,
    ! [VAR_0] :
      ( at(c,go(c,VAR_0))
      | ~ at(d,VAR_0) ),
    file('theBenchmark.p',go_d_to_c) ).

cnf(c_17,plain,
    ( at(c,go(c,A))
    | ~ at(d,A) ),
    inference(clausify,[status(thm)],[go_d_to_c]) ).

fof(go_f_to_d,axiom,
    ! [VAR_0] :
      ( at(d,go(d,VAR_0))
      | ~ at(f,VAR_0) ),
    file('theBenchmark.p',go_f_to_d) ).

cnf(c_21,plain,
    ( at(d,go(d,A))
    | ~ at(f,A) ),
    inference(clausify,[status(thm)],[go_f_to_d]) ).

fof(initial,axiom,
    at(f,s0),
    file('theBenchmark.p',initial) ).

cnf(c_22,plain,
    at(f,s0),
    inference(clausify,[status(thm)],[initial]) ).

fof(prove_you_can_get_to_a,axiom,
    ! [VAR_0] : ~ at(a,VAR_0),
    file('theBenchmark.p',prove_you_can_get_to_a) ).

cnf(c_23,plain,
    ~ at(a,A),
    inference(clausify,[status(thm)],[prove_you_can_get_to_a]) ).

cnf(c_25,plain,
    ~ at(b,A),
    inference(resolve,[status(thm)],[c_23,c_15]) ).

cnf(c_31,plain,
    ( at(b,climb(b,B))
    | ~ at(d,B)
    | ~ at(c,A) ),
    inference(resolve,[status(thm)],[c_25,c_10]) ).

cnf(c_26,plain,
    ( ~ at(d,B)
    | ~ at(c,A) ),
    inference(resolve,[status(thm)],[c_25,c_31]) ).

cnf(c_27,plain,
    at(d,go(d,s0)),
    inference(resolve,[status(thm)],[c_22,c_21]) ).

cnf(c_28,plain,
    ~ at(c,A),
    inference(resolve,[status(thm)],[c_27,c_26]) ).

cnf(c_32,plain,
    at(c,go(c,go(d,s0))),
    inference(resolve,[status(thm)],[c_27,c_17]) ).

cnf(c_30,plain,
    $false,
    inference(resolve,[status(thm)],[c_28,c_32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : PLA002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.39  % Computer : n008.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 : Sat Sep 26 04:42:56 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.39  % Process 2783436 was started by sandbox2 on n008,
% 0.12/0.39  % Sat Sep 26 04:42:56 2026
% 0.12/0.39  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.40  
% 0.12/0.40  % From the command line: assign(max_seconds, 300).
% 0.12/0.41  
% 0.12/0.41  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.41  
% 0.12/0.41  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.12/0.41  % Length of proof is 15.
% 0.12/0.41  % Level of proof is 5.
% 0.12/0.41  % Maximum clause weight is 16.000.
% 0.12/0.41  % Given clauses 11.
% 0.12/0.41  
% 0.12/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------