↑ Up

iProver---3.9.4.UNS-CRf.s

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

% 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 : Fri Sep 25 03:39:44 PM UTC 2026

% Result   : Unsatisfiable 1.80s 1.28s
% Output   : CNFRefutation 1.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   32 (   5 unt;   0 def)
%            Number of atoms       :   69 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   69 (  32   ~;  37   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   5 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  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   61 (   0 sgn  61   !;   0   ?;  47   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X0,X1] :
      ( f(X0,z(X0,X1))
      | f(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).

fof(f3,negated_conjecture,
    ! [X0,X1] :
      ( ~ f(X0,z(X0,X1))
      | ~ f(X1,X0)
      | ~ f(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).

fof(f4,negated_conjecture,
    ! [X0,X1] :
      ( ~ f(z(X0,X1),X0)
      | f(X0,z(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).

fof(f5,negated_conjecture,
    ! [X0,X1] :
      ( f(z(X0,X1),X0)
      | ~ f(X0,z(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).

fof(f7,negated_conjecture,
    ! [X0,X1] :
      ( f(X1,z(X0,X1))
      | ~ f(X0,z(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause7) ).

fof(f8,negated_conjecture,
    ! [X0,X1] :
      ( ~ f(z(X1,X0),z(X1,X0))
      | f(X1,X0)
      | ~ f(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).

fof(f13,negated_conjecture,
    ! [X0,X1] :
      ( ~ f(z(X0,X1),X1)
      | f(X1,X0)
      | f(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause13) ).

tcf(c_63,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( f(X0,X1)
      | f(X0,z(X0,X1)) ),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_65,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ f(X1,X0)
      | ~ f(X0,X1)
      | ~ f(X0,z(X0,X1)) ),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_66,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( f(X0,z(X0,X1))
      | ~ f(z(X0,X1),X0) ),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_67,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( f(z(X0,X1),X0)
      | ~ f(X0,z(X0,X1)) ),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_69,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( f(X1,z(X0,X1))
      | ~ f(X0,z(X0,X1)) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_70,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( f(X0,X1)
      | ~ f(X1,X0)
      | ~ f(z(X0,X1),z(X0,X1)) ),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_75,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( f(X1,X0)
      | f(X0,X1)
      | ~ f(z(X0,X1),X1) ),
    inference(cnf_transformation,[],[f13]) ).

tcf(c_87,plain,
    ! [X0: $i,X1: $i] :
      ( f(X0,z(X0,X1))
      | ~ f(z(X0,X1),X0) ),
    inference(prop_impl_just,[status(thm)],[c_66]) ).

tcf(c_91,plain,
    ! [X0: $i,X1: $i] :
      ( f(z(X0,X1),X0)
      | f(X0,X1) ),
    inference(prop_impl_just,[status(thm)],[c_63,c_67]) ).

tcf(c_92,plain,
    ! [X0: $i,X1: $i] :
      ( f(X0,X1)
      | f(z(X0,X1),X0) ),
    inference(renaming,[status(thm)],[c_91]) ).

tcf(c_97,plain,
    ! [X0: $i,X1: $i] :
      ( f(X1,z(X0,X1))
      | ~ f(z(X0,X1),X0) ),
    inference(prop_impl_just,[status(thm)],[c_69,c_66]) ).

tcf(c_131,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ f(X1,X0)
      | ~ f(X0,X1)
      | ~ f(z(X0,X1),X0) ),
    inference(bin_hyper_res,[status(thm)],[c_65,c_87]) ).

tcf(c_201,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ f(X1,X0)
      | ~ f(X0,X1)
      | ~ f(z(X0,X1),X0) ),
    inference(demodulation,[status(thm)],[c_131]) ).

tcf(c_203,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( f(X1,X0)
      | f(X0,X1)
      | ~ f(z(X0,X1),X1) ),
    inference(demodulation,[status(thm)],[c_75]) ).

tcf(c_208,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( f(X0,X1)
      | ~ f(X1,X0)
      | ~ f(z(X0,X1),z(X0,X1)) ),
    inference(demodulation,[status(thm)],[c_70]) ).

tcf(c_508,plain,
    ! [X0: $i] : f(X0,X0),
    inference(superposition,[status(thm)],[c_92,c_203]) ).

tcf(c_524,plain,
    ! [X0: $i,X1: $i] :
      ( f(X1,X0)
      | f(X0,z(X1,X0)) ),
    inference(superposition,[status(thm)],[c_92,c_97]) ).

tcf(c_533,plain,
    ! [X0: $i,X1: $i] :
      ( f(X1,X0)
      | f(X0,z(X1,X0)) ),
    inference(superposition,[status(thm)],[c_92,c_97]) ).

tcf(c_571,plain,
    ! [X0: $i,X1: $i] :
      ( f(X1,X0)
      | ~ f(X0,X1) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_208,c_508]) ).

tcf(c_581,plain,
    ! [X0: $i,X1: $i] :
      ( f(X1,X0)
      | ~ f(z(X0,X1),X1) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_203,c_571]) ).

tcf(c_637,plain,
    ! [X0: $i,X1: $i] :
      ( f(X0,X1)
      | f(z(X0,X1),X1) ),
    inference(superposition,[status(thm)],[c_524,c_571]) ).

tcf(c_641,plain,
    ! [X0: $i,X1: $i] : f(X1,X0),
    inference(global_subsumption_just,[status(thm)],[c_533,c_571,c_581,c_637]) ).

tcf(c_642,plain,
    ! [X0: $i,X1: $i] : f(X0,X1),
    inference(renaming,[status(thm)],[c_641]) ).

tcf(c_643,negated_conjecture,
    ! [X0: $i,X1: $i] : ~ f(z(X0,X1),X0),
    inference(global_subsumption_just,[status(thm)],[c_201,c_131,c_571,c_642]) ).

tcf(c_646,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_643,c_642]) ).


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