↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 1.37s 1.78s
% Output   : CNFRefutation 1.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   34 (  23 unt;   3 def)
%            Number of atoms       :   90 (   3 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   40 (  22   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   56 (   0 sgn  56   !;   0   ?;  44   :)

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

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

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,X3: $i] : is_a_theorem(implies(implies(X0,implies(not(X1),X2)),implies(X0,implies(implies(X3,X2),implies(implies(X1,X3),X2))))),
    inference(cnf_transformation,[],[f4]) ).

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

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

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

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

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

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

tcf(c_198,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_214,plain,
    ! [X0: $i] : is_a_theorem(implies(implies(iPr_def_11,X0),implies(not(iPr_def_10),X0))),
    inference(superposition,[status(thm)],[c_77,c_56]) ).

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

tcf(c_216,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(implies(implies(implies(a,X0),X1),implies(iPr_def_10,X1))),
    inference(superposition,[status(thm)],[c_76,c_56]) ).

tcf(c_218,plain,
    ! [X0: $i] : is_a_theorem(implies(implies(iPr_def_12,X0),implies(iPr_def_10,X0))),
    inference(light_normalisation,[status(thm)],[c_215,c_76]) ).

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

tcf(c_255,plain,
    is_a_theorem(implies(implies(iPr_def_12,b),iPr_def_11)),
    inference(superposition,[status(thm)],[c_77,c_218]) ).

tcf(c_305,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(iPr_def_10,X1))
      | ~ is_a_theorem(implies(implies(a,X0),X1)) ),
    inference(superposition,[status(thm)],[c_216,c_54]) ).

tcf(c_330,plain,
    is_a_theorem(implies(iPr_def_11,iPr_def_12)),
    inference(superposition,[status(thm)],[c_197,c_198]) ).

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

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

tcf(c_4349,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(implies(X1,X0),implies(implies(iPr_def_10,X1),X0)))
      | ~ is_a_theorem(implies(iPr_def_11,X0)) ),
    inference(superposition,[status(thm)],[c_214,c_1163]) ).

tcf(c_6052,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(implies(iPr_def_10,X0),X1))
      | ~ is_a_theorem(implies(iPr_def_11,X1))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(superposition,[status(thm)],[c_4349,c_54]) ).

tcf(c_8384,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(X1)
      | ~ is_a_theorem(implies(iPr_def_11,X1))
      | ~ is_a_theorem(implies(iPr_def_10,X0))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(superposition,[status(thm)],[c_6052,c_54]) ).

tcf(c_9584,plain,
    ! [X0: $i] : is_a_theorem(implies(implies(X0,iPr_def_11),implies(implies(iPr_def_12,X0),iPr_def_11))),
    inference(superposition,[status(thm)],[c_255,c_4346]) ).

tcf(c_9732,plain,
    is_a_theorem(implies(iPr_def_10,implies(implies(iPr_def_12,a),iPr_def_11))),
    inference(superposition,[status(thm)],[c_9584,c_305]) ).

tcf(c_10720,plain,
    ! [X0: $i] :
      ( is_a_theorem(iPr_def_12)
      | ~ is_a_theorem(implies(iPr_def_11,iPr_def_12))
      | ~ is_a_theorem(implies(iPr_def_10,implies(implies(X0,a),iPr_def_11))) ),
    inference(superposition,[status(thm)],[c_197,c_8384]) ).

tcf(c_10939,plain,
    ! [X0: $i] : ~ is_a_theorem(implies(iPr_def_10,implies(implies(X0,a),iPr_def_11))),
    inference(forward_subsumption_resolution,[status(thm)],[c_10720,c_79,c_330]) ).

tcf(c_11317,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_9732,c_10939]) ).


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