↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN074-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 : n004.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 03:39:06 PM UTC 2026

% Result   : Unsatisfiable 0.85s 1.17s
% Output   : CNFRefutation 0.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   34 (   7 unt;   0 def)
%            Number of atoms       :   71 (  43 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   68 (  31   ~;  37   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   42 (   0 sgn  42   !;   0   ?;  20   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( X0 = a
      | ~ big_f(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

fof(f2,plain,
    ! [X0,X1] :
      ( a = X0
      | ~ big_f(X0,X1) ),
    inference(reorient_equations,[],[f1]) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( X1 = b
      | ~ big_f(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

fof(f4,plain,
    ! [X0,X1] :
      ( b = X1
      | ~ big_f(X0,X1) ),
    inference(reorient_equations,[],[f3]) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( big_f(X0,X1)
      | X1 != b
      | X0 != a ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

fof(f6,plain,
    ! [X0,X1] :
      ( big_f(X0,X1)
      | b != X1
      | a != X0 ),
    inference(reorient_equations,[],[f5]) ).

fof(f15,negated_conjecture,
    ! [X0,X1] :
      ( f(X1) = X1
      | big_f(f(X1),X0)
      | X0 != g(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).

fof(f16,plain,
    ! [X0,X1] :
      ( f(X1) = X1
      | big_f(f(X1),X0)
      | g(X1) != X0 ),
    inference(reorient_equations,[],[f15]) ).

fof(f19,negated_conjecture,
    ! [X0,X1] :
      ( h(X0,X1) = X1
      | big_f(f(X0),h(X0,X1))
      | f(X0) != X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).

fof(f20,negated_conjecture,
    ! [X0,X1] :
      ( ~ big_f(f(X0),h(X0,X1))
      | h(X0,X1) != X1
      | f(X0) != X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).

fof(f21,plain,
    ! [X1] :
      ( big_f(a,X1)
      | b != X1 ),
    inference(equality_resolution,[],[f6]) ).

fof(f22,plain,
    big_f(a,b),
    inference(equality_resolution,[],[f21]) ).

fof(f24,plain,
    ! [X1] :
      ( f(X1) = X1
      | big_f(f(X1),g(X1)) ),
    inference(equality_resolution,[],[f16]) ).

tcf(c_60,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = a )
      | ~ big_f(X0,X1) ),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_61,plain,
    ! [X0: $i,X1: $i] :
      ( ( X1 = b )
      | ~ big_f(X0,X1) ),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_62,plain,
    big_f(a,b),
    inference(cnf_transformation,[],[f22]) ).

tcf(c_67,negated_conjecture,
    ! [X0: $i] :
      ( big_f(f(X0),g(X0))
      | ( f(X0) = X0 ) ),
    inference(cnf_transformation,[],[f24]) ).

tcf(c_69,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( big_f(f(X0),h(X0,X1))
      | ( h(X0,X1) = X1 )
      | ( f(X0) != X0 ) ),
    inference(cnf_transformation,[],[f19]) ).

tcf(c_70,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ big_f(f(X0),h(X0,X1))
      | ( f(X0) != X0 )
      | ( h(X0,X1) != X1 ) ),
    inference(cnf_transformation,[],[f20]) ).

tcf(c_202,negated_conjecture,
    ! [X0: $i] :
      ( big_f(f(X0),g(X0))
      | ( f(X0) = X0 ) ),
    inference(demodulation,[status(thm)],[c_67]) ).

tcf(c_204,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ big_f(f(X0),h(X0,X1))
      | ( f(X0) != X0 )
      | ( h(X0,X1) != X1 ) ),
    inference(demodulation,[status(thm)],[c_70]) ).

tcf(c_205,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( big_f(f(X0),h(X0,X1))
      | ( h(X0,X1) = X1 )
      | ( f(X0) != X0 ) ),
    inference(demodulation,[status(thm)],[c_69]) ).

tcf(c_432,plain,
    ! [X0: $i] :
      ( ( f(X0) = a )
      | ( f(X0) = X0 ) ),
    inference(superposition,[status(thm)],[c_202,c_60]) ).

tcf(c_470,plain,
    ! [X0: $i] :
      ( ( f(X0) = a )
      | ( X0 != a ) ),
    inference(equality_factoring,[status(thm)],[c_432]) ).

tcf(c_532,plain,
    f(a) = a,
    inference(equality_resolution,[status(thm)],[c_470]) ).

tcf(c_721,plain,
    ! [X0: $i] :
      ( big_f(f(a),h(a,X0))
      | ( h(a,X0) = X0 ) ),
    inference(superposition,[status(thm)],[c_532,c_205]) ).

tcf(c_725,plain,
    ! [X0: $i] :
      ( big_f(a,h(a,X0))
      | ( h(a,X0) = X0 ) ),
    inference(light_normalisation,[status(thm)],[c_721,c_532]) ).

tcf(c_760,plain,
    ! [X0: $i] :
      ( ( h(a,X0) = b )
      | ( h(a,X0) = X0 ) ),
    inference(superposition,[status(thm)],[c_725,c_61]) ).

tcf(c_793,plain,
    ! [X0: $i] :
      ( ( h(a,X0) = b )
      | ( X0 != b ) ),
    inference(equality_factoring,[status(thm)],[c_760]) ).

tcf(c_894,plain,
    h(a,b) = b,
    inference(equality_resolution,[status(thm)],[c_793]) ).

tcf(c_1203,plain,
    ( ~ big_f(f(a),h(a,b))
    | ( f(a) != a ) ),
    inference(superposition,[status(thm)],[c_894,c_204]) ).

tcf(c_1209,plain,
    ~ big_f(f(a),h(a,b)),
    inference(ground_joinability,[status(thm)],[c_1203,c_532]) ).

tcf(c_1210,plain,
    ~ big_f(a,b),
    inference(light_normalisation,[status(thm)],[c_1209,c_532,c_894]) ).

tcf(c_1211,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1210,c_62]) ).


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