↑ Up

SPASS---3.9.THM-Ref.s

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

% Computer : n021.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:01:51 EDT 2022

% Result   : Theorem 32.34s 32.58s
% Output   : Refutation 32.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   20
% Syntax   : Number of clauses     :   34 (  19 unt;   1 nHn;  34 RR)
%            Number of literals    :   70 (   0 equ;  42 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   9 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ssList(skc9),
    file('SWC118+1.p',unknown),
    [] ).

cnf(2,axiom,
    ssList(skc8),
    file('SWC118+1.p',unknown),
    [] ).

cnf(4,axiom,
    ssList(skc6),
    file('SWC118+1.p',unknown),
    [] ).

cnf(5,axiom,
    totalorderedP(skc6),
    file('SWC118+1.p',unknown),
    [] ).

cnf(8,axiom,
    ssList(nil),
    file('SWC118+1.p',unknown),
    [] ).

cnf(9,axiom,
    cyclefreeP(nil),
    file('SWC118+1.p',unknown),
    [] ).

cnf(10,axiom,
    totalorderP(nil),
    file('SWC118+1.p',unknown),
    [] ).

cnf(11,axiom,
    strictorderP(nil),
    file('SWC118+1.p',unknown),
    [] ).

cnf(12,axiom,
    totalorderedP(nil),
    file('SWC118+1.p',unknown),
    [] ).

cnf(13,axiom,
    strictorderedP(nil),
    file('SWC118+1.p',unknown),
    [] ).

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

cnf(15,axiom,
    equalelemsP(nil),
    file('SWC118+1.p',unknown),
    [] ).

cnf(66,axiom,
    ( ~ ssList(u)
    | segmentP(u,u) ),
    file('SWC118+1.p',unknown),
    [] ).

cnf(69,axiom,
    equal(app(app(skc8,skc6),skc9),skc7),
    file('SWC118+1.p',unknown),
    [] ).

cnf(70,axiom,
    ( ~ equal(skc6,nil)
    | equal(skc7,nil) ),
    file('SWC118+1.p',unknown),
    [] ).

cnf(80,axiom,
    ( ~ equal(skc7,nil)
    | ~ equal(skc6,nil) ),
    file('SWC118+1.p',unknown),
    [] ).

cnf(81,axiom,
    ( ~ segmentP(skc7,skc6)
    | ~ neq(skc6,nil) ),
    file('SWC118+1.p',unknown),
    [] ).

cnf(108,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | neq(v,u)
    | equal(v,u) ),
    file('SWC118+1.p',unknown),
    [] ).

cnf(159,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ ssList(w)
    | equal(app(app(w,v),u),app(w,app(v,u))) ),
    file('SWC118+1.p',unknown),
    [] ).

cnf(180,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ ssList(w)
    | ~ ssList(x)
    | ~ segmentP(u,v)
    | segmentP(app(app(w,u),x),v) ),
    file('SWC118+1.p',unknown),
    [] ).

cnf(198,plain,
    ( ~ equal(nil,nil)
    | ~ equal(skc6,nil) ),
    inference(rew,[status(thm),theory(equality)],[70,80]),
    [iquote('0:Rew:70.1,80.0')] ).

cnf(199,plain,
    ~ equal(skc6,nil),
    inference(obv,[status(thm),theory(equality)],[198]),
    [iquote('0:Obv:198.0')] ).

cnf(203,plain,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ ssList(w)
    | ~ ssList(x)
    | ~ segmentP(x,w)
    | segmentP(app(v,app(x,u)),w) ),
    inference(rew,[status(thm),theory(equality)],[159,180]),
    [iquote('0:Rew:159.3,180.5')] ).

cnf(290,plain,
    segmentP(skc6,skc6),
    inference(res,[status(thm),theory(equality)],[4,66]),
    [iquote('0:Res:4.0,66.0')] ).

cnf(3831,plain,
    ( ~ ssList(skc9)
    | ~ ssList(skc6)
    | ~ ssList(skc8)
    | equal(app(skc8,app(skc6,skc9)),skc7) ),
    inference(spr,[status(thm),theory(equality)],[159,69]),
    [iquote('0:SpR:159.3,69.0')] ).

cnf(26131,plain,
    equal(app(skc8,app(skc6,skc9)),skc7),
    inference(ssi,[status(thm)],[3831,2,5,4,1]),
    [iquote('0:SSi:3831.2,3831.1,3831.0,2.0,5.0,4.0,1.0')] ).

cnf(26513,plain,
    ( ~ ssList(skc9)
    | ~ ssList(skc8)
    | ~ ssList(u)
    | ~ ssList(skc6)
    | ~ segmentP(skc6,u)
    | segmentP(skc7,u) ),
    inference(spr,[status(thm),theory(equality)],[26131,203]),
    [iquote('0:SpR:26131.0,203.5')] ).

cnf(34184,plain,
    ( ~ ssList(u)
    | ~ segmentP(skc6,u)
    | segmentP(skc7,u) ),
    inference(ssi,[status(thm)],[26513,5,4,2,1]),
    [iquote('0:SSi:26513.3,26513.1,26513.0,5.0,4.0,2.0,1.0')] ).

cnf(36525,plain,
    ( ~ ssList(skc6)
    | ~ segmentP(skc6,skc6)
    | ~ neq(skc6,nil) ),
    inference(res,[status(thm),theory(equality)],[34184,81]),
    [iquote('0:Res:34184.2,81.0')] ).

cnf(36581,plain,
    ( ~ segmentP(skc6,skc6)
    | ~ neq(skc6,nil) ),
    inference(ssi,[status(thm)],[36525,5,4]),
    [iquote('0:SSi:36525.0,5.0,4.0')] ).

cnf(36582,plain,
    ~ neq(skc6,nil),
    inference(mrr,[status(thm)],[36581,290]),
    [iquote('0:MRR:36581.0,290.0')] ).

cnf(36663,plain,
    ( ~ ssList(nil)
    | ~ ssList(skc6)
    | equal(skc6,nil) ),
    inference(res,[status(thm),theory(equality)],[108,36582]),
    [iquote('0:Res:108.2,36582.0')] ).

cnf(36667,plain,
    equal(skc6,nil),
    inference(ssi,[status(thm)],[36663,5,4,15,14,10,11,9,12,13,8]),
    [iquote('0:SSi:36663.1,36663.0,5.0,4.0,15.0,14.0,10.0,11.0,9.0,12.0,13.0,8.0')] ).

cnf(36668,plain,
    $false,
    inference(mrr,[status(thm)],[36667,199]),
    [iquote('0:MRR:36667.0,199.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWC118+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n021.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jun 12 22:11:56 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 32.34/32.58  
% 32.34/32.58  SPASS V 3.9 
% 32.34/32.58  SPASS beiseite: Proof found.
% 32.34/32.58  % SZS status Theorem
% 32.34/32.58  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 32.34/32.58  SPASS derived 25406 clauses, backtracked 7545 clauses, performed 81 splits and kept 13806 clauses.
% 32.34/32.58  SPASS allocated 126664 KBytes.
% 32.34/32.58  SPASS spent	0:0:26.99 on the problem.
% 32.34/32.58  		0:00:00.04 for the input.
% 32.34/32.58  		0:00:00.06 for the FLOTTER CNF translation.
% 32.34/32.58  		0:00:00.31 for inferences.
% 32.34/32.58  		0:00:00.50 for the backtracking.
% 32.34/32.58  		0:0:25.77 for the reduction.
% 32.34/32.58  
% 32.34/32.58  
% 32.34/32.58  Here is a proof with depth 4, length 34 :
% 32.34/32.58  % SZS output start Refutation
% See solution above
% 32.34/32.58  Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax55 ax15 ax82 ax56
% 32.34/32.58  
%------------------------------------------------------------------------------