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

View Problem - Process Solution

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

% Computer : n025.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:39 EDT 2022

% Result   : Unsatisfiable 27.45s 27.63s
% Output   : Refutation 27.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   25
% Syntax   : Number of clauses     :   50 (  26 unt;   1 nHn;  50 RR)
%            Number of literals    :  106 (   0 equ;  64 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    :   11 (  11 usr;  10 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

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

cnf(2,axiom,
    ssList(sk2),
    file('SWC092-1.p',unknown),
    [] ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(87,axiom,
    ( ~ ssList(u)
    | equal(app(nil,u),u) ),
    file('SWC092-1.p',unknown),
    [] ).

cnf(92,axiom,
    ( ~ ssList(u)
    | ~ equal(nil,u)
    | segmentP(nil,u) ),
    file('SWC092-1.p',unknown),
    [] ).

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

cnf(131,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ equal(app(u,v),nil)
    | equal(nil,u) ),
    file('SWC092-1.p',unknown),
    [] ).

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

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

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

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

cnf(203,plain,
    ( ~ equal(nil,sk1)
    | equal(nil,sk2) ),
    inference(rew,[status(thm),theory(equality)],[5,13,6]),
    [iquote('0:Rew:5.0,13.1,6.0,13.0')] ).

cnf(206,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)],[162,185]),
    [iquote('0:Rew:162.3,185.5')] ).

cnf(435,plain,
    ( ~ neq(sk2,nil)
    | ~ segmentP(sk2,sk2)
    | ~ segmentP(sk1,sk2) ),
    inference(res,[status(thm),theory(equality)],[2,8]),
    [iquote('0:Res:2.0,8.0')] ).

cnf(452,plain,
    ( ~ equal(nil,sk2)
    | segmentP(nil,sk2) ),
    inference(res,[status(thm),theory(equality)],[2,92]),
    [iquote('0:Res:2.0,92.0')] ).

cnf(464,plain,
    equal(app(nil,sk2),sk2),
    inference(res,[status(thm),theory(equality)],[2,87]),
    [iquote('0:Res:2.0,87.0')] ).

cnf(467,plain,
    segmentP(sk2,sk2),
    inference(res,[status(thm),theory(equality)],[2,70]),
    [iquote('0:Res:2.0,70.0')] ).

cnf(557,plain,
    ~ segmentP(sk1,sk2),
    inference(mrr,[status(thm)],[435,7,467]),
    [iquote('0:MRR:435.0,435.1,7.0,467.0')] ).

cnf(2357,plain,
    ( ~ ssList(sk1)
    | ~ ssList(sk5)
    | ~ equal(nil,sk2)
    | equal(nil,sk1) ),
    inference(spl,[status(thm),theory(equality)],[202,131]),
    [iquote('0:SpL:202.0,131.2')] ).

cnf(5691,plain,
    ( ~ ssList(sk1)
    | ~ ssList(u)
    | ~ ssList(v)
    | ~ ssList(sk5)
    | ~ segmentP(sk1,u)
    | segmentP(app(v,sk2),u) ),
    inference(spr,[status(thm),theory(equality)],[202,206]),
    [iquote('0:SpR:202.0,206.5')] ).

cnf(26517,plain,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ segmentP(sk1,u)
    | segmentP(app(v,sk2),u) ),
    inference(ssi,[status(thm)],[5691,9,199,1]),
    [iquote('0:SSi:5691.3,5691.0,9.0,199.0,1.0')] ).

cnf(28142,plain,
    ( ~ ssList(u)
    | ~ ssList(nil)
    | ~ segmentP(sk1,u)
    | segmentP(sk2,u) ),
    inference(spr,[status(thm),theory(equality)],[464,26517]),
    [iquote('0:SpR:464.0,26517.3')] ).

cnf(28161,plain,
    ( ~ ssList(u)
    | ~ segmentP(sk1,u)
    | segmentP(sk2,u) ),
    inference(ssi,[status(thm)],[28142,21,20,19,18,17,16,15,14]),
    [iquote('0:SSi:28142.1,21.0,20.0,19.0,18.0,17.0,16.0,15.0,14.0')] ).

cnf(28162,plain,
    ( ~ ssList(u)
    | ~ neq(u,nil)
    | ~ segmentP(sk1,u) ),
    inference(mrr,[status(thm)],[8,28161]),
    [iquote('0:MRR:8.3,28161.2')] ).

cnf(28203,plain,
    ( ~ ssList(sk1)
    | ~ ssList(sk1)
    | ~ neq(sk1,nil) ),
    inference(res,[status(thm),theory(equality)],[70,28162]),
    [iquote('0:Res:70.1,28162.2')] ).

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

cnf(28206,plain,
    ~ neq(sk1,nil),
    inference(ssi,[status(thm)],[28205,199,1]),
    [iquote('0:SSi:28205.0,199.0,1.0')] ).

cnf(28214,plain,
    ( ~ equal(nil,sk2)
    | equal(nil,sk1) ),
    inference(ssi,[status(thm)],[2357,9,199,1]),
    [iquote('0:SSi:2357.1,2357.0,9.0,199.0,1.0')] ).

cnf(28218,plain,
    ( ~ equal(nil,sk2)
    | segmentP(sk1,sk2) ),
    inference(rew,[status(thm),theory(equality)],[28214,452]),
    [iquote('0:Rew:28214.1,452.1')] ).

cnf(28219,plain,
    ~ equal(nil,sk2),
    inference(mrr,[status(thm)],[28218,557]),
    [iquote('0:MRR:28218.1,557.0')] ).

cnf(28225,plain,
    ~ equal(nil,sk1),
    inference(mrr,[status(thm)],[203,28219]),
    [iquote('0:MRR:203.1,28219.0')] ).

cnf(32867,plain,
    ( ~ ssList(sk1)
    | ~ ssList(nil)
    | equal(nil,sk1) ),
    inference(res,[status(thm),theory(equality)],[113,28206]),
    [iquote('0:Res:113.3,28206.0')] ).

cnf(32868,plain,
    equal(nil,sk1),
    inference(ssi,[status(thm)],[32867,21,20,19,18,17,16,15,14,199,1]),
    [iquote('0:SSi:32867.1,32867.0,21.0,20.0,19.0,18.0,17.0,16.0,15.0,14.0,199.0,1.0')] ).

cnf(32869,plain,
    $false,
    inference(mrr,[status(thm)],[32868,28225]),
    [iquote('0:MRR:32868.0,28225.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWC092-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n025.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 : Sat Jun 11 20:12:52 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 27.45/27.63  
% 27.45/27.63  SPASS V 3.9 
% 27.45/27.63  SPASS beiseite: Proof found.
% 27.45/27.63  % SZS status Theorem
% 27.45/27.63  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 27.45/27.63  SPASS derived 20257 clauses, backtracked 9677 clauses, performed 117 splits and kept 15740 clauses.
% 27.45/27.63  SPASS allocated 99390 KBytes.
% 27.45/27.63  SPASS spent	0:0:23.71 on the problem.
% 27.45/27.63  		0:00:00.04 for the input.
% 27.45/27.63  		0:00:00.00 for the FLOTTER CNF translation.
% 27.45/27.63  		0:00:00.27 for inferences.
% 27.45/27.63  		0:00:01.04 for the backtracking.
% 27.45/27.63  		0:0:22.03 for the reduction.
% 27.45/27.63  
% 27.45/27.63  
% 27.45/27.63  Here is a proof with depth 2, length 50 :
% 27.45/27.63  % SZS output start Refutation
% See solution above
% 27.45/27.63  Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 co1_13 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause57 clause74 clause79 clause100 clause118 clause149 clause172
% 27.45/27.63  
%------------------------------------------------------------------------------