↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 2.93s 1.27s
% Output   : CNFRefutation 2.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   37 (  25 unt;   6 def)
%            Number of atoms       :  102 (   6 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   43 (  23   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 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  :    9 (   7 usr;   7 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   52 (   0 sgn  52   !;   0   ?;  39   :)

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

fof(f5,negated_conjecture,
    ! [X0,X1] : p2(f8(X0,X1),f8(X1,X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_5) ).

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

fof(f7,negated_conjecture,
    ! [X2,X0,X1] : p2(f8(X0,f8(X1,X2)),f8(f8(X0,X1),X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_7) ).

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

fof(f9,negated_conjecture,
    ~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p2_9) ).

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

tcf(c_62,negated_conjecture,
    ! [X0: $i,X1: $i] : p2(f8(X0,X1),f8(X1,X0)),
    inference(cnf_transformation,[],[f5]) ).

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

tcf(c_64,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] : p2(f8(X0,f8(X1,X2)),f8(f8(X0,X1),X2)),
    inference(cnf_transformation,[],[f7]) ).

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

tcf(c_66,negated_conjecture,
    ~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_96,definition,
    iPr_def_10 = f9(c4),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_97,definition,
    iPr_def_11 = f8(iPr_def_10,c4),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_98,definition,
    iPr_def_12 = f9(c3),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_99,definition,
    iPr_def_13 = f8(iPr_def_11,iPr_def_12),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_100,definition,
    iPr_def_14 = f8(iPr_def_12,c4),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_101,definition,
    iPr_def_15 = f8(iPr_def_10,iPr_def_14),
    introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).

tcf(c_104,negated_conjecture,
    ~ p2(iPr_def_13,iPr_def_15),
    inference(demodulation,[status(thm)],[c_66,c_100,c_101,c_98,c_96,c_97,c_99]) ).

tcf(c_105,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( p2(f8(X0,X2),f8(X1,X3))
      | ~ p2(X2,X3)
      | ~ p2(X0,X1) ),
    inference(demodulation,[status(thm)],[c_65]) ).

tcf(c_106,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] : p2(f8(X0,f8(X1,X2)),f8(f8(X0,X1),X2)),
    inference(demodulation,[status(thm)],[c_64]) ).

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

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

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

tcf(c_287,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( p2(f8(X0,f8(X1,X2)),X3)
      | ~ p2(f8(f8(X0,X1),X2),X3) ),
    inference(superposition,[status(thm)],[c_106,c_107]) ).

tcf(c_316,plain,
    p2(iPr_def_13,f8(iPr_def_12,iPr_def_11)),
    inference(superposition,[status(thm)],[c_99,c_108]) ).

tcf(c_351,plain,
    ! [X0: $i] :
      ( p2(iPr_def_13,X0)
      | ~ p2(f8(iPr_def_12,iPr_def_11),X0) ),
    inference(superposition,[status(thm)],[c_316,c_107]) ).

tcf(c_433,plain,
    p2(f8(c4,iPr_def_12),iPr_def_14),
    inference(superposition,[status(thm)],[c_100,c_108]) ).

tcf(c_462,plain,
    ! [X0: $i,X1: $i] :
      ( p2(f8(X0,X1),iPr_def_15)
      | ~ p2(X1,iPr_def_14)
      | ~ p2(X0,iPr_def_10) ),
    inference(superposition,[status(thm)],[c_101,c_105]) ).

tcf(c_635,plain,
    ! [X0: $i,X1: $i,X2: $i] : p2(f8(X0,f8(X1,X2)),f8(X2,f8(X0,X1))),
    inference(superposition,[status(thm)],[c_108,c_287]) ).

tcf(c_802,plain,
    ! [X0: $i] : p2(f8(X0,iPr_def_11),f8(c4,f8(X0,iPr_def_10))),
    inference(superposition,[status(thm)],[c_97,c_635]) ).

tcf(c_972,plain,
    p2(iPr_def_13,f8(c4,f8(iPr_def_12,iPr_def_10))),
    inference(superposition,[status(thm)],[c_802,c_351]) ).

tcf(c_997,plain,
    ! [X0: $i] :
      ( p2(iPr_def_13,X0)
      | ~ p2(f8(c4,f8(iPr_def_12,iPr_def_10)),X0) ),
    inference(superposition,[status(thm)],[c_972,c_107]) ).

tcf(c_1279,plain,
    p2(iPr_def_13,f8(iPr_def_10,f8(c4,iPr_def_12))),
    inference(superposition,[status(thm)],[c_635,c_997]) ).

tcf(c_1656,plain,
    ! [X0: $i] :
      ( p2(iPr_def_13,X0)
      | ~ p2(f8(iPr_def_10,f8(c4,iPr_def_12)),X0) ),
    inference(superposition,[status(thm)],[c_1279,c_107]) ).

tcf(c_3732,plain,
    ( p2(iPr_def_13,iPr_def_15)
    | ~ p2(iPr_def_10,iPr_def_10)
    | ~ p2(f8(c4,iPr_def_12),iPr_def_14) ),
    inference(superposition,[status(thm)],[c_462,c_1656]) ).

tcf(c_3774,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3732,c_104,c_112,c_433]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN553-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/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 01:44:39 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.42  % Proving...
% 2.93/1.27  % SZS status Started for theBenchmark.p
% 2.93/1.27  % SZS status Unsatisfiable for theBenchmark.p
% 2.93/1.27  
% 2.93/1.27  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.93/1.27  
% 2.93/1.27  % ------  iProver source info
% 2.93/1.27  
% 2.93/1.27  % git: date: 2026-07-19 20:42:38 +0200
% 2.93/1.27  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.93/1.27  % git: non_committed_changes: false
% 2.93/1.27  
% 2.93/1.27  % ------ Parsing...% successful
% 2.93/1.27  
% 2.93/1.27  
% 2.93/1.27  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.93/1.27  
% 2.93/1.27  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 2.93/1.27  
% 2.93/1.27  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.93/1.27  
% 2.93/1.27  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.93/1.27  % ------ Proving...
% 2.93/1.27  % ------ Problem Properties 
% 2.93/1.27  
% 2.93/1.27  % 
% 2.93/1.27  % clauses                               17
% 2.93/1.27  % conjectures                           9
% 2.93/1.27  % EPR                                   6
% 2.93/1.27  % Horn                                  17
% 2.93/1.27  % unary                                 15
% 2.93/1.27  % binary                                0
% 2.93/1.27  % lits                                  21
% 2.93/1.27  % lits eq                               8
% 2.93/1.27  % fd_pure                               0
% 2.93/1.27  % fd_pseudo                             0
% 2.93/1.27  % fd_cond                               0
% 2.93/1.27  % fd_pseudo_cond                        0
% 2.93/1.27  % AC symbols                            0
% 2.93/1.27  
% 2.93/1.27  % ------ Schedule dynamic 5 is on 
% 2.93/1.27  
% 2.93/1.27  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.93/1.27  
% 2.93/1.27  
% 2.93/1.27  % ------ 
% 2.93/1.27  % Current options:
% 2.93/1.27  % ------ 
% 2.93/1.27  
% 2.93/1.27  
% 2.93/1.27  % 
% 2.93/1.27  
% 2.93/1.27  % ------ Proving...
% 2.93/1.27  % 
% 2.93/1.27  
% 2.93/1.27  % SZS status Unsatisfiable for theBenchmark.p
% 2.93/1.27  
% 2.93/1.27  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.93/1.27  
% 2.93/1.27  
%------------------------------------------------------------------------------