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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC076-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n011.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:33 EDT 2022

% Result   : Unsatisfiable 49.88s 50.10s
% Output   : Refutation 49.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   22
% Syntax   : Number of clauses     :   40 (  22 unt;   1 nHn;  40 RR)
%            Number of literals    :   82 (   0 equ;  49 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    :   12 (  12 usr;  11 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

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

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

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

cnf(7,axiom,
    ( ~ ssList(u)
    | ~ neq(u,nil)
    | ~ segmentP(sk1,u)
    | ~ segmentP(sk2,u) ),
    file('SWC076-1.p',unknown),
    [] ).

cnf(8,axiom,
    ssList(sk5),
    file('SWC076-1.p',unknown),
    [] ).

cnf(9,axiom,
    ssList(sk6),
    file('SWC076-1.p',unknown),
    [] ).

cnf(10,axiom,
    equal(app(app(sk5,sk3),sk6),sk4),
    file('SWC076-1.p',unknown),
    [] ).

cnf(11,axiom,
    equalelemsP(sk3),
    file('SWC076-1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ equal(nil,sk3)
    | equal(sk4,nil) ),
    file('SWC076-1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ equal(nil,sk2)
    | ~ equal(nil,sk1) ),
    file('SWC076-1.p',unknown),
    [] ).

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

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

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

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

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

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

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

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

cnf(72,axiom,
    ( ~ ssList(u)
    | segmentP(u,u) ),
    file('SWC076-1.p',unknown),
    [] ).

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

cnf(164,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ ssList(w)
    | equal(app(app(u,v),w),app(u,app(v,w))) ),
    file('SWC076-1.p',unknown),
    [] ).

cnf(187,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ ssList(w)
    | ~ ssList(x)
    | ~ segmentP(x,w)
    | segmentP(app(app(v,x),u),w) ),
    file('SWC076-1.p',unknown),
    [] ).

cnf(201,plain,
    equalelemsP(sk1),
    inference(rew,[status(thm),theory(equality)],[6,11]),
    [iquote('0:Rew:6.0,11.0')] ).

cnf(204,plain,
    ( ~ equal(nil,sk1)
    | equal(nil,sk2) ),
    inference(rew,[status(thm),theory(equality)],[5,14,6]),
    [iquote('0:Rew:5.0,14.1,6.0,14.0')] ).

cnf(205,plain,
    equal(app(app(sk5,sk1),sk6),sk2),
    inference(rew,[status(thm),theory(equality)],[6,10,5]),
    [iquote('0:Rew:6.0,10.0,5.0,10.0')] ).

cnf(206,plain,
    ( ~ equal(sk2,sk2)
    | ~ equal(nil,sk1) ),
    inference(rew,[status(thm),theory(equality)],[204,15]),
    [iquote('0:Rew:204.1,15.0')] ).

cnf(207,plain,
    ~ equal(nil,sk1),
    inference(obv,[status(thm),theory(equality)],[206]),
    [iquote('0:Obv:206.0')] ).

cnf(210,plain,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ ssList(w)
    | ~ ssList(x)
    | ~ segmentP(u,v)
    | segmentP(app(w,app(u,x)),v) ),
    inference(rew,[status(thm),theory(equality)],[164,187]),
    [iquote('0:Rew:164.3,187.5')] ).

cnf(244,plain,
    ( ~ ssList(u)
    | ~ ssList(v)
    | equal(app(app(u,v),sk6),app(u,app(v,sk6))) ),
    inference(res,[status(thm),theory(equality)],[9,164]),
    [iquote('0:Res:9.0,164.0')] ).

cnf(22495,plain,
    ( ~ ssList(sk5)
    | ~ ssList(sk1)
    | equal(app(sk5,app(sk1,sk6)),sk2) ),
    inference(spr,[status(thm),theory(equality)],[244,205]),
    [iquote('0:SpR:244.2,205.0')] ).

cnf(31860,plain,
    equal(app(sk5,app(sk1,sk6)),sk2),
    inference(ssi,[status(thm)],[22495,201,1,8]),
    [iquote('0:SSi:22495.1,22495.0,201.0,1.0,8.0')] ).

cnf(32445,plain,
    ( ~ ssList(sk1)
    | ~ ssList(u)
    | ~ ssList(sk5)
    | ~ ssList(sk6)
    | ~ segmentP(sk1,u)
    | segmentP(sk2,u) ),
    inference(spr,[status(thm),theory(equality)],[31860,210]),
    [iquote('0:SpR:31860.0,210.5')] ).

cnf(33629,plain,
    ( ~ ssList(u)
    | ~ segmentP(sk1,u)
    | segmentP(sk2,u) ),
    inference(ssi,[status(thm)],[32445,9,8,201,1]),
    [iquote('0:SSi:32445.3,32445.2,32445.0,9.0,8.0,201.0,1.0')] ).

cnf(33630,plain,
    ( ~ ssList(u)
    | ~ neq(u,nil)
    | ~ segmentP(sk1,u) ),
    inference(mrr,[status(thm)],[7,33629]),
    [iquote('0:MRR:7.3,33629.2')] ).

cnf(33777,plain,
    ( ~ ssList(sk1)
    | ~ ssList(sk1)
    | ~ neq(sk1,nil) ),
    inference(res,[status(thm),theory(equality)],[72,33630]),
    [iquote('0:Res:72.1,33630.2')] ).

cnf(33778,plain,
    ( ~ ssList(sk1)
    | ~ neq(sk1,nil) ),
    inference(obv,[status(thm),theory(equality)],[33777]),
    [iquote('0:Obv:33777.0')] ).

cnf(33779,plain,
    ~ neq(sk1,nil),
    inference(ssi,[status(thm)],[33778,201,1]),
    [iquote('0:SSi:33778.0,201.0,1.0')] ).

cnf(39664,plain,
    ( ~ ssList(sk1)
    | ~ ssList(nil)
    | equal(nil,sk1) ),
    inference(res,[status(thm),theory(equality)],[115,33779]),
    [iquote('0:Res:115.3,33779.0')] ).

cnf(39665,plain,
    equal(nil,sk1),
    inference(ssi,[status(thm)],[39664,16,17,22,21,20,19,18,23,201,1]),
    [iquote('0:SSi:39664.1,39664.0,16.0,17.0,22.0,21.0,20.0,19.0,18.0,23.0,201.0,1.0')] ).

cnf(39666,plain,
    $false,
    inference(mrr,[status(thm)],[39665,207]),
    [iquote('0:MRR:39665.0,207.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWC076-1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n011.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jun 13 00:42:18 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 49.88/50.10  
% 49.88/50.10  SPASS V 3.9 
% 49.88/50.10  SPASS beiseite: Proof found.
% 49.88/50.10  % SZS status Theorem
% 49.88/50.10  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 49.88/50.10  SPASS derived 22944 clauses, backtracked 10894 clauses, performed 140 splits and kept 18163 clauses.
% 49.88/50.10  SPASS allocated 105791 KBytes.
% 49.88/50.10  SPASS spent	0:0:43.66 on the problem.
% 49.88/50.10  		0:00:00.04 for the input.
% 49.88/50.10  		0:00:00.00 for the FLOTTER CNF translation.
% 49.88/50.10  		0:00:00.41 for inferences.
% 49.88/50.10  		0:00:02.15 for the backtracking.
% 49.88/50.10  		0:0:40.58 for the reduction.
% 49.88/50.10  
% 49.88/50.10  
% 49.88/50.10  Here is a proof with depth 3, length 40 :
% 49.88/50.10  % SZS output start Refutation
% See solution above
% 49.88/50.10  Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 co1_14 co1_15 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause57 clause100 clause149 clause172
% 49.88/50.10  
%------------------------------------------------------------------------------