↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : LCL117-1 : TPTP v9.3.1. Released v1.0.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:05:42 PM UTC 2026

% Result   : Unsatisfiable 1.74s 6.29s
% Output   : CNFRefutation 1.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   27 (  19 unt;   5 def)
%            Number of atoms       :   75 (   5 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   29 (  17   ~;  12   |;   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   :   26 (   0 sgn  26   !;   0   ?;  21   :)

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

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

fof(f3,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_qyf) ).

tcf(c_52,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(X1)
      | ~ is_a_theorem(X0)
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_53,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X2,X0)))),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_54,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_66,definition,
    iPr_def_10 = equivalent(a,b),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_67,definition,
    iPr_def_11 = equivalent(a,c),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_68,definition,
    iPr_def_12 = equivalent(iPr_def_10,iPr_def_11),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_69,definition,
    iPr_def_13 = equivalent(c,b),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_70,definition,
    iPr_def_14 = equivalent(iPr_def_12,iPr_def_13),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_71,negated_conjecture,
    ~ is_a_theorem(iPr_def_14),
    inference(demodulation,[status(thm)],[c_54,c_69,c_67,c_66,c_68,c_70]) ).

tcf(c_196,plain,
    ! [X0: $i] : is_a_theorem(equivalent(iPr_def_13,equivalent(equivalent(X0,b),equivalent(X0,c)))),
    inference(superposition,[status(thm)],[c_69,c_53]) ).

tcf(c_197,plain,
    ! [X0: $i] : is_a_theorem(equivalent(iPr_def_12,equivalent(equivalent(X0,iPr_def_11),equivalent(X0,iPr_def_10)))),
    inference(superposition,[status(thm)],[c_68,c_53]) ).

tcf(c_208,plain,
    ! [X0: $i] : is_a_theorem(equivalent(equivalent(iPr_def_13,X0),equivalent(equivalent(iPr_def_12,X0),iPr_def_14))),
    inference(superposition,[status(thm)],[c_70,c_53]) ).

tcf(c_209,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X2,X0)))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_53,c_52]) ).

tcf(c_358,plain,
    is_a_theorem(equivalent(iPr_def_13,equivalent(equivalent(a,b),iPr_def_11))),
    inference(superposition,[status(thm)],[c_67,c_196]) ).

tcf(c_360,plain,
    is_a_theorem(equivalent(iPr_def_13,iPr_def_12)),
    inference(light_normalisation,[status(thm)],[c_358,c_66,c_68]) ).

tcf(c_612,plain,
    ! [X0: $i] :
      ( is_a_theorem(equivalent(equivalent(iPr_def_12,X0),iPr_def_14))
      | ~ is_a_theorem(equivalent(iPr_def_13,X0)) ),
    inference(superposition,[status(thm)],[c_208,c_52]) ).

tcf(c_645,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X2,X0))
      | ~ is_a_theorem(equivalent(X2,X1))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_209,c_52]) ).

tcf(c_817,plain,
    ! [X0: $i] :
      ( is_a_theorem(iPr_def_14)
      | ~ is_a_theorem(equivalent(iPr_def_13,X0))
      | ~ is_a_theorem(equivalent(iPr_def_12,X0)) ),
    inference(superposition,[status(thm)],[c_612,c_52]) ).

tcf(c_818,plain,
    ! [X0: $i] :
      ( ~ is_a_theorem(equivalent(iPr_def_13,X0))
      | ~ is_a_theorem(equivalent(iPr_def_12,X0)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_817,c_71]) ).

tcf(c_829,plain,
    ~ is_a_theorem(equivalent(iPr_def_12,iPr_def_12)),
    inference(superposition,[status(thm)],[c_360,c_818]) ).

tcf(c_930,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( is_a_theorem(equivalent(X0,equivalent(X3,X2)))
      | ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3)))) ),
    inference(superposition,[status(thm)],[c_53,c_645]) ).

tcf(c_1376,plain,
    is_a_theorem(equivalent(iPr_def_12,equivalent(iPr_def_10,iPr_def_11))),
    inference(superposition,[status(thm)],[c_197,c_930]) ).

tcf(c_1390,plain,
    is_a_theorem(equivalent(iPr_def_12,iPr_def_12)),
    inference(light_normalisation,[status(thm)],[c_1376,c_68]) ).

tcf(c_1391,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1390,c_829]) ).


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