↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : COL049-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 : n014.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:02:40 PM UTC 2026

% Result   : Unsatisfiable 70.80s 11.18s
% Output   : CNFRefutation 70.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   14 (  14 unt;   0 def)
%            Number of atoms       :   14 (  13 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :   10 (   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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn  24   !;   0   ?;  17   :)

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

fof(f2,axiom,
    ! [X0,X1] : apply(apply(w,X0),X1) = apply(apply(X0,X1),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',w_definition) ).

fof(f3,axiom,
    ! [X0] : apply(m,X0) = apply(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_definition) ).

fof(f4,negated_conjecture,
    ! [X0] : apply(X0,f(X0)) != apply(f(X0),apply(X0,f(X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_strong_fixed_point) ).

tcf(c_53,plain,
    ! [X0: $i,X1: $i,X2: $i] : apply(apply(apply(b,X0),X1),X2) = apply(X0,apply(X1,X2)),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_54,plain,
    ! [X0: $i,X1: $i] : apply(apply(X0,X1),X1) = apply(apply(w,X0),X1),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_55,plain,
    ! [X0: $i] : apply(X0,X0) = apply(m,X0),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_56,negated_conjecture,
    ! [X0: $i] : apply(f(X0),apply(X0,f(X0))) != apply(X0,f(X0)),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_220,plain,
    ! [X0: $i,X1: $i] : apply(apply(w,apply(b,X0)),X1) = apply(X0,apply(X1,X1)),
    inference(superposition,[status(thm)],[c_53,c_54]) ).

tcf(c_224,plain,
    ! [X0: $i,X1: $i] : apply(f(apply(apply(b,X0),X1)),apply(X0,apply(X1,f(apply(apply(b,X0),X1))))) != apply(X0,apply(X1,f(apply(apply(b,X0),X1)))),
    inference(superposition,[status(thm)],[c_53,c_56]) ).

tcf(c_455,plain,
    ! [X0: $i,X1: $i] : apply(apply(w,apply(b,X0)),X1) = apply(X0,apply(m,X1)),
    inference(superposition,[status(thm)],[c_55,c_220]) ).

tcf(c_931,plain,
    ! [X0: $i] : apply(X0,apply(m,apply(w,apply(b,X0)))) = apply(m,apply(w,apply(b,X0))),
    inference(superposition,[status(thm)],[c_455,c_55]) ).

tcf(c_1094,plain,
    ! [X0: $i,X1: $i,X2: $i] : apply(f(apply(apply(b,apply(apply(b,X0),X1)),X2)),apply(X0,apply(X1,apply(X2,f(apply(apply(b,apply(apply(b,X0),X1)),X2)))))) != apply(X0,apply(X1,apply(X2,f(apply(apply(b,apply(apply(b,X0),X1)),X2))))),
    inference(superposition,[status(thm)],[c_53,c_224]) ).

tcf(c_15040,plain,
    $false,
    inference(superposition,[status(thm)],[c_931,c_1094]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COL049-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.08/0.36  % Computer : n014.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Fri Sep 25 07:21:18 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40  Running UEQ theorem proving
% 0.13/0.40  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.13/0.41  
% 0.13/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41  
% 0.13/0.41  % Detected problem language: tptp
% 0.13/0.42  % Proving...
% 70.80/11.18  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 70.80/11.18  % SZS status Started for theBenchmark.p
% 70.80/11.18  % SZS status Unsatisfiable for theBenchmark.p
% 70.80/11.18  
% 70.80/11.18  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 70.80/11.18  
% 70.80/11.18  % ------  iProver source info
% 70.80/11.18  
% 70.80/11.18  % git: date: 2026-07-19 20:42:38 +0200
% 70.80/11.18  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 70.80/11.18  % git: non_committed_changes: false
% 70.80/11.18  
% 70.80/11.18  % ------ Parsing...% successful
% 70.80/11.18  
% 70.80/11.18  
% 70.80/11.18  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 70.80/11.18  
% 70.80/11.18  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 70.80/11.18  
% 70.80/11.18  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 70.80/11.18  
% 70.80/11.18  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 70.80/11.18  % ------ Proving...
% 70.80/11.18  % ------ Problem Properties 
% 70.80/11.18  
% 70.80/11.18  % 
% 70.80/11.18  % clauses                               4
% 70.80/11.18  % conjectures                           1
% 70.80/11.18  % EPR                                   0
% 70.80/11.18  % Horn                                  4
% 70.80/11.18  % unary                                 4
% 70.80/11.18  % binary                                0
% 70.80/11.18  % lits                                  4
% 70.80/11.18  % lits eq                               4
% 70.80/11.18  % fd_pure                               0
% 70.80/11.18  % fd_pseudo                             0
% 70.80/11.18  % fd_cond                               0
% 70.80/11.18  % fd_pseudo_cond                        0
% 70.80/11.18  % AC symbols                            0
% 70.80/11.18  
% 70.80/11.18  % ------ Input Options Time Limit: Unbounded
% 70.80/11.18  
% 70.80/11.18  
% 70.80/11.18  % ------ 
% 70.80/11.18  % Current options:
% 70.80/11.18  % ------ 
% 70.80/11.18  
% 70.80/11.18  
% 70.80/11.18  % 
% 70.80/11.18  
% 70.80/11.18  % ------ Proving...
% 70.80/11.18  % 
% 70.80/11.18  
% 70.80/11.18  % SZS status Unsatisfiable for theBenchmark.p
% 70.80/11.18  
% 70.80/11.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 70.80/11.18  
% 70.80/11.18  
%------------------------------------------------------------------------------