TSTP Solution File: GEO021-3 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GEO021-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n026.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:21:39 EDT 2022

% Result   : Unsatisfiable 0.20s 0.41s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    8 (   6 unt;   0 nHn;   8 RR)
%            Number of literals    :   10 (   0 equ;   4 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ( ~ equidistant(u,v,w,x)
    | equidistant(w,x,u,v) ),
    file('GEO021-3.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ equidistant(u,v,w,x)
    | equidistant(v,u,w,x) ),
    file('GEO021-3.p',unknown),
    [] ).

cnf(4,axiom,
    equidistant(u__dfg,v__dfg,w__dfg,x__dfg),
    file('GEO021-3.p',unknown),
    [] ).

cnf(5,axiom,
    ~ equidistant(x__dfg,w__dfg,v__dfg,u__dfg),
    file('GEO021-3.p',unknown),
    [] ).

cnf(24,plain,
    ~ equidistant(w__dfg,x__dfg,v__dfg,u__dfg),
    inference(res,[status(thm),theory(equality)],[3,5]),
    [iquote('0:Res:3.1,5.0')] ).

cnf(34,plain,
    equidistant(v__dfg,u__dfg,w__dfg,x__dfg),
    inference(res,[status(thm),theory(equality)],[4,3]),
    [iquote('0:Res:4.0,3.0')] ).

cnf(50,plain,
    equidistant(w__dfg,x__dfg,v__dfg,u__dfg),
    inference(res,[status(thm),theory(equality)],[34,2]),
    [iquote('0:Res:34.0,2.0')] ).

cnf(52,plain,
    $false,
    inference(mrr,[status(thm)],[50,24]),
    [iquote('0:MRR:50.0,24.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GEO021-3 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n026.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Fri Jun 17 23:46:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.41  
% 0.20/0.41  SPASS V 3.9 
% 0.20/0.41  SPASS beiseite: Proof found.
% 0.20/0.41  % SZS status Theorem
% 0.20/0.41  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.41  SPASS derived 28 clauses, backtracked 0 clauses, performed 0 splits and kept 36 clauses.
% 0.20/0.41  SPASS allocated 63138 KBytes.
% 0.20/0.41  SPASS spent	0:00:00.06 on the problem.
% 0.20/0.41  		0:00:00.04 for the input.
% 0.20/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.41  		0:00:00.00 for inferences.
% 0.20/0.41  		0:00:00.00 for the backtracking.
% 0.20/0.41  		0:00:00.00 for the reduction.
% 0.20/0.41  
% 0.20/0.41  
% 0.20/0.41  Here is a proof with depth 2, length 8 :
% 0.20/0.41  % SZS output start Refutation
% See solution above
% 0.20/0.41  Formulae used in the proof : d2 d3 u_to_v_equals_w_to_x prove_symmetry
% 0.20/0.41  
%------------------------------------------------------------------------------