TSTP Solution File: SYN327-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN327-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n019.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 : Thu Jul 21 12:20:19 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( f(u,a)
    | f(a,u) ),
    file('SYN327-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ f(u,a)
    | ~ f(z__dfg(u),u)
    | f(a,z__dfg(u)) ),
    file('SYN327-1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ f(a,u)
    | ~ f(a,z__dfg(u)) ),
    file('SYN327-1.p',unknown),
    [] ).

cnf(7,plain,
    f(a,a),
    inference(fac,[status(thm)],[1]),
    [iquote('0:Fac:1.0,1.1')] ).

cnf(10,plain,
    ( ~ f(a,a)
    | f(a,z__dfg(a))
    | f(a,z__dfg(a)) ),
    inference(res,[status(thm),theory(equality)],[1,4]),
    [iquote('0:Res:1.0,4.1')] ).

cnf(11,plain,
    ( ~ f(a,a)
    | f(a,z__dfg(a)) ),
    inference(obv,[status(thm),theory(equality)],[10]),
    [iquote('0:Obv:10.1')] ).

cnf(12,plain,
    f(a,z__dfg(a)),
    inference(mrr,[status(thm)],[11,7]),
    [iquote('0:MRR:11.0,7.0')] ).

cnf(13,plain,
    ~ f(a,a),
    inference(res,[status(thm),theory(equality)],[12,5]),
    [iquote('0:Res:12.0,5.1')] ).

cnf(15,plain,
    $false,
    inference(mrr,[status(thm)],[13,7]),
    [iquote('0:MRR:13.0,7.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN327-1 : TPTP v8.1.0. Released v1.2.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n019.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jul 12 05:49:53 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.41  
% 0.19/0.41  SPASS V 3.9 
% 0.19/0.41  SPASS beiseite: Proof found.
% 0.19/0.41  % SZS status Theorem
% 0.19/0.41  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.41  SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 9 clauses.
% 0.19/0.41  SPASS allocated 63081 KBytes.
% 0.19/0.41  SPASS spent	0:00:00.06 on the problem.
% 0.19/0.41  		0:00:00.04 for the input.
% 0.19/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.41  		0:00:00.00 for inferences.
% 0.19/0.41  		0:00:00.00 for the backtracking.
% 0.19/0.41  		0:00:00.00 for the reduction.
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  Here is a proof with depth 2, length 9 :
% 0.19/0.41  % SZS output start Refutation
% See solution above
% 0.19/0.41  Formulae used in the proof : clause1 clause4 clause5
% 0.19/0.41  
%------------------------------------------------------------------------------