↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : LCL076-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 : n020.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 0.43s 1.29s
% Output   : CNFRefutation 0.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   17 (  14 unt;   3 def)
%            Number of atoms       :   38 (   3 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   13 (   8   ~;   5   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 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  :    6 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   10 (   0 sgn  10   !;   0   ?;   5   :)

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

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

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

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

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

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

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

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

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

tcf(c_84,negated_conjecture,
    ~ is_a_theorem(iPr_def_12),
    inference(demodulation,[status(thm)],[c_60,c_81,c_82,c_83]) ).

tcf(c_190,plain,
    is_a_theorem(implies(not(iPr_def_11),iPr_def_10)),
    inference(superposition,[status(thm)],[c_82,c_59]) ).

tcf(c_215,plain,
    is_a_theorem(implies(implies(not(iPr_def_11),not(a)),iPr_def_12)),
    inference(superposition,[status(thm)],[c_83,c_58]) ).

tcf(c_217,plain,
    is_a_theorem(implies(implies(not(iPr_def_11),iPr_def_10),iPr_def_12)),
    inference(light_normalisation,[status(thm)],[c_215,c_81]) ).

tcf(c_258,plain,
    ( is_a_theorem(iPr_def_12)
    | ~ is_a_theorem(implies(not(iPr_def_11),iPr_def_10)) ),
    inference(superposition,[status(thm)],[c_217,c_55]) ).

tcf(c_259,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_258,c_84,c_190]) ).


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