↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN660-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 : n017.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:19 PM UTC 2026

% Result   : Unsatisfiable 3.18s 6.50s
% Output   : CNFRefutation 3.19s
% 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(f6,negated_conjecture,
    ! [X0] : p2(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_6) ).

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,f16(X0,f9(f17(c31)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p2_19) ).

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

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

fof(f50,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_50) ).

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

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

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

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

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

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

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

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

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

tcf(c_523,definition,
    iPr_def_21 = f4(c33),
    introduced(definition,[new_symbols(definition,[iPr_def_21])],[]) ).

tcf(c_524,definition,
    iPr_def_22 = f11(iPr_def_21,c34),
    introduced(definition,[new_symbols(definition,[iPr_def_22])],[]) ).

tcf(c_525,definition,
    iPr_def_23 = f16(iPr_def_22,iPr_def_15),
    introduced(definition,[new_symbols(definition,[iPr_def_23])],[]) ).

tcf(c_527,negated_conjecture,
    ! [X0: $i] :
      ( p2(f11(f4(X0),c34),iPr_def_11)
      | ~ p25(c32,X0)
      | ~ p25(X0,c36) ),
    inference(demodulation,[status(thm)],[c_152,c_512,c_513]) ).

tcf(c_534,negated_conjecture,
    p2(iPr_def_11,iPr_def_23),
    inference(demodulation,[status(thm)],[c_141,c_523,c_524,c_525]) ).

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

tcf(c_543,negated_conjecture,
    ! [X0: $i] : ~ p2(X0,f16(X0,iPr_def_15)),
    inference(demodulation,[status(thm)],[c_121]) ).

tcf(c_545,negated_conjecture,
    p25(c32,c33),
    inference(demodulation,[status(thm)],[c_116]) ).

tcf(c_547,negated_conjecture,
    p25(c33,c36),
    inference(demodulation,[status(thm)],[c_114]) ).

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

tcf(c_1105,plain,
    ( p2(f11(iPr_def_21,c34),iPr_def_11)
    | ~ p25(c32,c33)
    | ~ p25(c33,c36) ),
    inference(superposition,[status(thm)],[c_523,c_527]) ).

tcf(c_1111,plain,
    ( p2(iPr_def_22,iPr_def_11)
    | ~ p25(c32,c33)
    | ~ p25(c33,c36) ),
    inference(light_normalisation,[status(thm)],[c_1105,c_524]) ).

tcf(c_1112,plain,
    p2(iPr_def_22,iPr_def_11),
    inference(forward_subsumption_resolution,[status(thm)],[c_1111,c_545,c_547]) ).

tcf(c_1126,plain,
    ! [X0: $i] :
      ( p2(iPr_def_11,X0)
      | ~ p2(iPr_def_22,X0) ),
    inference(superposition,[status(thm)],[c_1112,c_536]) ).

tcf(c_1395,plain,
    ~ p2(iPr_def_22,iPr_def_23),
    inference(superposition,[status(thm)],[c_525,c_543]) ).

tcf(c_1474,plain,
    p2(iPr_def_11,iPr_def_22),
    inference(superposition,[status(thm)],[c_549,c_1126]) ).

tcf(c_1488,plain,
    ! [X0: $i] :
      ( p2(iPr_def_22,X0)
      | ~ p2(iPr_def_11,X0) ),
    inference(superposition,[status(thm)],[c_1474,c_536]) ).

tcf(c_1588,plain,
    p2(iPr_def_22,iPr_def_23),
    inference(superposition,[status(thm)],[c_534,c_1488]) ).

tcf(c_1590,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1588,c_1395]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN660-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.10/5.58  % Computer : n017.cluster.edu
% 0.10/5.58  % Model    : x86_64 x86_64
% 0.10/5.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.58  % Memory   : 8046.5625MB
% 0.10/5.58  % OS       : Linux 6.8.0-71-generic
% 0.10/5.58  % CPULimit : 300
% 0.10/5.58  % WCLimit  : 300
% 0.10/5.58  % DateTime : Fri Sep 25 01:56:38 UTC 2026
% 0.10/5.58  % CPUTime  : 
% 0.10/5.58  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.61  Running first-order theorem proving
% 0.14/5.61  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.14/5.63  
% 0.14/5.63  % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.63  
% 0.14/5.63  % Detected problem language: tptp
% 0.14/5.64  % Proving...
% 3.18/6.50  % SZS status Started for theBenchmark.p
% 3.18/6.50  % SZS status Unsatisfiable for theBenchmark.p
% 3.18/6.50  
% 3.18/6.50  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.18/6.50  
% 3.18/6.50  % ------  iProver source info
% 3.18/6.50  
% 3.18/6.50  % git: date: 2026-07-19 20:42:38 +0200
% 3.18/6.50  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.18/6.50  % git: non_committed_changes: false
% 3.18/6.50  
% 3.18/6.50  % ------ Parsing...% successful
% 3.18/6.50  
% 3.18/6.50  
% 3.18/6.50  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.18/6.50  
% 3.18/6.50  % ------ Preprocessing... sf_s  rm: 29 0s  sf_e  pe_s  pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 3.18/6.50  
% 3.18/6.50  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.18/6.50  
% 3.18/6.50  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.18/6.50  % ------ Proving...
% 3.18/6.50  % ------ Problem Properties 
% 3.18/6.50  
% 3.18/6.50  % 
% 3.18/6.50  % clauses                               40
% 3.18/6.50  % conjectures                           25
% 3.18/6.50  % EPR                                   15
% 3.18/6.50  % Horn                                  40
% 3.18/6.50  % unary                                 27
% 3.18/6.50  % binary                                4
% 3.18/6.50  % lits                                  63
% 3.18/6.50  % lits eq                               15
% 3.18/6.50  % fd_pure                               0
% 3.18/6.50  % fd_pseudo                             0
% 3.18/6.50  % fd_cond                               0
% 3.18/6.50  % fd_pseudo_cond                        0
% 3.18/6.50  % AC symbols                            0
% 3.18/6.50  
% 3.18/6.50  % ------ Schedule dynamic 5 is on 
% 3.18/6.50  
% 3.18/6.50  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.18/6.50  
% 3.18/6.50  
% 3.18/6.50  % ------ 
% 3.18/6.50  % Current options:
% 3.18/6.50  % ------ 
% 3.18/6.50  
% 3.18/6.50  
% 3.18/6.50  % 
% 3.18/6.50  
% 3.18/6.50  % ------ Proving...
% 3.18/6.50  % 
% 3.18/6.50  
% 3.18/6.50  % SZS status Unsatisfiable for theBenchmark.p
% 3.18/6.50  
% 3.18/6.50  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.19/6.50  
% 3.19/6.50  
%------------------------------------------------------------------------------