TSTP Solution File: GEO085+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GEO085+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n024.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 : Sat Jul 16 06:22:12 EDT 2022

% Result   : Theorem 0.18s 0.46s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   19 (   7 unt;   2 nHn;  19 RR)
%            Number of literals    :   33 (   0 equ;  18 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    open(skc1),
    file('GEO085+1.p',unknown),
    [] ).

cnf(7,axiom,
    ( closed(u)
    | end_point(skf17(u),u) ),
    file('GEO085+1.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ closed(u)
    | ~ end_point(v,u) ),
    file('GEO085+1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ open(u)
    | end_point(skf18(u),u) ),
    file('GEO085+1.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ end_point(u,v)
    | end_point(skf22(u,v),v) ),
    file('GEO085+1.p',unknown),
    [] ).

cnf(21,axiom,
    ( ~ end_point(u,v)
    | ~ equal(skf22(u,w),u) ),
    file('GEO085+1.p',unknown),
    [] ).

cnf(23,axiom,
    ( ~ end_point(u,skc1)
    | ~ end_point(v,skc1)
    | equal(v,u) ),
    file('GEO085+1.p',unknown),
    [] ).

cnf(45,plain,
    end_point(skf18(skc1),skc1),
    inference(res,[status(thm),theory(equality)],[1,12]),
    [iquote('0:Res:1.0,12.0')] ).

cnf(46,plain,
    ( ~ end_point(u,skc1)
    | equal(skf18(skc1),u) ),
    inference(res,[status(thm),theory(equality)],[45,23]),
    [iquote('0:Res:45.0,23.0')] ).

cnf(51,plain,
    ~ closed(skc1),
    inference(res,[status(thm),theory(equality)],[45,11]),
    [iquote('0:Res:45.0,11.1')] ).

cnf(56,plain,
    ( closed(skc1)
    | equal(skf18(skc1),skf17(skc1)) ),
    inference(res,[status(thm),theory(equality)],[7,46]),
    [iquote('0:Res:7.1,46.0')] ).

cnf(58,plain,
    equal(skf18(skc1),skf17(skc1)),
    inference(mrr,[status(thm)],[56,51]),
    [iquote('0:MRR:56.0,51.0')] ).

cnf(59,plain,
    end_point(skf17(skc1),skc1),
    inference(rew,[status(thm),theory(equality)],[58,45]),
    [iquote('0:Rew:58.0,45.0')] ).

cnf(60,plain,
    ( ~ end_point(u,skc1)
    | equal(skf17(skc1),u) ),
    inference(rew,[status(thm),theory(equality)],[58,46]),
    [iquote('0:Rew:58.0,46.1')] ).

cnf(72,plain,
    ( ~ end_point(u,skc1)
    | equal(skf22(u,skc1),skf17(skc1)) ),
    inference(res,[status(thm),theory(equality)],[19,60]),
    [iquote('0:Res:19.1,60.0')] ).

cnf(81,plain,
    ( ~ end_point(u,skc1)
    | ~ end_point(u,v)
    | ~ equal(skf17(skc1),u) ),
    inference(spl,[status(thm),theory(equality)],[72,21]),
    [iquote('0:SpL:72.1,21.1')] ).

cnf(82,plain,
    ( ~ end_point(u,skc1)
    | ~ equal(skf17(skc1),u) ),
    inference(con,[status(thm)],[81]),
    [iquote('0:Con:81.1')] ).

cnf(86,plain,
    ~ equal(skf17(skc1),skf17(skc1)),
    inference(res,[status(thm),theory(equality)],[59,82]),
    [iquote('0:Res:59.0,82.0')] ).

cnf(87,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[86]),
    [iquote('0:Obv:86.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : GEO085+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.11/0.33  % Computer : n024.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sat Jun 18 10:07:17 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.46  
% 0.18/0.46  SPASS V 3.9 
% 0.18/0.46  SPASS beiseite: Proof found.
% 0.18/0.46  % SZS status Theorem
% 0.18/0.46  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.46  SPASS derived 39 clauses, backtracked 0 clauses, performed 0 splits and kept 64 clauses.
% 0.18/0.46  SPASS allocated 98033 KBytes.
% 0.18/0.46  SPASS spent	0:00:00.12 on the problem.
% 0.18/0.46  		0:00:00.04 for the input.
% 0.18/0.46  		0:00:00.06 for the FLOTTER CNF translation.
% 0.18/0.46  		0:00:00.00 for inferences.
% 0.18/0.46  		0:00:00.00 for the backtracking.
% 0.18/0.46  		0:00:00.00 for the reduction.
% 0.18/0.46  
% 0.18/0.46  
% 0.18/0.46  Here is a proof with depth 5, length 19 :
% 0.18/0.46  % SZS output start Refutation
% See solution above
% 0.18/0.46  Formulae used in the proof : theorem_2_7_1 closed_defn open_defn c6
% 0.18/0.46  
%------------------------------------------------------------------------------