↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n018.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:04:17 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f3320,axiom,
    ! [X0,X1] : c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X0,X1),c_Pair(c_UNITY_OActs(X0,X1),c_UNITY_OAllowedActs(X0,X1),tc_set(tc_set(tc_prod(X1,X1))),tc_set(tc_set(tc_prod(X1,X1)))),tc_set(X1),tc_prod(tc_set(tc_set(tc_prod(X1,X1))),tc_set(tc_set(tc_prod(X1,X1))))),X1) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_UNITY_Osurjective__mk__program_0) ).

fof(f3321,negated_conjecture,
    c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f3322,negated_conjecture,
    c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f3323,negated_conjecture,
    c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f3324,negated_conjecture,
    v_F != v_G,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

tcf(c_4930,plain,
    ! [X0: $i,X1: $i] : c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X0,X1),c_Pair(c_UNITY_OActs(X0,X1),c_UNITY_OAllowedActs(X0,X1),tc_set(tc_set(tc_prod(X1,X1))),tc_set(tc_set(tc_prod(X1,X1)))),tc_set(X1),tc_prod(tc_set(tc_set(tc_prod(X1,X1))),tc_set(tc_set(tc_prod(X1,X1))))),X1) = X0,
    inference(cnf_transformation,[],[f3320]) ).

tcf(c_4931,negated_conjecture,
    c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a),
    inference(cnf_transformation,[],[f3321]) ).

tcf(c_4932,negated_conjecture,
    c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a),
    inference(cnf_transformation,[],[f3322]) ).

tcf(c_4933,negated_conjecture,
    c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a),
    inference(cnf_transformation,[],[f3323]) ).

tcf(c_4934,negated_conjecture,
    v_F != v_G,
    inference(cnf_transformation,[],[f3324]) ).

tcf(c_5142,plain,
    c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(v_G,t_a),c_Pair(c_UNITY_OActs(v_G,t_a),c_UNITY_OAllowedActs(v_F,t_a),tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a)))),tc_set(t_a),tc_prod(tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a))))),t_a) = v_G,
    inference(superposition,[status(thm)],[c_4933,c_4930]) ).

tcf(c_5151,plain,
    c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(v_F,t_a),c_Pair(c_UNITY_OActs(v_F,t_a),c_UNITY_OAllowedActs(v_F,t_a),tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a)))),tc_set(t_a),tc_prod(tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a))))),t_a) = v_G,
    inference(light_normalisation,[status(thm)],[c_5142,c_4931,c_4932]) ).

tcf(c_5152,plain,
    v_F = v_G,
    inference(demodulation,[status(thm)],[c_5151,c_4930]) ).

tcf(c_5153,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_5152,c_4934]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COM010-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.36  % Computer : n018.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Fri Sep 25 07:47:51 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/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.15/0.42  
% 0.15/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.42  
% 0.15/0.42  % Detected problem language: tptp
% 0.15/0.43  % Proving...
% 7.35/1.80  % SZS status Started for theBenchmark.p
% 7.35/1.80  % SZS status Unsatisfiable for theBenchmark.p
% 7.35/1.80  
% 7.35/1.80  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 7.35/1.80  
% 7.35/1.80  % ------  iProver source info
% 7.35/1.80  
% 7.35/1.80  % git: date: 2026-07-19 20:42:38 +0200
% 7.35/1.80  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 7.35/1.80  % git: non_committed_changes: false
% 7.35/1.80  
% 7.35/1.80  % ------ Parsing...% successful
% 7.35/1.80  
% 7.35/1.80  
% 7.35/1.80  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 7.35/1.80  % ------ Proving...
% 7.35/1.80  % ------ Problem Properties 
% 7.35/1.80  
% 7.35/1.80  % 
% 7.35/1.80  % clauses                               2146
% 7.35/1.80  % conjectures                           4
% 7.35/1.80  % EPR                                   667
% 7.35/1.80  % Horn                                  1959
% 7.35/1.80  % unary                                 624
% 7.35/1.80  % binary                                1079
% 7.35/1.80  % lits                                  4339
% 7.35/1.80  % lits eq                               1171
% 7.35/1.80  % fd_pure                               0
% 7.35/1.80  % fd_pseudo                             0
% 7.35/1.80  % fd_cond                               118
% 7.35/1.80  % fd_pseudo_cond                        66
% 7.35/1.80  % AC symbols                            0
% 7.35/1.80  
% 7.35/1.80  % ------ Input Options Time Limit: Unbounded
% 7.35/1.80  
% 7.35/1.80  
% 7.35/1.80  % ------ 
% 7.35/1.80  % Current options:
% 7.35/1.80  % ------ 
% 7.35/1.80  
% 7.35/1.80  
% 7.35/1.80  % 
% 7.35/1.80  
% 7.35/1.80  % ------ Proving...
% 7.35/1.80  % 
% 7.35/1.80  
% 7.35/1.80  % SZS status Unsatisfiable for theBenchmark.p
% 7.35/1.80  
% 7.35/1.80  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.35/1.80  
% 7.35/1.80  
%------------------------------------------------------------------------------