↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SET563-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n016.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 02:47:24 PM UTC 2026

% Result   : Unsatisfiable 3.41s 1.29s
% Output   : CNFRefutation 3.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   29 (  23 unt;   5 def)
%            Number of atoms       :   48 (  13 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   16 (  10   ~;   6   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   7 usr;   6 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :   21 (   0 sgn  21   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f39,axiom,
    ! [X0] : domain_of(flip(cross_product(X0,universal_class))) = inverse(X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',inverse) ).

fof(f40,axiom,
    ! [X0] : domain_of(inverse(X0)) = range_of(X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',range_of) ).

fof(f90,axiom,
    ! [X2,X0,X1] :
      ( domain_of(domain_of(X1)) = domain_of(X0)
      | ~ compatible(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',compatible2) ).

fof(f91,plain,
    ! [X2,X0,X1] :
      ( domain_of(X0) = domain_of(domain_of(X1))
      | ~ compatible(X0,X1,X2) ),
    inference(reorient_equations,[],[f90]) ).

fof(f92,axiom,
    ! [X2,X0,X1] :
      ( subclass(range_of(X0),domain_of(domain_of(X2)))
      | ~ compatible(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',compatible3) ).

fof(f122,negated_conjecture,
    compatible(xh1,xf1,xf2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_compatible_function_property3_1) ).

fof(f123,negated_conjecture,
    compatible(xh2,xf2,xf3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_compatible_function_property3_2) ).

fof(f124,negated_conjecture,
    ~ subclass(range_of(xh1),domain_of(xh2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_compatible_function_property3_3) ).

fof(f126,plain,
    ! [X0] : range_of(X0) = domain_of(domain_of(flip(cross_product(X0,universal_class)))),
    inference(definition_unfolding,[],[f40,f39]) ).

fof(f171,plain,
    ! [X2,X0,X1] :
      ( subclass(domain_of(domain_of(flip(cross_product(X0,universal_class)))),domain_of(domain_of(X2)))
      | ~ compatible(X0,X1,X2) ),
    inference(definition_unfolding,[],[f92,f126]) ).

fof(f187,plain,
    ~ subclass(domain_of(domain_of(flip(cross_product(xh1,universal_class)))),domain_of(xh2)),
    inference(definition_unfolding,[],[f124,f126]) ).

tcf(c_230,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( domain_of(domain_of(X1)) = domain_of(X0) )
      | ~ compatible(X0,X1,X2) ),
    inference(cnf_transformation,[],[f91]) ).

tcf(c_231,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( subclass(domain_of(domain_of(flip(cross_product(X0,universal_class)))),domain_of(domain_of(X2)))
      | ~ compatible(X0,X1,X2) ),
    inference(cnf_transformation,[],[f171]) ).

tcf(c_257,negated_conjecture,
    compatible(xh1,xf1,xf2),
    inference(cnf_transformation,[],[f122]) ).

tcf(c_258,negated_conjecture,
    compatible(xh2,xf2,xf3),
    inference(cnf_transformation,[],[f123]) ).

tcf(c_259,negated_conjecture,
    ~ subclass(domain_of(domain_of(flip(cross_product(xh1,universal_class)))),domain_of(xh2)),
    inference(cnf_transformation,[],[f187]) ).

tcf(c_3206,definition,
    iPr_def_10 = cross_product(xh1,universal_class),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_3207,definition,
    iPr_def_11 = flip(iPr_def_10),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_3208,definition,
    iPr_def_12 = domain_of(iPr_def_11),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_3209,definition,
    iPr_def_13 = domain_of(iPr_def_12),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_3210,definition,
    iPr_def_14 = domain_of(xh2),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_3211,negated_conjecture,
    ~ subclass(iPr_def_13,iPr_def_14),
    inference(demodulation,[status(thm)],[c_259,c_3210,c_3206,c_3207,c_3208,c_3209]) ).

tcf(c_3212,negated_conjecture,
    compatible(xh2,xf2,xf3),
    inference(demodulation,[status(thm)],[c_258]) ).

tcf(c_3213,negated_conjecture,
    compatible(xh1,xf1,xf2),
    inference(demodulation,[status(thm)],[c_257]) ).

tcf(c_4475,plain,
    domain_of(domain_of(xf2)) = domain_of(xh2),
    inference(superposition,[status(thm)],[c_3212,c_230]) ).

tcf(c_4476,plain,
    domain_of(domain_of(xf2)) = iPr_def_14,
    inference(light_normalisation,[status(thm)],[c_4475,c_3210]) ).

tcf(c_4851,plain,
    subclass(domain_of(domain_of(flip(cross_product(xh1,universal_class)))),domain_of(domain_of(xf2))),
    inference(superposition,[status(thm)],[c_3213,c_231]) ).

tcf(c_4853,plain,
    subclass(iPr_def_13,iPr_def_14),
    inference(light_normalisation,[status(thm)],[c_4851,c_3206,c_3207,c_3208,c_3209,c_4476]) ).

tcf(c_4854,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_4853,c_3211]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET563-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37  % Computer : n016.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Thu Sep 24 11:23:12 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/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.11/0.42  
% 0.11/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42  
% 0.11/0.42  % Detected problem language: tptp
% 0.11/0.43  % Proving...
% 3.41/1.29  % SZS status Started for theBenchmark.p
% 3.41/1.29  % SZS status Unsatisfiable for theBenchmark.p
% 3.41/1.29  
% 3.41/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.41/1.29  
% 3.41/1.29  % ------  iProver source info
% 3.41/1.29  
% 3.41/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 3.41/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.41/1.29  % git: non_committed_changes: false
% 3.41/1.29  
% 3.41/1.29  % ------ Parsing...% successful
% 3.41/1.29  
% 3.41/1.29  
% 3.41/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.41/1.29  
% 3.41/1.29  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe_e  sup_sim: 0  sf_s  rm: 3 0s  sf_e  pe_s  pe_e % 
% 3.41/1.29  
% 3.41/1.29  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.41/1.29  
% 3.41/1.29  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.41/1.29  % ------ Proving...
% 3.41/1.29  % ------ Problem Properties 
% 3.41/1.29  
% 3.41/1.29  % 
% 3.41/1.29  % clauses                               89
% 3.41/1.29  % conjectures                           3
% 3.41/1.29  % EPR                                   15
% 3.41/1.29  % Horn                                  81
% 3.41/1.29  % unary                                 28
% 3.41/1.29  % binary                                40
% 3.41/1.29  % lits                                  177
% 3.41/1.29  % lits eq                               30
% 3.41/1.29  % fd_pure                               0
% 3.41/1.29  % fd_pseudo                             0
% 3.41/1.29  % fd_cond                               3
% 3.41/1.29  % fd_pseudo_cond                        7
% 3.41/1.29  % AC symbols                            0
% 3.41/1.29  
% 3.41/1.29  % ------ Schedule dynamic 5 is on 
% 3.41/1.29  
% 3.41/1.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.41/1.29  
% 3.41/1.29  
% 3.41/1.29  % ------ 
% 3.41/1.29  % Current options:
% 3.41/1.29  % ------ 
% 3.41/1.29  
% 3.41/1.29  
% 3.41/1.29  % 
% 3.41/1.29  
% 3.41/1.29  % ------ Proving...
% 3.41/1.29  % 
% 3.41/1.29  
% 3.41/1.29  % SZS status Unsatisfiable for theBenchmark.p
% 3.41/1.29  
% 3.41/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.41/1.29  
% 3.41/1.29  
%------------------------------------------------------------------------------