↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 2.87s 11.11s
% Output   : CNFRefutation 2.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   19 (  11 unt;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   34 (  22   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   48 (   0 sgn  48   !;   0   ?;  32   :)

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

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

fof(f3,axiom,
    ! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_3) ).

fof(f4,axiom,
    ! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),X3),equivalent(equivalent(equivalent(X0,X4),X2),equivalent(equivalent(X1,X4),X3)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_4) ).

fof(f5,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lg_1) ).

tcf(c_54,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_55,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_56,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_57,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),X3),equivalent(equivalent(equivalent(X0,X4),X2),equivalent(equivalent(X1,X4),X3)))),
    inference(cnf_transformation,[],[f4]) ).

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

tcf(c_83,plain,
    ! [X0: $i] :
      ( ~ is_a_theorem(X0)
      | ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c))) ),
    inference(resolution,[status(thm)],[c_54,c_58]) ).

tcf(c_87,plain,
    ! [X0: $i,X1: $i] :
      ( ~ is_a_theorem(X1)
      | ~ is_a_theorem(X0)
      | ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)))) ),
    inference(resolution,[status(thm)],[c_83,c_54]) ).

tcf(c_190,plain,
    ! [X0: $i,X1: $i] :
      ( ~ is_a_theorem(equivalent(equivalent(X0,c),X1))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(a,equivalent(equivalent(b,b),a))),X1),c)) ),
    inference(resolution,[status(thm)],[c_87,c_57]) ).

tcf(c_196,plain,
    ! [X0: $i] : ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,a),equivalent(X0,equivalent(equivalent(b,b),a))),c),c)),
    inference(resolution,[status(thm)],[c_190,c_55]) ).

tcf(c_209,plain,
    ! [X0: $i,X1: $i] :
      ( ~ is_a_theorem(X0)
      | ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(X1,a),equivalent(X1,equivalent(equivalent(b,b),a))),c),c))) ),
    inference(resolution,[status(thm)],[c_196,c_54]) ).

tcf(c_386,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ is_a_theorem(X1)
      | ~ is_a_theorem(X0)
      | ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,a),equivalent(X2,equivalent(equivalent(b,b),a))),c),c)))) ),
    inference(resolution,[status(thm)],[c_209,c_54]) ).

tcf(c_425,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ is_a_theorem(equivalent(equivalent(X0,c),X2))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,a),equivalent(X1,equivalent(equivalent(b,b),a)))),X2),c)) ),
    inference(resolution,[status(thm)],[c_386,c_57]) ).

tcf(c_579,plain,
    ! [X0: $i,X1: $i] : ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,a)),equivalent(X1,equivalent(equivalent(b,b),a))),c),c)),
    inference(resolution,[status(thm)],[c_425,c_56]) ).

tcf(c_601,plain,
    $false,
    inference(resolution,[status(thm)],[c_579,c_56]) ).


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