↑ Up

iProver---3.9.4.UNS-CRf.s

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

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

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

fof(f2,axiom,
    ! [X0,X1] : apply(apply(t,X0),X1) = apply(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t_definition) ).

fof(f3,negated_conjecture,
    ! [X0] : apply(apply(apply(X0,f(X0)),g(X0)),h(X0)) != apply(apply(f(X0),h(X0)),g(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_combinator) ).

tcf(c_52,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_53,plain,
    ! [X0: $i,X1: $i] : apply(apply(t,X0),X1) = apply(X1,X0),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_54,negated_conjecture,
    ! [X0: $i] : apply(apply(apply(X0,f(X0)),g(X0)),h(X0)) != apply(apply(f(X0),h(X0)),g(X0)),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_95,plain,
    ! [X0: $i,X1: $i] : apply(apply(apply(X0,apply(X1,f(apply(apply(b,X0),X1)))),g(apply(apply(b,X0),X1))),h(apply(apply(b,X0),X1))) != apply(apply(f(apply(apply(b,X0),X1)),h(apply(apply(b,X0),X1))),g(apply(apply(b,X0),X1))),
    inference(superposition,[status(thm)],[c_52,c_54]) ).

tcf(c_117,plain,
    ! [X0: $i,X1: $i] : apply(apply(apply(apply(X0,f(apply(apply(b,apply(t,X1)),X0))),X1),g(apply(apply(b,apply(t,X1)),X0))),h(apply(apply(b,apply(t,X1)),X0))) != apply(apply(f(apply(apply(b,apply(t,X1)),X0)),h(apply(apply(b,apply(t,X1)),X0))),g(apply(apply(b,apply(t,X1)),X0))),
    inference(superposition,[status(thm)],[c_53,c_95]) ).

tcf(c_164,plain,
    ! [X0: $i,X1: $i,X2: $i] : apply(apply(apply(apply(X0,apply(X1,f(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1))))),X2),g(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1)))),h(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1)))) != apply(apply(f(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1))),h(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1)))),g(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1)))),
    inference(superposition,[status(thm)],[c_52,c_117]) ).

tcf(c_729,plain,
    ! [X0: $i,X1: $i] : apply(apply(apply(X0,f(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0)))),apply(X1,g(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0))))),h(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0)))) != apply(apply(f(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0))),h(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0)))),g(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0)))),
    inference(superposition,[status(thm)],[c_52,c_164]) ).

tcf(c_917,plain,
    ! [X0: $i] : apply(apply(apply(X0,g(apply(apply(b,apply(t,X0)),apply(apply(b,b),t)))),f(apply(apply(b,apply(t,X0)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,X0)),apply(apply(b,b),t)))) != apply(apply(f(apply(apply(b,apply(t,X0)),apply(apply(b,b),t))),h(apply(apply(b,apply(t,X0)),apply(apply(b,b),t)))),g(apply(apply(b,apply(t,X0)),apply(apply(b,b),t)))),
    inference(superposition,[status(thm)],[c_53,c_729]) ).

tcf(c_939,plain,
    ! [X0: $i,X1: $i] : apply(apply(apply(X0,apply(X1,g(apply(apply(b,apply(t,apply(apply(b,X0),X1))),apply(apply(b,b),t))))),f(apply(apply(b,apply(t,apply(apply(b,X0),X1))),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,apply(apply(b,X0),X1))),apply(apply(b,b),t)))) != apply(apply(f(apply(apply(b,apply(t,apply(apply(b,X0),X1))),apply(apply(b,b),t))),h(apply(apply(b,apply(t,apply(apply(b,X0),X1))),apply(apply(b,b),t)))),g(apply(apply(b,apply(t,apply(apply(b,X0),X1))),apply(apply(b,b),t)))),
    inference(superposition,[status(thm)],[c_52,c_917]) ).

tcf(c_3816,plain,
    ! [X0: $i] : apply(apply(X0,g(apply(apply(b,apply(t,apply(apply(b,b),X0))),apply(apply(b,b),t)))),apply(f(apply(apply(b,apply(t,apply(apply(b,b),X0))),apply(apply(b,b),t))),h(apply(apply(b,apply(t,apply(apply(b,b),X0))),apply(apply(b,b),t))))) != apply(apply(f(apply(apply(b,apply(t,apply(apply(b,b),X0))),apply(apply(b,b),t))),h(apply(apply(b,apply(t,apply(apply(b,b),X0))),apply(apply(b,b),t)))),g(apply(apply(b,apply(t,apply(apply(b,b),X0))),apply(apply(b,b),t)))),
    inference(superposition,[status(thm)],[c_52,c_939]) ).

tcf(c_3831,plain,
    $false,
    inference(superposition,[status(thm)],[c_53,c_3816]) ).


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