↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : LCL080-2 : 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 : n016.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:35 PM UTC 2026

% Result   : Unsatisfiable 4.65s 7.48s
% Output   : CNFRefutation 4.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   40 (  26 unt;   6 def)
%            Number of atoms       :  102 (   6 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   45 (  27   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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  :    9 (   7 usr;   7 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   47 (   0 sgn  47   !;   0   ?;  38   :)

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

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

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

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

tcf(c_55,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,[],[f3]) ).

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

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

tcf(c_60,negated_conjecture,
    ~ is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))),
    inference(cnf_transformation,[],[f6]) ).

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

tcf(c_82,definition,
    iPr_def_11 = implies(iPr_def_10,c),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

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

tcf(c_84,definition,
    iPr_def_13 = implies(e,a),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_85,definition,
    iPr_def_14 = implies(iPr_def_12,iPr_def_13),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_86,definition,
    iPr_def_15 = implies(iPr_def_11,iPr_def_14),
    introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).

tcf(c_87,negated_conjecture,
    ~ is_a_theorem(iPr_def_15),
    inference(demodulation,[status(thm)],[c_60,c_84,c_83,c_85,c_81,c_82,c_86]) ).

tcf(c_197,plain,
    is_a_theorem(implies(a,iPr_def_13)),
    inference(superposition,[status(thm)],[c_84,c_57]) ).

tcf(c_200,plain,
    is_a_theorem(implies(implies(iPr_def_10,a),a)),
    inference(superposition,[status(thm)],[c_81,c_58]) ).

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

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

tcf(c_288,plain,
    ! [X0: $i] : is_a_theorem(implies(iPr_def_11,implies(implies(c,X0),implies(iPr_def_10,X0)))),
    inference(superposition,[status(thm)],[c_82,c_59]) ).

tcf(c_302,plain,
    ! [X0: $i] : is_a_theorem(implies(implies(iPr_def_11,X0),implies(implies(X0,iPr_def_14),iPr_def_15))),
    inference(superposition,[status(thm)],[c_86,c_59]) ).

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

tcf(c_626,plain,
    ! [X0: $i] :
      ( is_a_theorem(implies(implies(X0,iPr_def_14),iPr_def_15))
      | ~ is_a_theorem(implies(iPr_def_11,X0)) ),
    inference(superposition,[status(thm)],[c_302,c_55]) ).

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

tcf(c_788,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(implies(X0,implies(X0,X1))) ),
    inference(superposition,[status(thm)],[c_303,c_211]) ).

tcf(c_977,plain,
    ! [X0: $i] :
      ( is_a_theorem(iPr_def_15)
      | ~ is_a_theorem(implies(iPr_def_11,X0))
      | ~ is_a_theorem(implies(X0,iPr_def_14)) ),
    inference(superposition,[status(thm)],[c_626,c_55]) ).

tcf(c_980,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_977,c_87]) ).

tcf(c_1323,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(implies(X0,X1),X1))
      | ~ is_a_theorem(implies(implies(X0,X1),X0)) ),
    inference(superposition,[status(thm)],[c_303,c_788]) ).

tcf(c_1557,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(implies(X0,X1),X1))
      | ~ is_a_theorem(X0) ),
    inference(superposition,[status(thm)],[c_210,c_1323]) ).

tcf(c_1598,plain,
    ! [X0: $i] :
      ( is_a_theorem(implies(implies(iPr_def_10,a),X0))
      | ~ is_a_theorem(implies(a,X0)) ),
    inference(superposition,[status(thm)],[c_200,c_787]) ).

tcf(c_1608,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(iPr_def_11,X1))
      | ~ is_a_theorem(implies(implies(implies(c,X0),implies(iPr_def_10,X0)),X1)) ),
    inference(superposition,[status(thm)],[c_288,c_787]) ).

tcf(c_10978,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(implies(iPr_def_11,implies(implies(implies(iPr_def_10,X0),X1),implies(implies(c,X0),X1)))),
    inference(superposition,[status(thm)],[c_59,c_1608]) ).

tcf(c_16258,plain,
    ! [X0: $i,X1: $i] : ~ is_a_theorem(implies(implies(implies(implies(iPr_def_10,X0),X1),implies(implies(c,X0),X1)),iPr_def_14)),
    inference(superposition,[status(thm)],[c_10978,c_980]) ).

tcf(c_16382,plain,
    ! [X0: $i] : ~ is_a_theorem(implies(implies(implies(implies(iPr_def_10,a),X0),implies(iPr_def_12,X0)),iPr_def_14)),
    inference(superposition,[status(thm)],[c_83,c_16258]) ).

tcf(c_16385,plain,
    ~ is_a_theorem(implies(implies(implies(implies(iPr_def_10,a),iPr_def_13),iPr_def_14),iPr_def_14)),
    inference(superposition,[status(thm)],[c_85,c_16382]) ).

tcf(c_16387,plain,
    ~ is_a_theorem(implies(implies(iPr_def_10,a),iPr_def_13)),
    inference(superposition,[status(thm)],[c_1557,c_16385]) ).

tcf(c_16391,plain,
    ~ is_a_theorem(implies(a,iPr_def_13)),
    inference(superposition,[status(thm)],[c_1598,c_16387]) ).

tcf(c_16392,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_16391,c_197]) ).


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