↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : COL052-2 : 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 : n008.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 1.69s 1.28s
% Output   : CNFRefutation 1.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   19 (  14 unt;   0 def)
%            Number of atoms       :   24 (  12 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   13 (   8   ~;   5   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    6 (   2 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    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn  20   !;   0   ?;  13   :)

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

fof(f2,axiom,
    ! [X0,X1] :
      ( response(X0,common_bird(X1)) = response(X1,common_bird(X1))
      | ~ agreeable(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',agreeable1) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( agreeable(X0)
      | response(X0,X1) != response(compatible(X0),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',agreeable2) ).

fof(f4,axiom,
    agreeable(c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_agreeable) ).

fof(f5,negated_conjecture,
    ~ agreeable(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_is_agreeable) ).

fof(f6,axiom,
    c = compose(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_composes_a_with_b) ).

tcf(c_55,plain,
    ! [X0: $i,X1: $i,X2: $i] : response(compose(X0,X1),X2) = response(X0,response(X1,X2)),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_56,plain,
    ! [X0: $i,X1: $i] :
      ( ( response(X0,common_bird(X1)) = response(X1,common_bird(X1)) )
      | ~ agreeable(X0) ),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_57,plain,
    ! [X0: $i,X1: $i] :
      ( agreeable(X0)
      | ( response(compatible(X0),X1) != response(X0,X1) ) ),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_58,plain,
    agreeable(c),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_59,negated_conjecture,
    ~ agreeable(a),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_60,plain,
    compose(a,b) = c,
    inference(cnf_transformation,[],[f6]) ).

tcf(c_121,negated_conjecture,
    ~ agreeable(a),
    inference(demodulation,[status(thm)],[c_59]) ).

tcf(c_218,plain,
    ! [X0: $i] : response(a,response(b,X0)) = response(c,X0),
    inference(superposition,[status(thm)],[c_60,c_55]) ).

tcf(c_226,plain,
    ! [X0: $i] : response(X0,common_bird(X0)) = response(c,common_bird(X0)),
    inference(superposition,[status(thm)],[c_58,c_56]) ).

tcf(c_228,plain,
    ! [X0: $i,X1: $i] : response(X0,response(X1,common_bird(compose(X0,X1)))) = response(c,common_bird(compose(X0,X1))),
    inference(superposition,[status(thm)],[c_55,c_226]) ).

tcf(c_249,plain,
    ! [X0: $i,X1: $i] :
      ( agreeable(X0)
      | ( response(X0,response(X1,common_bird(compose(compatible(X0),X1)))) != response(c,common_bird(compose(compatible(X0),X1))) ) ),
    inference(superposition,[status(thm)],[c_228,c_57]) ).

tcf(c_262,plain,
    agreeable(a),
    inference(superposition,[status(thm)],[c_218,c_249]) ).

tcf(c_264,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_262,c_121]) ).


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