↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN283-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n028.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:19:57 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ q1(a,b,a),
    file('SYN283-1.p',unknown),
    [] ).

cnf(7,axiom,
    q0(b,b),
    file('SYN283-1.p',unknown),
    [] ).

cnf(10,axiom,
    r0(b),
    file('SYN283-1.p',unknown),
    [] ).

cnf(15,axiom,
    p0(b,u),
    file('SYN283-1.p',unknown),
    [] ).

cnf(21,axiom,
    l0(a),
    file('SYN283-1.p',unknown),
    [] ).

cnf(143,axiom,
    ( ~ r0(u)
    | ~ l0(v)
    | ~ q0(w,w)
    | ~ p0(x,v)
    | q1(v,w,v) ),
    file('SYN283-1.p',unknown),
    [] ).

cnf(420,plain,
    ( ~ l0(a)
    | ~ r0(u)
    | ~ p0(v,a)
    | ~ q0(b,b) ),
    inference(res,[status(thm),theory(equality)],[143,1]),
    [iquote('0:Res:143.4,1.0')] ).

cnf(421,plain,
    ( ~ r0(u)
    | ~ p0(v,a) ),
    inference(mrr,[status(thm)],[420,21,7]),
    [iquote('0:MRR:420.0,420.3,21.0,7.0')] ).

cnf(473,plain,
    ~ p0(u,a),
    inference(ems,[status(thm)],[421,10]),
    [iquote('0:EmS:421.0,10.0')] ).

cnf(475,plain,
    $false,
    inference(unc,[status(thm)],[473,15]),
    [iquote('0:UnC:473.0,15.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN283-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n028.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 : Mon Jul 11 16:31:29 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.46  
% 0.19/0.46  SPASS V 3.9 
% 0.19/0.46  SPASS beiseite: Proof found.
% 0.19/0.46  % SZS status Theorem
% 0.19/0.46  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.46  SPASS derived 22 clauses, backtracked 0 clauses, performed 0 splits and kept 352 clauses.
% 0.19/0.46  SPASS allocated 76111 KBytes.
% 0.19/0.46  SPASS spent	0:00:00.11 on the problem.
% 0.19/0.46  		0:00:00.04 for the input.
% 0.19/0.46  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.46  		0:00:00.00 for inferences.
% 0.19/0.46  		0:00:00.00 for the backtracking.
% 0.19/0.46  		0:00:00.03 for the reduction.
% 0.19/0.46  
% 0.19/0.46  
% 0.19/0.46  Here is a proof with depth 2, length 10 :
% 0.19/0.46  % SZS output start Refutation
% See solution above
% 0.19/0.46  Formulae used in the proof : prove_this axiom_6 axiom_9 axiom_14 axiom_20 rule_104
% 0.19/0.46  
%------------------------------------------------------------------------------