↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : LCL067-1 : TPTP v9.3.1. Released v1.0.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:05:33 PM UTC 2026

% Result   : Unsatisfiable 1.37s 1.77s
% Output   : CNFRefutation 1.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   52 (  36 unt;   5 def)
%            Number of atoms       :  136 (   5 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   53 (  30   ~;  23   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   6 usr;   6 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   59 (   0 sgn  59   !;   0   ?;  48   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( is_a_theorem(X1)
      | ~ is_a_theorem(X0)
      | ~ is_a_theorem(implies(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

fof(f2,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_19) ).

fof(f3,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X0),X2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_37) ).

fof(f4,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(not(X0),X1),implies(implies(X2,X1),implies(implies(X0,X2),X1)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_59) ).

fof(f5,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_1) ).

tcf(c_54,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(X1)
      | ~ is_a_theorem(X0)
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_55,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_56,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X0),X2))),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_57,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(not(X0),X1),implies(implies(X2,X1),implies(implies(X0,X2),X1)))),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_58,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_76,definition,
    iPr_def_10 = implies(a,b),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_77,definition,
    iPr_def_11 = implies(b,c),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_78,definition,
    iPr_def_12 = implies(a,c),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_79,definition,
    iPr_def_13 = implies(iPr_def_11,iPr_def_12),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_80,definition,
    iPr_def_14 = implies(iPr_def_10,iPr_def_13),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_81,negated_conjecture,
    ~ is_a_theorem(iPr_def_14),
    inference(demodulation,[status(thm)],[c_58,c_78,c_77,c_79,c_76,c_80]) ).

tcf(c_214,plain,
    ! [X0: $i] : is_a_theorem(implies(implies(iPr_def_12,X0),implies(c,X0))),
    inference(superposition,[status(thm)],[c_78,c_55]) ).

tcf(c_215,plain,
    ! [X0: $i] : is_a_theorem(implies(implies(iPr_def_13,X0),implies(iPr_def_12,X0))),
    inference(superposition,[status(thm)],[c_79,c_55]) ).

tcf(c_221,plain,
    ! [X0: $i] : is_a_theorem(implies(implies(implies(X0,iPr_def_10),iPr_def_13),iPr_def_14)),
    inference(superposition,[status(thm)],[c_80,c_55]) ).

tcf(c_222,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(implies(X1,X2))
      | ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
    inference(superposition,[status(thm)],[c_55,c_54]) ).

tcf(c_245,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(implies(not(X0),X2))
      | ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
    inference(superposition,[status(thm)],[c_56,c_54]) ).

tcf(c_267,plain,
    ! [X0: $i] : is_a_theorem(implies(implies(not(a),X0),implies(implies(b,X0),implies(iPr_def_10,X0)))),
    inference(superposition,[status(thm)],[c_76,c_57]) ).

tcf(c_268,plain,
    ! [X0: $i] : is_a_theorem(implies(implies(not(b),X0),implies(implies(c,X0),implies(iPr_def_11,X0)))),
    inference(superposition,[status(thm)],[c_77,c_57]) ).

tcf(c_272,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(implies(implies(X2,X1),implies(implies(X0,X2),X1)))
      | ~ is_a_theorem(implies(not(X0),X1)) ),
    inference(superposition,[status(thm)],[c_57,c_54]) ).

tcf(c_371,plain,
    ! [X0: $i] :
      ( is_a_theorem(implies(c,X0))
      | ~ is_a_theorem(implies(iPr_def_12,X0)) ),
    inference(superposition,[status(thm)],[c_214,c_54]) ).

tcf(c_382,plain,
    ! [X0: $i] :
      ( is_a_theorem(implies(iPr_def_12,X0))
      | ~ is_a_theorem(implies(iPr_def_13,X0)) ),
    inference(superposition,[status(thm)],[c_215,c_54]) ).

tcf(c_518,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(X1,X0))),
    inference(superposition,[status(thm)],[c_55,c_222]) ).

tcf(c_530,plain,
    is_a_theorem(implies(iPr_def_13,iPr_def_14)),
    inference(superposition,[status(thm)],[c_221,c_222]) ).

tcf(c_659,plain,
    is_a_theorem(implies(iPr_def_12,iPr_def_14)),
    inference(superposition,[status(thm)],[c_530,c_382]) ).

tcf(c_663,plain,
    is_a_theorem(implies(c,iPr_def_14)),
    inference(superposition,[status(thm)],[c_659,c_371]) ).

tcf(c_687,plain,
    ! [X0: $i] : is_a_theorem(implies(not(implies(X0,iPr_def_10)),iPr_def_14)),
    inference(superposition,[status(thm)],[c_221,c_245]) ).

tcf(c_694,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(not(X0),implies(X1,implies(X0,X2)))),
    inference(superposition,[status(thm)],[c_518,c_245]) ).

tcf(c_1258,plain,
    ! [X0: $i] : is_a_theorem(implies(not(a),implies(X0,iPr_def_12))),
    inference(superposition,[status(thm)],[c_78,c_694]) ).

tcf(c_1259,plain,
    ! [X0: $i] : is_a_theorem(implies(not(iPr_def_11),implies(X0,iPr_def_13))),
    inference(superposition,[status(thm)],[c_79,c_694]) ).

tcf(c_1295,plain,
    is_a_theorem(implies(not(a),iPr_def_13)),
    inference(superposition,[status(thm)],[c_79,c_1258]) ).

tcf(c_1302,plain,
    is_a_theorem(implies(not(iPr_def_11),iPr_def_14)),
    inference(superposition,[status(thm)],[c_80,c_1259]) ).

tcf(c_1416,plain,
    is_a_theorem(implies(implies(not(a),iPr_def_13),implies(implies(b,iPr_def_13),iPr_def_14))),
    inference(superposition,[status(thm)],[c_80,c_267]) ).

tcf(c_1493,plain,
    ! [X0: $i] :
      ( is_a_theorem(implies(implies(c,X0),implies(iPr_def_11,X0)))
      | ~ is_a_theorem(implies(not(b),X0)) ),
    inference(superposition,[status(thm)],[c_268,c_54]) ).

tcf(c_1585,plain,
    ( is_a_theorem(implies(implies(b,iPr_def_13),iPr_def_14))
    | ~ is_a_theorem(implies(not(a),iPr_def_13)) ),
    inference(superposition,[status(thm)],[c_1416,c_54]) ).

tcf(c_1588,plain,
    is_a_theorem(implies(implies(b,iPr_def_13),iPr_def_14)),
    inference(forward_subsumption_resolution,[status(thm)],[c_1585,c_1295]) ).

tcf(c_1590,plain,
    is_a_theorem(implies(not(b),iPr_def_14)),
    inference(superposition,[status(thm)],[c_1588,c_245]) ).

tcf(c_2100,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(implies(implies(X0,X2),X1))
      | ~ is_a_theorem(implies(X2,X1))
      | ~ is_a_theorem(implies(not(X0),X1)) ),
    inference(superposition,[status(thm)],[c_272,c_54]) ).

tcf(c_2748,plain,
    ! [X0: $i] :
      ( is_a_theorem(implies(iPr_def_11,X0))
      | ~ is_a_theorem(implies(c,X0))
      | ~ is_a_theorem(implies(not(b),X0)) ),
    inference(superposition,[status(thm)],[c_1493,c_54]) ).

tcf(c_2881,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(X1)
      | ~ is_a_theorem(implies(X2,X1))
      | ~ is_a_theorem(implies(X0,X2))
      | ~ is_a_theorem(implies(not(X0),X1)) ),
    inference(superposition,[status(thm)],[c_2100,c_54]) ).

tcf(c_5744,plain,
    ( is_a_theorem(implies(iPr_def_11,iPr_def_14))
    | ~ is_a_theorem(implies(c,iPr_def_14)) ),
    inference(superposition,[status(thm)],[c_1590,c_2748]) ).

tcf(c_5758,plain,
    is_a_theorem(implies(iPr_def_11,iPr_def_14)),
    inference(forward_subsumption_resolution,[status(thm)],[c_5744,c_663]) ).

tcf(c_6724,plain,
    ! [X0: $i] :
      ( is_a_theorem(iPr_def_14)
      | ~ is_a_theorem(implies(iPr_def_11,X0))
      | ~ is_a_theorem(implies(X0,iPr_def_14)) ),
    inference(superposition,[status(thm)],[c_1302,c_2881]) ).

tcf(c_6786,plain,
    ! [X0: $i] :
      ( ~ is_a_theorem(implies(iPr_def_11,X0))
      | ~ is_a_theorem(implies(X0,iPr_def_14)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_6724,c_81]) ).

tcf(c_7831,plain,
    ! [X0: $i] : ~ is_a_theorem(implies(implies(X0,iPr_def_11),iPr_def_14)),
    inference(superposition,[status(thm)],[c_518,c_6786]) ).

tcf(c_8137,plain,
    ! [X0: $i] :
      ( ~ is_a_theorem(implies(iPr_def_11,iPr_def_14))
      | ~ is_a_theorem(implies(not(X0),iPr_def_14)) ),
    inference(superposition,[status(thm)],[c_2100,c_7831]) ).

tcf(c_8140,plain,
    ! [X0: $i] : ~ is_a_theorem(implies(not(X0),iPr_def_14)),
    inference(forward_subsumption_resolution,[status(thm)],[c_8137,c_5758]) ).

tcf(c_8141,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_687,c_8140]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL067-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.38  % Computer : n007.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Wed Sep 23 21:46:22 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.41  Running first-order theorem proving
% 0.13/0.41  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...
% 1.37/1.77  % SZS status Started for theBenchmark.p
% 1.37/1.77  % SZS status Unsatisfiable for theBenchmark.p
% 1.37/1.77  
% 1.37/1.77  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.37/1.77  
% 1.37/1.77  % ------  iProver source info
% 1.37/1.77  
% 1.37/1.77  % git: date: 2026-07-19 20:42:38 +0200
% 1.37/1.77  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.37/1.77  % git: non_committed_changes: false
% 1.37/1.77  
% 1.37/1.77  % ------ Parsing...% successful
% 1.37/1.77  
% 1.37/1.77  
% 1.37/1.77  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.37/1.77  
% 1.37/1.77  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.37/1.77  
% 1.37/1.77  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.37/1.77  
% 1.37/1.77  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.37/1.77  % ------ Proving...
% 1.37/1.77  % ------ Problem Properties 
% 1.37/1.77  
% 1.37/1.77  % 
% 1.37/1.77  % clauses                               10
% 1.37/1.77  % conjectures                           1
% 1.37/1.77  % EPR                                   1
% 1.37/1.77  % Horn                                  10
% 1.37/1.77  % unary                                 9
% 1.37/1.77  % binary                                0
% 1.37/1.77  % lits                                  12
% 1.37/1.77  % lits eq                               5
% 1.37/1.77  % fd_pure                               0
% 1.37/1.77  % fd_pseudo                             0
% 1.37/1.77  % fd_cond                               0
% 1.37/1.77  % fd_pseudo_cond                        0
% 1.37/1.77  % AC symbols                            0
% 1.37/1.77  
% 1.37/1.77  % ------ Schedule dynamic 5 is on 
% 1.37/1.77  
% 1.37/1.77  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.37/1.77  
% 1.37/1.77  
% 1.37/1.77  % ------ 
% 1.37/1.77  % Current options:
% 1.37/1.77  % ------ 
% 1.37/1.77  
% 1.37/1.77  
% 1.37/1.77  % 
% 1.37/1.77  
% 1.37/1.77  % ------ Proving...
% 1.37/1.77  % 
% 1.37/1.77  
% 1.37/1.77  % SZS status Unsatisfiable for theBenchmark.p
% 1.37/1.77  
% 1.37/1.77  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.37/1.77  
% 1.37/1.77  
%------------------------------------------------------------------------------