↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 60.21s 15.96s
% Output   : CNFRefutation 60.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   34 (  18 unt;   5 def)
%            Number of atoms       :   92 (   5 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   49 (  28   ~;  21   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   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    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   43 (   0 sgn  43   !;   0   ?;  36   :)

% 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,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18) ).

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

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

tcf(c_56,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_57,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(X1,X0))),
    inference(cnf_transformation,[],[f2]) ).

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

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

tcf(c_86,definition,
    iPr_def_10 = implies(b,c),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_87,definition,
    iPr_def_11 = implies(a,iPr_def_10),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

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

tcf(c_89,definition,
    iPr_def_13 = implies(b,iPr_def_12),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_90,definition,
    iPr_def_14 = implies(iPr_def_11,iPr_def_13),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_91,negated_conjecture,
    ~ is_a_theorem(iPr_def_14),
    inference(demodulation,[status(thm)],[c_62,c_88,c_89,c_86,c_87,c_90]) ).

tcf(c_242422,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(X1,X0))
      | ~ is_a_theorem(X0) ),
    inference(superposition,[status(thm)],[c_57,c_56]) ).

tcf(c_242474,plain,
    ! [X0: $i] : is_a_theorem(implies(implies(X0,iPr_def_10),implies(implies(X0,b),implies(X0,c)))),
    inference(superposition,[status(thm)],[c_86,c_58]) ).

tcf(c_242488,plain,
    ! [X0: $i] : is_a_theorem(implies(implies(iPr_def_11,implies(X0,iPr_def_13)),implies(implies(iPr_def_11,X0),iPr_def_14))),
    inference(superposition,[status(thm)],[c_90,c_58]) ).

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

tcf(c_242535,plain,
    is_a_theorem(implies(implies(a,iPr_def_10),implies(implies(a,b),iPr_def_12))),
    inference(superposition,[status(thm)],[c_88,c_242474]) ).

tcf(c_242537,plain,
    is_a_theorem(implies(iPr_def_11,implies(implies(a,b),iPr_def_12))),
    inference(light_normalisation,[status(thm)],[c_242535,c_87]) ).

tcf(c_242769,plain,
    ! [X0: $i] :
      ( is_a_theorem(implies(implies(iPr_def_11,X0),iPr_def_14))
      | ~ is_a_theorem(implies(iPr_def_11,implies(X0,iPr_def_13))) ),
    inference(superposition,[status(thm)],[c_242488,c_56]) ).

tcf(c_242802,plain,
    ! [X0: $i] :
      ( is_a_theorem(implies(implies(iPr_def_11,X0),iPr_def_14))
      | ~ is_a_theorem(implies(X0,iPr_def_13)) ),
    inference(superposition,[status(thm)],[c_242422,c_242769]) ).

tcf(c_243286,plain,
    ! [X0: $i] :
      ( is_a_theorem(iPr_def_14)
      | ~ is_a_theorem(implies(iPr_def_11,X0))
      | ~ is_a_theorem(implies(X0,iPr_def_13)) ),
    inference(superposition,[status(thm)],[c_242802,c_56]) ).

tcf(c_243287,plain,
    ! [X0: $i] :
      ( ~ is_a_theorem(implies(iPr_def_11,X0))
      | ~ is_a_theorem(implies(X0,iPr_def_13)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_243286,c_91]) ).

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

tcf(c_243535,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X0,X2)))
      | ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X0,X1))) ),
    inference(superposition,[status(thm)],[c_58,c_243521]) ).

tcf(c_243538,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(implies(X2,X1))
      | ~ is_a_theorem(implies(X2,X0))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(superposition,[status(thm)],[c_242422,c_243521]) ).

tcf(c_243840,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X0,X2)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(superposition,[status(thm)],[c_242422,c_243535]) ).

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

tcf(c_244682,plain,
    ! [X0: $i] :
      ( is_a_theorem(implies(implies(b,implies(X0,iPr_def_12)),iPr_def_13))
      | ~ is_a_theorem(implies(b,X0)) ),
    inference(superposition,[status(thm)],[c_89,c_243840]) ).

tcf(c_246158,plain,
    ! [X0: $i] :
      ( ~ is_a_theorem(implies(b,X0))
      | ~ is_a_theorem(implies(iPr_def_11,implies(b,implies(X0,iPr_def_12)))) ),
    inference(superposition,[status(thm)],[c_244682,c_243287]) ).

tcf(c_246224,plain,
    ! [X0: $i] :
      ( ~ is_a_theorem(implies(b,X0))
      | ~ is_a_theorem(implies(iPr_def_11,implies(X0,iPr_def_12))) ),
    inference(superposition,[status(thm)],[c_243878,c_246158]) ).

tcf(c_246233,plain,
    ~ is_a_theorem(implies(b,implies(a,b))),
    inference(superposition,[status(thm)],[c_242537,c_246224]) ).

tcf(c_246238,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_246233,c_57]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL040-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.08/0.37  % Computer : n013.cluster.edu
% 0.08/0.37  % Model    : x86_64 x86_64
% 0.08/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37  % Memory   : 8046.5625MB
% 0.08/0.37  % OS       : Linux 6.8.0-71-generic
% 0.08/0.37  % CPULimit : 300
% 0.08/0.37  % WCLimit  : 300
% 0.08/0.37  % DateTime : Wed Sep 23 21:41:52 UTC 2026
% 0.08/0.37  % CPUTime  : 
% 0.08/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.41  Running first-order theorem proving
% 0.08/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.08/0.42  
% 0.08/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.42  
% 0.08/0.42  % Detected problem language: tptp
% 0.08/0.43  % Proving...
% 60.21/15.96  % SZS status Started for theBenchmark.p
% 60.21/15.96  % SZS status Unsatisfiable for theBenchmark.p
% 60.21/15.96  
% 60.21/15.96  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 60.21/15.96  
% 60.21/15.96  % ------  iProver source info
% 60.21/15.96  
% 60.21/15.96  % git: date: 2026-07-19 20:42:38 +0200
% 60.21/15.96  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 60.21/15.96  % git: non_committed_changes: false
% 60.21/15.96  
% 60.21/15.96  % ------ Parsing...% successful
% 60.21/15.96  
% 60.21/15.96  
% 60.21/15.96  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 60.21/15.96  
% 60.21/15.96  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 60.21/15.96  
% 60.21/15.96  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 60.21/15.96  
% 60.21/15.96  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 60.21/15.96  % ------ Proving...
% 60.21/15.96  % ------ Problem Properties 
% 60.21/15.96  
% 60.21/15.96  % 
% 60.21/15.96  % clauses                               12
% 60.21/15.96  % conjectures                           1
% 60.21/15.96  % EPR                                   1
% 60.21/15.96  % Horn                                  12
% 60.21/15.96  % unary                                 11
% 60.21/15.96  % binary                                0
% 60.21/15.96  % lits                                  14
% 60.21/15.96  % lits eq                               5
% 60.21/15.96  % fd_pure                               0
% 60.21/15.96  % fd_pseudo                             0
% 60.21/15.96  % fd_cond                               0
% 60.21/15.96  % fd_pseudo_cond                        0
% 60.21/15.96  % AC symbols                            0
% 60.21/15.96  
% 60.21/15.96  % ------ Schedule dynamic 5 is on 
% 60.21/15.96  
% 60.21/15.96  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 60.21/15.96  
% 60.21/15.96  
% 60.21/15.96  % ------ 
% 60.21/15.96  % Current options:
% 60.21/15.96  % ------ 
% 60.21/15.96  
% 60.21/15.96  
% 60.21/15.96  % 
% 60.21/15.96  
% 60.21/15.96  % ------ Proving...
% 60.21/15.96  % Proof_search_loop: time out after: 7720 full_loop iterations
% 60.21/15.96  
% 60.21/15.96  % ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 60.21/15.96  
% 60.21/15.96  
% 60.21/15.96  % ------ 
% 60.21/15.96  % Current options:
% 60.21/15.96  % ------ 
% 60.21/15.96  
% 60.21/15.96  
% 60.21/15.96  % 
% 60.21/15.96  
% 60.21/15.96  % ------ Proving...
% 60.21/15.96  % 
% 60.21/15.96  
% 60.21/15.96  % SZS status Unsatisfiable for theBenchmark.p
% 60.21/15.96  
% 60.21/15.96  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 60.21/15.96  
% 60.21/15.96  
%------------------------------------------------------------------------------