TSTP Solution File: KRS003_1 by SPASS+T---2.2.22

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS+T---2.2.22
% Problem  : KRS003_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : spasst-tptp-script %s %d

% Computer : n032.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sun Jul 17 03:31:06 EDT 2022

% Result   : Theorem 0.43s 0.75s
% Output   : Refutation 0.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   29 (   7 unt;   0 nHn;  29 RR)
%            Number of literals    :   90 (   0 equ;  70 neg)
%            Maximal clause size   :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   23 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    unreal(exist),
    file('KRS003_1.p',unknown),
    [] ).

cnf(4,axiom,
    e(exist),
    file('KRS003_1.p',unknown),
    [] ).

cnf(5,axiom,
    f(exist),
    file('KRS003_1.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ unreal(U)
    | real(u1r2(U)) ),
    file('KRS003_1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ unreal(U)
    | real(u1r1(U)) ),
    file('KRS003_1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ unreal(U)
    | ~ f(U)
    | d(U) ),
    file('KRS003_1.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ unreal(U)
    | ~ e(U)
    | c(U) ),
    file('KRS003_1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ unreal(U)
    | ~ d(U)
    | s1most(U) ),
    file('KRS003_1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ unreal(U)
    | ~ c(U)
    | s2least(U) ),
    file('KRS003_1.p',unknown),
    [] ).

cnf(18,axiom,
    ( ~ unreal(U)
    | ~ s2least(U)
    | s(U,u1r2(U)) ),
    file('KRS003_1.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ unreal(U)
    | ~ s2least(U)
    | s(U,u1r1(U)) ),
    file('KRS003_1.p',unknown),
    [] ).

cnf(21,axiom,
    ( ~ unreal(U)
    | ~ s2least(U)
    | ~ equalish(u1r2(U),u1r1(U)) ),
    file('KRS003_1.p',unknown),
    [] ).

cnf(23,axiom,
    ( ~ real(U)
    | ~ real(V)
    | ~ unreal(W)
    | ~ s1most(W)
    | ~ s(W,U)
    | ~ s(W,V)
    | equalish(V,U) ),
    file('KRS003_1.p',unknown),
    [] ).

cnf(24,plain,
    ( ~ unreal(exist)
    | d(exist) ),
    inference(res,[status(thm),theory(equality)],[5,10]),
    [iquote('0:Res:5.0,10.0')] ).

cnf(25,plain,
    ( ~ unreal(exist)
    | c(exist) ),
    inference(res,[status(thm),theory(equality)],[4,11]),
    [iquote('0:Res:4.0,11.0')] ).

cnf(26,plain,
    d(exist),
    inference(mrr,[status(thm)],[24,1]),
    [iquote('0:MRR:24.0,1.0')] ).

cnf(27,plain,
    c(exist),
    inference(mrr,[status(thm)],[25,1]),
    [iquote('0:MRR:25.0,1.0')] ).

cnf(61,plain,
    ( ~ unreal(U)
    | ~ s2least(U)
    | ~ real(u1r1(U))
    | ~ real(V)
    | ~ unreal(U)
    | ~ s1most(U)
    | ~ s(U,V)
    | equalish(V,u1r1(U)) ),
    inference(res,[status(thm),theory(equality)],[19,23]),
    [iquote('0:Res:19.2,23.4')] ).

cnf(65,plain,
    ( ~ s2least(U)
    | ~ real(u1r1(U))
    | ~ real(V)
    | ~ unreal(U)
    | ~ s1most(U)
    | ~ s(U,V)
    | equalish(V,u1r1(U)) ),
    inference(obv,[status(thm),theory(equality)],[61]),
    [iquote('0:Obv:61.0')] ).

cnf(66,plain,
    ( ~ s2least(U)
    | ~ real(V)
    | ~ unreal(U)
    | ~ s1most(U)
    | ~ s(U,V)
    | equalish(V,u1r1(U)) ),
    inference(mrr,[status(thm)],[65,9]),
    [iquote('0:MRR:65.1,9.1')] ).

cnf(72,plain,
    ( ~ s2least(U)
    | ~ real(u1r2(U))
    | ~ unreal(U)
    | ~ s1most(U)
    | ~ s(U,u1r2(U))
    | ~ unreal(U)
    | ~ s2least(U) ),
    inference(res,[status(thm),theory(equality)],[66,21]),
    [iquote('0:Res:66.5,21.2')] ).

cnf(73,plain,
    ( ~ real(u1r2(U))
    | ~ s1most(U)
    | ~ s(U,u1r2(U))
    | ~ unreal(U)
    | ~ s2least(U) ),
    inference(obv,[status(thm),theory(equality)],[72]),
    [iquote('0:Obv:72.2')] ).

cnf(74,plain,
    ( ~ s1most(U)
    | ~ unreal(U)
    | ~ s2least(U) ),
    inference(mrr,[status(thm)],[73,8,18]),
    [iquote('0:MRR:73.0,73.2,8.1,18.2')] ).

cnf(76,plain,
    ( ~ unreal(U)
    | ~ d(U)
    | ~ unreal(U)
    | ~ s2least(U) ),
    inference(res,[status(thm),theory(equality)],[13,74]),
    [iquote('0:Res:13.2,74.0')] ).

cnf(77,plain,
    ( ~ d(U)
    | ~ unreal(U)
    | ~ s2least(U) ),
    inference(obv,[status(thm),theory(equality)],[76]),
    [iquote('0:Obv:76.0')] ).

cnf(78,plain,
    ( ~ unreal(exist)
    | ~ s2least(exist) ),
    inference(res,[status(thm),theory(equality)],[26,77]),
    [iquote('0:Res:26.0,77.0')] ).

cnf(81,plain,
    ~ s2least(exist),
    inference(mrr,[status(thm)],[78,1]),
    [iquote('0:MRR:78.0,1.0')] ).

cnf(83,plain,
    ( ~ unreal(exist)
    | ~ c(exist) ),
    inference(res,[status(thm),theory(equality)],[15,81]),
    [iquote('0:Res:15.2,81.0')] ).

cnf(84,plain,
    $false,
    inference(mrr,[status(thm)],[83,1,27]),
    [iquote('0:MRR:83.0,83.1,1.0,27.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem  : KRS003_1 : TPTP v8.1.0. Released v5.0.0.
% 0.00/0.07  % Command  : spasst-tptp-script %s %d
% 0.06/0.26  % Computer : n032.cluster.edu
% 0.06/0.26  % Model    : x86_64 x86_64
% 0.06/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26  % Memory   : 8042.1875MB
% 0.06/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26  % CPULimit : 300
% 0.06/0.26  % WCLimit  : 600
% 0.06/0.26  % DateTime : Tue Jun  7 16:47:50 EDT 2022
% 0.06/0.26  % CPUTime  : 
% 0.10/0.34  % Using EUF theory
% 0.43/0.75  
% 0.43/0.75  
% 0.43/0.75  % SZS status Theorem for /tmp/SPASST_16969_n032.cluster.edu
% 0.43/0.75  
% 0.43/0.75  SPASS V 2.2.22  in combination with yices.
% 0.43/0.75  SPASS beiseite: Proof found by SPASS.
% 0.43/0.75  Problem: /tmp/SPASST_16969_n032.cluster.edu 
% 0.43/0.75  SPASS derived 21 clauses, backtracked 0 clauses and kept 36 clauses.
% 0.43/0.75  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.43/0.75  SPASS allocated 6383 KBytes.
% 0.43/0.75  SPASS spent	0:00:00.01 on the problem.
% 0.43/0.75  		0:00:00.00 for the input.
% 0.43/0.75  		0:00:00.00 for the FLOTTER CNF translation.
% 0.43/0.75  		0:00:00.00 for inferences.
% 0.43/0.75  		0:00:00.00 for the backtracking.
% 0.43/0.75  		0:00:00.00 for the reduction.
% 0.43/0.75  		0:00:00.00 for interacting with the SMT procedure.
% 0.43/0.75  		
% 0.43/0.75  
% 0.43/0.75  % SZS output start CNFRefutation for /tmp/SPASST_16969_n032.cluster.edu
% See solution above
% 0.43/0.75  
% 0.43/0.75  Formulae used in the proof : fof_exist_type fof_clause_1__clause_2 fof_u1r2_type fof_u1r1_type fof_clause_16 fof_clause_15 fof_clause_9 fof_clause_3 fof_clause_7 fof_clause_6 fof_clause_5 fof_clause_11
% 0.47/0.77  
% 0.47/0.77  SPASS+T ended
%------------------------------------------------------------------------------