↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n007.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:32:48 PM UTC 2026

% Result   : Unsatisfiable 3.19s 1.30s
% Output   : CNFRefutation 3.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    9 (   6 unt;   0 def)
%            Number of atoms       :   12 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    9 (   6   ~;   3   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   7 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-12 aty)
%            Number of functors    :   14 (  14 usr;   1 con; 0-2 aty)
%            Number of variables   :   46 (   0 sgn  46   !;   0   ?;  23   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f27,axiom,
    ! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
      ( state(X0,X1,X2,v3(s(X3),X4),X5,X6,X7,X8,X9,X10,e1(X3,X4),X11)
      | ~ state(X0,X1,X2,v3(X3,X4),X5,X6,X7,X8,X9,X10,e1(s(s(X3)),X4),X11) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PUZ004-0.ax',v3_down) ).

fof(f42,axiom,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),o),e2(s(s(s(s(o)))),s(s(s(o))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_state) ).

fof(f43,negated_conjecture,
    ! [X2,X3,X10,X0,X1,X8,X6,X9,X7,X4,X5] : ~ state(X0,X1,X2,v3(s(s(s(o))),o),X3,X4,X5,X6,X7,X8,X9,X10),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_state) ).

tcf(c_92,plain,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),o),e2(s(s(s(s(o)))),s(s(s(o))))),
    inference(cnf_transformation,[],[f42]) ).

tcf(c_93,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i,X8: $i,X9: $i,X10: $i] : ~ state(X0,X1,X2,v3(s(s(s(o))),o),X3,X4,X5,X6,X7,X8,X9,X10),
    inference(cnf_transformation,[],[f43]) ).

tcf(c_120,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i,X8: $i,X9: $i,X10: $i,X11: $i] :
      ( state(X0,X1,X2,v3(s(X3),X4),X5,X6,X7,X8,X9,X10,e1(X3,X4),X11)
      | ~ state(X0,X1,X2,v3(X3,X4),X5,X6,X7,X8,X9,X10,e1(s(s(X3)),X4),X11) ),
    inference(cnf_transformation,[],[f27]) ).

tcf(c_554,plain,
    ( state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(o)),o),e2(s(s(s(s(o)))),s(s(s(o)))))
    | ~ state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),o),e2(s(s(s(s(o)))),s(s(s(o))))) ),
    inference(instantiation,[status(thm)],[c_120]) ).

tcf(c_562,plain,
    ~ state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(o)),o),e2(s(s(s(s(o)))),s(s(s(o))))),
    inference(instantiation,[status(thm)],[c_93]) ).

tcf(c_563,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_562,c_554,c_92]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ038-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.38  % Computer : n007.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Thu Sep 24 06:43:37 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/0.42  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.10/0.43  
% 0.10/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43  
% 0.10/0.44  % Detected problem language: tptp
% 0.10/0.45  % Proving...
% 3.19/1.30  % SZS status Started for theBenchmark.p
% 3.19/1.30  % SZS status Unsatisfiable for theBenchmark.p
% 3.19/1.30  
% 3.19/1.30  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.19/1.30  
% 3.19/1.30  % ------  iProver source info
% 3.19/1.30  
% 3.19/1.30  % git: date: 2026-07-19 20:42:38 +0200
% 3.19/1.30  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.19/1.30  % git: non_committed_changes: false
% 3.19/1.30  
% 3.19/1.30  % ------ Parsing...% successful
% 3.19/1.30  
% 3.19/1.30  
% 3.19/1.30  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.19/1.30  
% 3.19/1.30  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 3.19/1.30  
% 3.19/1.30  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.19/1.30  % ------ Proving...
% 3.19/1.30  % ------ Problem Properties 
% 3.19/1.30  
% 3.19/1.30  % 
% 3.19/1.30  % clauses                               43
% 3.19/1.30  % conjectures                           1
% 3.19/1.30  % EPR                                   0
% 3.19/1.30  % Horn                                  43
% 3.19/1.30  % unary                                 2
% 3.19/1.30  % binary                                41
% 3.19/1.30  % lits                                  84
% 3.19/1.30  % lits eq                               0
% 3.19/1.30  % fd_pure                               0
% 3.19/1.30  % fd_pseudo                             0
% 3.19/1.30  % fd_cond                               0
% 3.19/1.30  % fd_pseudo_cond                        0
% 3.19/1.30  % AC symbols                            0
% 3.19/1.30  
% 3.19/1.30  % ------ Schedule dynamic 5 is on 
% 3.19/1.30  
% 3.19/1.30  % ------ no equalities: superposition off 
% 3.19/1.30  
% 3.19/1.30  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.19/1.30  
% 3.19/1.30  
% 3.19/1.30  % ------ 
% 3.19/1.30  % Current options:
% 3.19/1.30  % ------ 
% 3.19/1.30  
% 3.19/1.30  
% 3.19/1.30  % 
% 3.19/1.30  
% 3.19/1.30  % ------ Proving...
% 3.19/1.30  % 
% 3.19/1.30  
% 3.19/1.30  % SZS status Unsatisfiable for theBenchmark.p
% 3.19/1.30  
% 3.19/1.30  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.19/1.30  
% 3.19/1.30  
%------------------------------------------------------------------------------