↑ Up

SPASS---3.9.UNS-Ref.s

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

% Computer : n027.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 : Tue Jul 19 22:02:33 EDT 2022

% Result   : Unsatisfiable 1.68s 1.86s
% Output   : Refutation 1.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   29 (  19 unt;   2 nHn;  29 RR)
%            Number of literals    :   43 (   0 equ;  17 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ssList(sk1),
    file('SWC217-1.p',unknown),
    [] ).

cnf(5,axiom,
    equal(sk4,sk2),
    file('SWC217-1.p',unknown),
    [] ).

cnf(6,axiom,
    equal(sk3,sk1),
    file('SWC217-1.p',unknown),
    [] ).

cnf(7,axiom,
    neq(sk2,nil),
    file('SWC217-1.p',unknown),
    [] ).

cnf(8,axiom,
    ~ neq(sk1,nil),
    file('SWC217-1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ neq(sk4,nil)
    | ssItem(sk5) ),
    file('SWC217-1.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ neq(sk4,nil)
    | equal(cons(sk5,nil),sk3) ),
    file('SWC217-1.p',unknown),
    [] ).

cnf(13,axiom,
    equalelemsP(nil),
    file('SWC217-1.p',unknown),
    [] ).

cnf(14,axiom,
    duplicatefreeP(nil),
    file('SWC217-1.p',unknown),
    [] ).

cnf(15,axiom,
    strictorderedP(nil),
    file('SWC217-1.p',unknown),
    [] ).

cnf(16,axiom,
    totalorderedP(nil),
    file('SWC217-1.p',unknown),
    [] ).

cnf(17,axiom,
    strictorderP(nil),
    file('SWC217-1.p',unknown),
    [] ).

cnf(18,axiom,
    totalorderP(nil),
    file('SWC217-1.p',unknown),
    [] ).

cnf(19,axiom,
    cyclefreeP(nil),
    file('SWC217-1.p',unknown),
    [] ).

cnf(20,axiom,
    ssList(nil),
    file('SWC217-1.p',unknown),
    [] ).

cnf(111,axiom,
    ( ~ ssList(u)
    | ~ ssItem(v)
    | ~ equal(cons(v,u),u) ),
    file('SWC217-1.p',unknown),
    [] ).

cnf(112,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | equal(u,v)
    | neq(u,v) ),
    file('SWC217-1.p',unknown),
    [] ).

cnf(200,plain,
    ( ~ neq(sk2,nil)
    | ssItem(sk5) ),
    inference(rew,[status(thm),theory(equality)],[5,10]),
    [iquote('0:Rew:5.0,10.0')] ).

cnf(201,plain,
    ssItem(sk5),
    inference(mrr,[status(thm)],[200,7]),
    [iquote('0:MRR:200.0,7.0')] ).

cnf(205,plain,
    ( ~ neq(sk2,nil)
    | equal(cons(sk5,nil),sk1) ),
    inference(rew,[status(thm),theory(equality)],[6,11,5]),
    [iquote('0:Rew:6.0,11.1,5.0,11.0')] ).

cnf(206,plain,
    equal(cons(sk5,nil),sk1),
    inference(mrr,[status(thm)],[205,7]),
    [iquote('0:MRR:205.0,7.0')] ).

cnf(516,plain,
    ( ~ ssItem(u)
    | ~ equal(cons(u,sk1),sk1) ),
    inference(res,[status(thm),theory(equality)],[1,111]),
    [iquote('0:Res:1.0,111.1')] ).

cnf(517,plain,
    ( ~ ssList(u)
    | equal(sk1,u)
    | neq(sk1,u) ),
    inference(res,[status(thm),theory(equality)],[1,112]),
    [iquote('0:Res:1.0,112.1')] ).

cnf(2655,plain,
    ( ~ ssList(nil)
    | equal(nil,sk1) ),
    inference(res,[status(thm),theory(equality)],[517,8]),
    [iquote('0:Res:517.2,8.0')] ).

cnf(2656,plain,
    equal(nil,sk1),
    inference(ssi,[status(thm)],[2655,20,19,18,17,16,15,14,13]),
    [iquote('0:SSi:2655.0,20.0,19.0,18.0,17.0,16.0,15.0,14.0,13.0')] ).

cnf(2681,plain,
    equal(cons(sk5,sk1),sk1),
    inference(rew,[status(thm),theory(equality)],[2656,206]),
    [iquote('0:Rew:2656.0,206.0')] ).

cnf(3303,plain,
    ( ~ ssItem(sk5)
    | ~ equal(sk1,sk1) ),
    inference(spl,[status(thm),theory(equality)],[2681,516]),
    [iquote('0:SpL:2681.0,516.1')] ).

cnf(3304,plain,
    ~ ssItem(sk5),
    inference(obv,[status(thm),theory(equality)],[3303]),
    [iquote('0:Obv:3303.1')] ).

cnf(3305,plain,
    $false,
    inference(ssi,[status(thm)],[3304,201]),
    [iquote('0:SSi:3304.0,201.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SWC217-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.14  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n027.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 : Sun Jun 12 22:04:46 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 1.68/1.86  
% 1.68/1.86  SPASS V 3.9 
% 1.68/1.86  SPASS beiseite: Proof found.
% 1.68/1.86  % SZS status Theorem
% 1.68/1.86  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 1.68/1.86  SPASS derived 2496 clauses, backtracked 2322 clauses, performed 68 splits and kept 4213 clauses.
% 1.68/1.86  SPASS allocated 78026 KBytes.
% 1.68/1.86  SPASS spent	0:00:01.49 on the problem.
% 1.68/1.86  		0:00:00.04 for the input.
% 1.68/1.86  		0:00:00.00 for the FLOTTER CNF translation.
% 1.68/1.86  		0:00:00.01 for inferences.
% 1.68/1.86  		0:00:00.02 for the backtracking.
% 1.68/1.86  		0:00:01.20 for the reduction.
% 1.68/1.86  
% 1.68/1.86  
% 1.68/1.86  Here is a proof with depth 2, length 29 :
% 1.68/1.86  % SZS output start Refutation
% See solution above
% 1.68/1.86  Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_8 co1_10 co1_11 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause99 clause100
% 1.68/1.86  
%------------------------------------------------------------------------------