↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n017.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 01:59:47 PM UTC 2026

% Result   : Unsatisfiable 1.27s 1.65s
% Output   : CNFRefutation 1.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   33 (  33 unt;   0 def)
%            Number of atoms       :   33 (  32 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   73 (   0 sgn  73   !;   0   ?;  69   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1] : f(f(f(f(X0,X1),f(X1,X2)),X3),f(X1,f(f(X1,f(f(X0,X0),X0)),X2))) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).

fof(f2,negated_conjecture,
    f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

tcf(c_51,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : f(f(f(f(X0,X1),f(X1,X2)),X3),f(X1,f(f(X1,f(f(X0,X0),X0)),X2))) = X1,
    inference(cnf_transformation,[],[f1]) ).

tcf(c_52,negated_conjecture,
    f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_92,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : f(X0,f(f(X0,X1),f(f(f(X0,X1),f(f(f(X2,X0),f(X2,X0)),f(X2,X0))),X3))) = f(X0,X1),
    inference(superposition,[status(thm)],[c_51,c_51]) ).

tcf(c_102,plain,
    ! [X0: $i,X1: $i,X2: $i] : f(f(X0,X1),f(f(f(X0,X1),f(X1,X2)),X1)) = f(f(X0,X1),f(X1,X2)),
    inference(superposition,[status(thm)],[c_51,c_92]) ).

tcf(c_153,plain,
    ! [X0: $i,X1: $i,X2: $i] : f(f(f(f(X0,X1),f(X1,X2)),X1),f(X1,X1)) = X1,
    inference(superposition,[status(thm)],[c_51,c_102]) ).

tcf(c_235,plain,
    ! [X0: $i] : f(f(X0,X0),f(X0,X0)) = X0,
    inference(superposition,[status(thm)],[c_153,c_153]) ).

tcf(c_301,plain,
    ! [X0: $i,X1: $i] : f(f(X0,X1),f(X0,f(f(X0,f(f(X0,X0),X0)),X0))) = X0,
    inference(superposition,[status(thm)],[c_235,c_51]) ).

tcf(c_956,plain,
    ! [X0: $i,X1: $i,X2: $i] : f(f(X0,X1),f(X1,f(f(X1,f(f(X0,X0),X0)),X2))) = X1,
    inference(superposition,[status(thm)],[c_301,c_51]) ).

tcf(c_959,plain,
    ! [X0: $i] : f(X0,f(f(X0,f(f(X0,X0),X0)),X0)) = f(X0,X0),
    inference(superposition,[status(thm)],[c_301,c_235]) ).

tcf(c_965,plain,
    ! [X0: $i,X1: $i] : f(X0,f(f(X0,X1),f(X0,X1))) = f(X0,X1),
    inference(superposition,[status(thm)],[c_301,c_92]) ).

tcf(c_979,plain,
    ! [X0: $i,X1: $i] : f(f(X0,X1),f(X0,X0)) = X0,
    inference(demodulation,[status(thm)],[c_301,c_959]) ).

tcf(c_1125,plain,
    ! [X0: $i,X1: $i] : f(f(X0,X1),f(X1,X1)) = X1,
    inference(superposition,[status(thm)],[c_956,c_102]) ).

tcf(c_1127,plain,
    ! [X0: $i,X1: $i,X2: $i] : f(f(X0,X1),f(X0,f(f(X0,f(f(X2,X2),X2)),X1))) = X0,
    inference(superposition,[status(thm)],[c_956,c_51]) ).

tcf(c_1548,plain,
    ! [X0: $i,X1: $i] : f(X0,f(f(X1,X0),f(X1,X0))) = f(X1,X0),
    inference(superposition,[status(thm)],[c_956,c_979]) ).

tcf(c_1563,plain,
    ! [X0: $i,X1: $i] : f(f(f(X0,X0),X1),X0) = f(X0,X0),
    inference(superposition,[status(thm)],[c_979,c_979]) ).

tcf(c_1677,plain,
    ! [X0: $i,X1: $i] : f(f(X0,f(X1,X1)),X1) = f(X1,X1),
    inference(superposition,[status(thm)],[c_1125,c_1125]) ).

tcf(c_1861,plain,
    ! [X0: $i,X1: $i] : f(f(X0,X0),f(X0,X0)) = f(f(X0,X0),f(X0,X1)),
    inference(superposition,[status(thm)],[c_1563,c_102]) ).

tcf(c_1988,plain,
    ! [X0: $i,X1: $i,X2: $i] : f(f(X0,f(f(X0,f(f(X1,X1),X1)),X2)),f(X0,f(f(X0,f(f(X1,X1),X1)),X2))) = X0,
    inference(superposition,[status(thm)],[c_1677,c_51]) ).

tcf(c_2697,plain,
    ! [X0: $i,X1: $i] : f(f(X0,X0),f(X0,X1)) = X0,
    inference(demodulation,[status(thm)],[c_1861,c_979]) ).

tcf(c_2705,plain,
    ! [X0: $i,X1: $i] : f(f(X0,X0),f(X1,X0)) = X0,
    inference(superposition,[status(thm)],[c_1548,c_2697]) ).

tcf(c_2864,plain,
    ! [X0: $i,X1: $i,X2: $i] : f(f(f(X0,f(f(X0,f(f(X1,X1),X1)),X2)),f(X0,f(f(X0,f(f(X1,X1),X1)),X2))),X0) = f(X0,f(f(X0,f(f(X1,X1),X1)),X2)),
    inference(superposition,[status(thm)],[c_1127,c_2705]) ).

tcf(c_2929,plain,
    ! [X0: $i,X1: $i,X2: $i] : f(X0,f(f(X0,f(f(X1,X1),X1)),X2)) = f(X0,X0),
    inference(light_normalisation,[status(thm)],[c_2864,c_1988]) ).

tcf(c_3763,plain,
    ! [X0: $i,X1: $i] : f(X0,f(f(X1,X1),X1)) = f(X0,X0),
    inference(superposition,[status(thm)],[c_2929,c_965]) ).

tcf(c_3919,plain,
    ! [X0: $i,X1: $i] : f(X0,f(X1,f(X1,X1))) = f(X0,X0),
    inference(superposition,[status(thm)],[c_2697,c_3763]) ).

tcf(c_3972,plain,
    ! [X0: $i,X1: $i,X2: $i] : f(f(X0,f(f(X1,X1),X1)),f(X2,X0)) = X0,
    inference(superposition,[status(thm)],[c_3763,c_2705]) ).

tcf(c_3985,plain,
    ! [X0: $i,X1: $i,X2: $i] : f(f(X0,X1),f(X1,f(f(X2,X2),X2))) = X1,
    inference(superposition,[status(thm)],[c_3763,c_1125]) ).

tcf(c_4201,plain,
    ! [X0: $i,X1: $i] : f(f(X0,X0),f(X1,f(X1,X1))) = X0,
    inference(superposition,[status(thm)],[c_3919,c_2697]) ).

tcf(c_6781,plain,
    ! [X0: $i,X1: $i] : f(f(X0,X0),X0) = f(f(X1,X1),X1),
    inference(superposition,[status(thm)],[c_3985,c_3972]) ).

tcf(c_6984,plain,
    ! [X0: $i,X1: $i] : f(f(X0,X0),X0) = f(X1,f(X1,X1)),
    inference(superposition,[status(thm)],[c_6781,c_4201]) ).

tcf(c_7108,plain,
    ! [X0: $i,X1: $i] : f(X0,f(X0,X0)) = f(X1,f(X1,X1)),
    inference(superposition,[status(thm)],[c_6984,c_4201]) ).

tcf(c_7144,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_52,c_7108]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LAT394-2 : TPTP v9.3.1. Released v5.4.0.
% 0.00/0.03  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.38  % Computer : n017.cluster.edu
% 0.09/0.38  % Model    : x86_64 x86_64
% 0.09/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38  % Memory   : 8046.5625MB
% 0.09/0.38  % OS       : Linux 6.8.0-71-generic
% 0.09/0.38  % CPULimit : 300
% 0.09/0.39  % WCLimit  : 300
% 0.09/0.39  % DateTime : Wed Sep 23 21:27:30 UTC 2026
% 0.09/0.39  % CPUTime  : 
% 0.09/0.39  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.42  Running UEQ theorem proving
% 0.09/0.42  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.43  
% 0.09/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.43  
% 0.09/0.44  % Detected problem language: tptp
% 0.09/0.45  % Proving...
% 1.27/1.65  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.27/1.65  % SZS status Started for theBenchmark.p
% 1.27/1.65  % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.65  
% 1.27/1.65  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.27/1.65  
% 1.27/1.65  % ------  iProver source info
% 1.27/1.65  
% 1.27/1.65  % git: date: 2026-07-19 20:42:38 +0200
% 1.27/1.65  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.27/1.65  % git: non_committed_changes: false
% 1.27/1.65  
% 1.27/1.65  % ------ Parsing...% successful
% 1.27/1.65  
% 1.27/1.65  
% 1.27/1.65  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.27/1.65  
% 1.27/1.65  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.27/1.65  
% 1.27/1.65  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.27/1.65  
% 1.27/1.65  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 1.27/1.65  % ------ Proving...
% 1.27/1.65  % ------ Problem Properties 
% 1.27/1.65  
% 1.27/1.65  % 
% 1.27/1.65  % clauses                               2
% 1.27/1.65  % conjectures                           1
% 1.27/1.65  % EPR                                   0
% 1.27/1.65  % Horn                                  2
% 1.27/1.65  % unary                                 2
% 1.27/1.65  % binary                                0
% 1.27/1.65  % lits                                  2
% 1.27/1.65  % lits eq                               2
% 1.27/1.65  % fd_pure                               0
% 1.27/1.65  % fd_pseudo                             0
% 1.27/1.65  % fd_cond                               0
% 1.27/1.65  % fd_pseudo_cond                        0
% 1.27/1.65  % AC symbols                            0
% 1.27/1.65  
% 1.27/1.65  % ------ Input Options Time Limit: Unbounded
% 1.27/1.65  
% 1.27/1.65  
% 1.27/1.65  % ------ 
% 1.27/1.65  % Current options:
% 1.27/1.65  % ------ 
% 1.27/1.65  
% 1.27/1.65  
% 1.27/1.65  % 
% 1.27/1.65  
% 1.27/1.65  % ------ Proving...
% 1.27/1.65  % 
% 1.27/1.65  
% 1.27/1.65  % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.65  
% 1.27/1.65  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.27/1.65  
% 1.27/1.65  
%------------------------------------------------------------------------------