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

View Problem - Process Solution

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

% Computer : n016.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:18:27 EDT 2022

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

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

cnf(2,axiom,
    ( big(a,f(a))
    | big(a,b) ),
    file('SYN082-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ big(a,u)
    | ~ big(v,b)
    | big(g(u),u)
    | big(v,f(a)) ),
    file('SYN082-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ big(a,u)
    | big(g(u),u)
    | big(a,b) ),
    file('SYN082-1.p',unknown),
    [] ).

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

cnf(6,axiom,
    ( ~ big(g(u),u)
    | ~ big(a,u)
    | ~ big(v,b)
    | big(v,f(a)) ),
    file('SYN082-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ big(g(u),u)
    | ~ big(a,u)
    | big(a,b) ),
    file('SYN082-1.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ big(g(u),u)
    | ~ big(a,u)
    | ~ big(a,f(a)) ),
    file('SYN082-1.p',unknown),
    [] ).

cnf(9,plain,
    ( ~ big(a,u)
    | big(a,b) ),
    inference(mrr,[status(thm)],[7,4]),
    [iquote('0:MRR:7.0,4.1')] ).

cnf(10,plain,
    big(a,b),
    inference(mrr,[status(thm)],[2,9]),
    [iquote('0:MRR:2.0,9.0')] ).

cnf(11,plain,
    ( ~ big(a,u)
    | ~ big(a,f(a)) ),
    inference(mrr,[status(thm)],[8,5]),
    [iquote('0:MRR:8.0,5.2')] ).

cnf(12,plain,
    ( ~ big(a,u)
    | ~ big(v,b)
    | big(v,f(a)) ),
    inference(mrr,[status(thm)],[6,3]),
    [iquote('0:MRR:6.0,3.2')] ).

cnf(13,plain,
    ( ~ big(u,b)
    | big(u,f(a)) ),
    inference(mrr,[status(thm)],[1,12]),
    [iquote('0:MRR:1.1,12.0')] ).

cnf(14,plain,
    ( ~ big(a,b)
    | ~ big(a,u) ),
    inference(res,[status(thm),theory(equality)],[13,11]),
    [iquote('0:Res:13.1,11.1')] ).

cnf(15,plain,
    ~ big(a,b),
    inference(con,[status(thm)],[14]),
    [iquote('0:Con:14.1')] ).

cnf(16,plain,
    $false,
    inference(mrr,[status(thm)],[15,10]),
    [iquote('0:MRR:15.0,10.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN082-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n016.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Tue Jul 12 06:39:44 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.42  
% 0.21/0.42  SPASS V 3.9 
% 0.21/0.42  SPASS beiseite: Proof found.
% 0.21/0.42  % SZS status Theorem
% 0.21/0.42  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.21/0.42  SPASS derived 3 clauses, backtracked 0 clauses, performed 0 splits and kept 11 clauses.
% 0.21/0.42  SPASS allocated 63084 KBytes.
% 0.21/0.42  SPASS spent	0:00:00.06 on the problem.
% 0.21/0.42  		0:00:00.04 for the input.
% 0.21/0.42  		0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.42  		0:00:00.00 for inferences.
% 0.21/0.42  		0:00:00.00 for the backtracking.
% 0.21/0.42  		0:00:00.00 for the reduction.
% 0.21/0.42  
% 0.21/0.42  
% 0.21/0.42  Here is a proof with depth 1, length 16 :
% 0.21/0.42  % SZS output start Refutation
% See solution above
% 0.21/0.42  Formulae used in the proof : clause_1 clause_2 clause_3 clause_4 clause_5 clause_6 clause_7 clause_8
% 0.21/0.42  
%------------------------------------------------------------------------------