↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : LCL366-1 : TPTP v9.3.1. Bugfixed v5.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n002.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:06:26 PM UTC 2026

% Result   : Unsatisfiable 15.85s 3.28s
% Output   : CNFRefutation 15.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   38 (  24 unt;   5 def)
%            Number of atoms       :   99 (   5 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   46 (  27   ~;  19   |;   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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   45 (   0 sgn  45   !;   0   ?;  37   :)

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

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

fof(f3,axiom,
    ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).

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

fof(f5,negated_conjecture,
    ~ is_a_theorem(implies(implies(not(x),y),implies(implies(y,x),x))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_15) ).

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(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    inference(cnf_transformation,[],[f2]) ).

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

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

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

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

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

tcf(c_78,definition,
    iPr_def_12 = implies(y,x),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

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

tcf(c_80,definition,
    iPr_def_14 = implies(iPr_def_11,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_79,c_76,c_77,c_80]) ).

tcf(c_190,plain,
    is_a_theorem(implies(implies(iPr_def_10,x),x)),
    inference(superposition,[status(thm)],[c_76,c_56]) ).

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

tcf(c_221,plain,
    ! [X0: $i] : is_a_theorem(implies(iPr_def_11,implies(implies(y,X0),implies(iPr_def_10,X0)))),
    inference(superposition,[status(thm)],[c_77,c_55]) ).

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

tcf(c_232,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_55,c_54]) ).

tcf(c_348,plain,
    is_a_theorem(implies(iPr_def_11,implies(iPr_def_12,implies(iPr_def_10,x)))),
    inference(superposition,[status(thm)],[c_78,c_221]) ).

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

tcf(c_621,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_232,c_54]) ).

tcf(c_750,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_579,c_54]) ).

tcf(c_751,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_750,c_81]) ).

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

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

tcf(c_820,plain,
    ! [X0: $i] :
      ( is_a_theorem(implies(iPr_def_11,X0))
      | ~ is_a_theorem(implies(implies(iPr_def_12,implies(iPr_def_10,x)),X0)) ),
    inference(superposition,[status(thm)],[c_348,c_621]) ).

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

tcf(c_8706,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(X1,X0))
      | ~ is_a_theorem(implies(not(X0),not(X1))) ),
    inference(superposition,[status(thm)],[c_8550,c_797]) ).

tcf(c_10212,plain,
    ! [X0: $i] : is_a_theorem(implies(iPr_def_11,implies(implies(implies(iPr_def_10,x),X0),implies(iPr_def_12,X0)))),
    inference(superposition,[status(thm)],[c_55,c_820]) ).

tcf(c_10306,plain,
    ! [X0: $i] : ~ is_a_theorem(implies(implies(implies(implies(iPr_def_10,x),X0),implies(iPr_def_12,X0)),iPr_def_13)),
    inference(superposition,[status(thm)],[c_10212,c_751]) ).

tcf(c_10515,plain,
    ~ is_a_theorem(implies(implies(implies(implies(iPr_def_10,x),x),iPr_def_13),iPr_def_13)),
    inference(superposition,[status(thm)],[c_79,c_10306]) ).

tcf(c_10516,plain,
    ~ is_a_theorem(implies(not(iPr_def_13),implies(implies(iPr_def_10,x),x))),
    inference(superposition,[status(thm)],[c_8550,c_10515]) ).

tcf(c_27210,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(X1,X0))
      | ~ is_a_theorem(X0) ),
    inference(superposition,[status(thm)],[c_215,c_8706]) ).

tcf(c_29396,plain,
    ~ is_a_theorem(implies(implies(iPr_def_10,x),x)),
    inference(superposition,[status(thm)],[c_27210,c_10516]) ).

tcf(c_29635,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_29396,c_190]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL366-1 : TPTP v9.3.1. Bugfixed v5.5.0.
% 0.00/0.03  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36  % Computer : n002.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Wed Sep 23 23:01:36 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.42  
% 0.09/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42  
% 0.09/0.42  % Detected problem language: tptp
% 0.09/0.43  % Proving...
% 15.85/3.28  % SZS status Started for theBenchmark.p
% 15.85/3.28  % SZS status Unsatisfiable for theBenchmark.p
% 15.85/3.28  
% 15.85/3.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 15.85/3.28  
% 15.85/3.28  % ------  iProver source info
% 15.85/3.28  
% 15.85/3.28  % git: date: 2026-07-19 20:42:38 +0200
% 15.85/3.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 15.85/3.28  % git: non_committed_changes: false
% 15.85/3.28  
% 15.85/3.28  % ------ Parsing...% successful
% 15.85/3.28  
% 15.85/3.28  
% 15.85/3.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 15.85/3.28  
% 15.85/3.28  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 15.85/3.28  
% 15.85/3.28  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 15.85/3.28  
% 15.85/3.28  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 15.85/3.28  % ------ Proving...
% 15.85/3.28  % ------ Problem Properties 
% 15.85/3.28  
% 15.85/3.28  % 
% 15.85/3.28  % clauses                               10
% 15.85/3.28  % conjectures                           1
% 15.85/3.28  % EPR                                   1
% 15.85/3.28  % Horn                                  10
% 15.85/3.28  % unary                                 9
% 15.85/3.28  % binary                                0
% 15.85/3.28  % lits                                  12
% 15.85/3.28  % lits eq                               5
% 15.85/3.28  % fd_pure                               0
% 15.85/3.28  % fd_pseudo                             0
% 15.85/3.28  % fd_cond                               0
% 15.85/3.28  % fd_pseudo_cond                        0
% 15.85/3.28  % AC symbols                            0
% 15.85/3.28  
% 15.85/3.28  % ------ Schedule dynamic 5 is on 
% 15.85/3.28  
% 15.85/3.28  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 15.85/3.28  
% 15.85/3.28  
% 15.85/3.28  % ------ 
% 15.85/3.28  % Current options:
% 15.85/3.28  % ------ 
% 15.85/3.28  
% 15.85/3.28  
% 15.85/3.28  % 
% 15.85/3.28  
% 15.85/3.28  % ------ Proving...
% 15.85/3.28  % 
% 15.85/3.28  
% 15.85/3.28  % SZS status Unsatisfiable for theBenchmark.p
% 15.85/3.28  
% 15.85/3.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 15.85/3.28  
% 15.85/3.28  
%------------------------------------------------------------------------------