↑ Up

SPASS---3.9.UNS-Ref.s

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

% Computer : n007.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:49 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ p1(d,d,a),
    file('SYN263-1.p',unknown),
    [] ).

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

cnf(13,axiom,
    m0(a,u,a),
    file('SYN263-1.p',unknown),
    [] ).

cnf(20,axiom,
    m0(u,d,v),
    file('SYN263-1.p',unknown),
    [] ).

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

cnf(39,axiom,
    m0(b,a,a),
    file('SYN263-1.p',unknown),
    [] ).

cnf(121,axiom,
    ( ~ p1(u,v,w)
    | ~ m0(u,v,w)
    | p1(v,x,u) ),
    file('SYN263-1.p',unknown),
    [] ).

cnf(126,axiom,
    ( ~ r0(b)
    | ~ p1(a,a,a)
    | p1(a,b,a) ),
    file('SYN263-1.p',unknown),
    [] ).

cnf(127,axiom,
    ( ~ l0(a)
    | p1(a,a,a) ),
    file('SYN263-1.p',unknown),
    [] ).

cnf(371,plain,
    p1(a,a,a),
    inference(mrr,[status(thm)],[127,21]),
    [iquote('0:MRR:127.0,21.0')] ).

cnf(389,plain,
    p1(a,b,a),
    inference(mrr,[status(thm)],[126,10,371]),
    [iquote('0:MRR:126.0,126.1,10.0,371.0')] ).

cnf(421,plain,
    ( ~ m0(a,d,u)
    | ~ p1(a,d,u) ),
    inference(res,[status(thm),theory(equality)],[121,1]),
    [iquote('0:Res:121.2,1.0')] ).

cnf(423,plain,
    ~ p1(a,d,u),
    inference(mrr,[status(thm)],[421,20]),
    [iquote('0:MRR:421.0,20.0')] ).

cnf(1262,plain,
    ( ~ m0(a,b,a)
    | p1(b,u,a) ),
    inference(res,[status(thm),theory(equality)],[389,121]),
    [iquote('0:Res:389.0,121.0')] ).

cnf(1276,plain,
    p1(b,u,a),
    inference(mrr,[status(thm)],[1262,13]),
    [iquote('0:MRR:1262.0,13.0')] ).

cnf(1277,plain,
    ( ~ m0(b,u,a)
    | p1(u,v,b) ),
    inference(res,[status(thm),theory(equality)],[1276,121]),
    [iquote('0:Res:1276.0,121.0')] ).

cnf(1529,plain,
    p1(a,u,b),
    inference(res,[status(thm),theory(equality)],[39,1277]),
    [iquote('0:Res:39.0,1277.0')] ).

cnf(1531,plain,
    $false,
    inference(unc,[status(thm)],[1529,423]),
    [iquote('0:UnC:1529.0,423.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SYN263-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n007.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jul 11 11:19:02 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.53  
% 0.20/0.53  SPASS V 3.9 
% 0.20/0.53  SPASS beiseite: Proof found.
% 0.20/0.53  % SZS status Theorem
% 0.20/0.53  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.53  SPASS derived 988 clauses, backtracked 0 clauses, performed 0 splits and kept 814 clauses.
% 0.20/0.53  SPASS allocated 76696 KBytes.
% 0.20/0.53  SPASS spent	0:00:00.18 on the problem.
% 0.20/0.53  		0:00:00.04 for the input.
% 0.20/0.53  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.53  		0:00:00.01 for inferences.
% 0.20/0.53  		0:00:00.00 for the backtracking.
% 0.20/0.53  		0:00:00.07 for the reduction.
% 0.20/0.53  
% 0.20/0.53  
% 0.20/0.53  Here is a proof with depth 3, length 18 :
% 0.20/0.53  % SZS output start Refutation
% See solution above
% 0.20/0.54  Formulae used in the proof : prove_this axiom_9 axiom_12 axiom_19 axiom_20 axiom_38 rule_082 rule_087 rule_088
% 0.20/0.54  
%------------------------------------------------------------------------------