↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : PLA002-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n006.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 1.20s 1.37s
% Output   : CNFRefutation 1.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   27 (   9 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   51 (  29   ~;  22   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   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  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :   28 (   0 sgn  28   !;   0   ?;  19   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( cold(X1)
      | warm(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',warm_or_cold) ).

fof(f2,axiom,
    ! [X0] :
      ( at(b,walk(b,X0))
      | ~ at(a,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk_a_to_b) ).

fof(f5,axiom,
    ! [X0] :
      ( at(a,drive(a,X0))
      | ~ at(b,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',drive_b_to_a) ).

fof(f7,axiom,
    ! [X0] :
      ( at(b,skate(b,X0))
      | ~ at(c,X0)
      | ~ cold(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cross_river_c_to_b) ).

fof(f9,axiom,
    ! [X0] :
      ( at(b,climb(b,X0))
      | ~ at(d,X0)
      | ~ warm(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_mountain_d_to_b) ).

fof(f11,axiom,
    ! [X0] :
      ( at(c,go(c,X0))
      | ~ at(d,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_d_to_c) ).

fof(f15,axiom,
    ! [X0] :
      ( at(d,go(d,X0))
      | ~ at(f,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_f_to_d) ).

fof(f16,axiom,
    at(f,s0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial) ).

fof(f17,negated_conjecture,
    ! [X0] : ~ at(a,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_you_can_get_to_a) ).

tcf(c_66,plain,
    ! [X0: $i,X1: $i] :
      ( cold(X1)
      | warm(X0) ),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_67,plain,
    ! [X0: $i] :
      ( at(b,walk(b,X0))
      | ~ at(a,X0) ),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_70,plain,
    ! [X0: $i] :
      ( at(a,drive(a,X0))
      | ~ at(b,X0) ),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_72,plain,
    ! [X0: $i] :
      ( at(b,skate(b,X0))
      | ~ cold(X0)
      | ~ at(c,X0) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_74,plain,
    ! [X0: $i] :
      ( at(b,climb(b,X0))
      | ~ warm(X0)
      | ~ at(d,X0) ),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_76,plain,
    ! [X0: $i] :
      ( at(c,go(c,X0))
      | ~ at(d,X0) ),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_80,plain,
    ! [X0: $i] :
      ( at(d,go(d,X0))
      | ~ at(f,X0) ),
    inference(cnf_transformation,[],[f15]) ).

tcf(c_81,plain,
    at(f,s0),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_82,negated_conjecture,
    ! [X0: $i] : ~ at(a,X0),
    inference(cnf_transformation,[],[f17]) ).

tcf(c_99,plain,
    ! [X0: $i] : ~ at(a,X0),
    inference(global_subsumption_just,[status(thm)],[c_67,c_82]) ).

tcf(c_106,plain,
    ! [X0: $i] : ~ at(b,X0),
    inference(backward_subsumption_resolution,[status(thm)],[c_70,c_99]) ).

tcf(c_110,plain,
    ! [X0: $i] :
      ( ~ warm(X0)
      | ~ at(d,X0) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_74,c_106]) ).

tcf(c_111,plain,
    ! [X0: $i] :
      ( ~ cold(X0)
      | ~ at(c,X0) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_72,c_106]) ).

tcf(c_150,plain,
    ! [X0: $i,X1: $i] :
      ( cold(X1)
      | ~ at(d,X0) ),
    inference(resolution,[status(thm)],[c_66,c_110]) ).

tcf(c_160,plain,
    ! [X0: $i,X1: $i] :
      ( ~ at(d,X1)
      | ~ at(c,X0) ),
    inference(resolution,[status(thm)],[c_150,c_111]) ).

tcf(c_169,plain,
    ! [X0: $i] : ~ at(d,X0),
    inference(backward_subsumption_resolution,[status(thm)],[c_76,c_160]) ).

tcf(c_178,plain,
    ! [X0: $i] : ~ at(f,X0),
    inference(backward_subsumption_resolution,[status(thm)],[c_80,c_169]) ).

tcf(c_186,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_81,c_178]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PLA002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.46  % Computer : n006.cluster.edu
% 0.11/0.46  % Model    : x86_64 x86_64
% 0.11/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.46  % Memory   : 8046.5625MB
% 0.11/0.46  % OS       : Linux 6.8.0-71-generic
% 0.11/0.46  % CPULimit : 300
% 0.11/0.46  % WCLimit  : 300
% 0.11/0.46  % DateTime : Thu Sep 24 06:07:30 UTC 2026
% 0.11/0.47  % CPUTime  : 
% 0.11/0.47  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.50  Running first-order theorem proving
% 0.11/0.50  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.52  
% 0.11/0.52  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.52  
% 0.11/0.52  % Detected problem language: tptp
% 0.11/0.53  % Proving...
% 1.20/1.37  % SZS status Started for theBenchmark.p
% 1.20/1.37  % SZS status Unsatisfiable for theBenchmark.p
% 1.20/1.37  
% 1.20/1.37  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.20/1.37  
% 1.20/1.37  % ------  iProver source info
% 1.20/1.37  
% 1.20/1.37  % git: date: 2026-07-19 20:42:38 +0200
% 1.20/1.37  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.20/1.37  % git: non_committed_changes: false
% 1.20/1.37  
% 1.20/1.37  % ------ Parsing...% successful
% 1.20/1.37  
% 1.20/1.37  
% 1.20/1.37  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.20/1.37  
% 1.20/1.37  % ------ Preprocessing... sf_s  rm: 2 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e % 
% 1.20/1.37  
% 1.20/1.37  % SZS status Unsatisfiable for theBenchmark.p
% 1.20/1.37  
% 1.20/1.37  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.20/1.37  
% 1.20/1.37  
%------------------------------------------------------------------------------