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

View Problem - Process Solution

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

% Computer : n011.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:08 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ p(u,v,w)
    | p(w,v,u) ),
    file('SYN310-1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ p(u,v,w)
    | p(v,u,w) ),
    file('SYN310-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ p(u,v,g(w))
    | p(u,v,w) ),
    file('SYN310-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ p(f(u),v,w)
    | p(u,v,w) ),
    file('SYN310-1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ p(a,b,c),
    file('SYN310-1.p',unknown),
    [] ).

cnf(6,axiom,
    p(f(g(a)),f(g(b)),f(g(c))),
    file('SYN310-1.p',unknown),
    [] ).

cnf(9,plain,
    p(g(a),f(g(b)),f(g(c))),
    inference(res,[status(thm),theory(equality)],[6,4]),
    [iquote('0:Res:6.0,4.0')] ).

cnf(10,plain,
    p(f(g(c)),f(g(b)),g(a)),
    inference(res,[status(thm),theory(equality)],[9,1]),
    [iquote('0:Res:9.0,1.0')] ).

cnf(14,plain,
    p(g(c),f(g(b)),g(a)),
    inference(res,[status(thm),theory(equality)],[10,4]),
    [iquote('0:Res:10.0,4.0')] ).

cnf(20,plain,
    p(g(c),f(g(b)),a),
    inference(res,[status(thm),theory(equality)],[14,3]),
    [iquote('0:Res:14.0,3.0')] ).

cnf(22,plain,
    p(a,f(g(b)),g(c)),
    inference(res,[status(thm),theory(equality)],[20,1]),
    [iquote('0:Res:20.0,1.0')] ).

cnf(28,plain,
    p(a,f(g(b)),c),
    inference(res,[status(thm),theory(equality)],[22,3]),
    [iquote('0:Res:22.0,3.0')] ).

cnf(30,plain,
    p(f(g(b)),a,c),
    inference(res,[status(thm),theory(equality)],[28,2]),
    [iquote('0:Res:28.0,2.0')] ).

cnf(38,plain,
    p(g(b),a,c),
    inference(res,[status(thm),theory(equality)],[30,4]),
    [iquote('0:Res:30.0,4.0')] ).

cnf(39,plain,
    p(c,a,g(b)),
    inference(res,[status(thm),theory(equality)],[38,1]),
    [iquote('0:Res:38.0,1.0')] ).

cnf(43,plain,
    p(c,a,b),
    inference(res,[status(thm),theory(equality)],[39,3]),
    [iquote('0:Res:39.0,3.0')] ).

cnf(47,plain,
    p(b,a,c),
    inference(res,[status(thm),theory(equality)],[43,1]),
    [iquote('0:Res:43.0,1.0')] ).

cnf(50,plain,
    p(a,b,c),
    inference(res,[status(thm),theory(equality)],[47,2]),
    [iquote('0:Res:47.0,2.0')] ).

cnf(51,plain,
    $false,
    inference(mrr,[status(thm)],[50,5]),
    [iquote('0:MRR:50.0,5.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : SYN310-1 : TPTP v8.1.0. Released v1.2.0.
% 0.09/0.11  % Command  : run_spass %d %s
% 0.11/0.32  % Computer : n011.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Tue Jul 12 02:51:43 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.40  
% 0.18/0.40  SPASS V 3.9 
% 0.18/0.40  SPASS beiseite: Proof found.
% 0.18/0.40  % SZS status Theorem
% 0.18/0.40  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.40  SPASS derived 44 clauses, backtracked 0 clauses, performed 0 splits and kept 41 clauses.
% 0.18/0.40  SPASS allocated 63113 KBytes.
% 0.18/0.40  SPASS spent	0:00:00.06 on the problem.
% 0.18/0.40  		0:00:00.04 for the input.
% 0.18/0.40  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.40  		0:00:00.00 for inferences.
% 0.18/0.40  		0:00:00.00 for the backtracking.
% 0.18/0.40  		0:00:00.00 for the reduction.
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  Here is a proof with depth 12, length 19 :
% 0.18/0.40  % SZS output start Refutation
% See solution above
% 0.18/0.40  Formulae used in the proof : clause1 clause2 clause3 clause4 clause5 clause6
% 0.18/0.40  
%------------------------------------------------------------------------------