↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n001.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:41:22 PM UTC 2026

% Result   : Unsatisfiable 3.80s 1.30s
% Output   : CNFRefutation 3.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   35 (  25 unt;   5 def)
%            Number of atoms       :   82 (   5 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   40 (  22   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   8 usr;   7 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn  20   !;   0   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,negated_conjecture,
    ! [X0] : p2(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_7) ).

fof(f12,negated_conjecture,
    p25(c33,c36),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p25_12) ).

fof(f14,negated_conjecture,
    p25(c32,c33),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p25_14) ).

fof(f19,negated_conjecture,
    ! [X0] : ~ p2(X0,f18(X0,f9(f17(c31)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p2_19) ).

fof(f31,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ p2(X2,X1)
      | ~ p2(X2,X0)
      | p2(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_31) ).

fof(f39,negated_conjecture,
    p2(f11(f4(c32),c34),f18(f11(f4(c33),c34),f9(f17(c31)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_39) ).

fof(f51,negated_conjecture,
    ! [X0] :
      ( ~ p25(c32,X0)
      | ~ p25(X0,c36)
      | p2(f11(f4(X0),c34),f11(f4(c32),c34)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_51) ).

tcf(c_110,negated_conjecture,
    ! [X0: $i] : p2(X0,X0),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_115,negated_conjecture,
    p25(c33,c36),
    inference(cnf_transformation,[],[f12]) ).

tcf(c_117,negated_conjecture,
    p25(c32,c33),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_122,negated_conjecture,
    ! [X0: $i] : ~ p2(X0,f18(X0,f9(f17(c31)))),
    inference(cnf_transformation,[],[f19]) ).

tcf(c_134,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( p2(X1,X2)
      | ~ p2(X0,X2)
      | ~ p2(X0,X1) ),
    inference(cnf_transformation,[],[f31]) ).

tcf(c_142,negated_conjecture,
    p2(f11(f4(c32),c34),f18(f11(f4(c33),c34),f9(f17(c31)))),
    inference(cnf_transformation,[],[f39]) ).

tcf(c_154,negated_conjecture,
    ! [X0: $i] :
      ( p2(f11(f4(X0),c34),f11(f4(c32),c34))
      | ~ p25(c32,X0)
      | ~ p25(X0,c36) ),
    inference(cnf_transformation,[],[f51]) ).

tcf(c_518,definition,
    iPr_def_10 = f4(c32),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_519,definition,
    iPr_def_11 = f11(iPr_def_10,c34),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_532,definition,
    iPr_def_24 = f4(c33),
    introduced(definition,[new_symbols(definition,[iPr_def_24])],[]) ).

tcf(c_533,definition,
    iPr_def_25 = f11(iPr_def_24,c34),
    introduced(definition,[new_symbols(definition,[iPr_def_25])],[]) ).

tcf(c_534,definition,
    iPr_def_26 = f18(iPr_def_25,iPr_def_13),
    introduced(definition,[new_symbols(definition,[iPr_def_26])],[]) ).

tcf(c_536,negated_conjecture,
    ! [X0: $i] :
      ( p2(f11(f4(X0),c34),iPr_def_11)
      | ~ p25(c32,X0)
      | ~ p25(X0,c36) ),
    inference(demodulation,[status(thm)],[c_154,c_518,c_519]) ).

tcf(c_544,negated_conjecture,
    p2(iPr_def_11,iPr_def_26),
    inference(demodulation,[status(thm)],[c_142,c_532,c_533,c_534]) ).

tcf(c_546,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( p2(X1,X2)
      | ~ p2(X0,X2)
      | ~ p2(X0,X1) ),
    inference(demodulation,[status(thm)],[c_134]) ).

tcf(c_553,negated_conjecture,
    ! [X0: $i] : ~ p2(X0,f18(X0,iPr_def_13)),
    inference(demodulation,[status(thm)],[c_122]) ).

tcf(c_555,negated_conjecture,
    p25(c32,c33),
    inference(demodulation,[status(thm)],[c_117]) ).

tcf(c_557,negated_conjecture,
    p25(c33,c36),
    inference(demodulation,[status(thm)],[c_115]) ).

tcf(c_559,negated_conjecture,
    ! [X0: $i] : p2(X0,X0),
    inference(demodulation,[status(thm)],[c_110]) ).

tcf(c_1144,plain,
    ( p2(f11(iPr_def_24,c34),iPr_def_11)
    | ~ p25(c32,c33)
    | ~ p25(c33,c36) ),
    inference(superposition,[status(thm)],[c_532,c_536]) ).

tcf(c_1150,plain,
    ( p2(iPr_def_25,iPr_def_11)
    | ~ p25(c32,c33)
    | ~ p25(c33,c36) ),
    inference(light_normalisation,[status(thm)],[c_1144,c_533]) ).

tcf(c_1151,plain,
    p2(iPr_def_25,iPr_def_11),
    inference(forward_subsumption_resolution,[status(thm)],[c_1150,c_555,c_557]) ).

tcf(c_1165,plain,
    ! [X0: $i] :
      ( p2(iPr_def_11,X0)
      | ~ p2(iPr_def_25,X0) ),
    inference(superposition,[status(thm)],[c_1151,c_546]) ).

tcf(c_1530,plain,
    p2(iPr_def_11,iPr_def_25),
    inference(superposition,[status(thm)],[c_559,c_1165]) ).

tcf(c_1533,plain,
    ! [X0: $i] :
      ( p2(iPr_def_25,X0)
      | ~ p2(iPr_def_11,X0) ),
    inference(superposition,[status(thm)],[c_1530,c_546]) ).

tcf(c_1571,plain,
    ~ p2(iPr_def_25,iPr_def_26),
    inference(superposition,[status(thm)],[c_534,c_553]) ).

tcf(c_1663,plain,
    p2(iPr_def_25,iPr_def_26),
    inference(superposition,[status(thm)],[c_544,c_1533]) ).

tcf(c_1665,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1663,c_1571]) ).


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