TSTP Solution File: SWC007-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWC007-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n003.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  : 300s
% DateTime : Thu Aug 31 20:19:01 EDT 2023

% Result   : Unsatisfiable 0.18s 0.58s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   80
% Syntax   : Number of formulae    :   94 (  11 unt;  72 typ;   0 def)
%            Number of atoms       :   48 (  24 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   57 (  31   ~;  26   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   82 (  65   >;  17   *;   0   +;   0  <<)
%            Number of predicates  :   21 (  19 usr;   1 prp; 0-2 aty)
%            Number of functors    :   53 (  53 usr;   7 con; 0-2 aty)
%            Number of variables   :   19 (   0 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    nil: $i ).

tff(decl_23,type,
    equalelemsP: $i > $o ).

tff(decl_24,type,
    duplicatefreeP: $i > $o ).

tff(decl_25,type,
    strictorderedP: $i > $o ).

tff(decl_26,type,
    totalorderedP: $i > $o ).

tff(decl_27,type,
    strictorderP: $i > $o ).

tff(decl_28,type,
    totalorderP: $i > $o ).

tff(decl_29,type,
    cyclefreeP: $i > $o ).

tff(decl_30,type,
    ssList: $i > $o ).

tff(decl_31,type,
    skac3: $i ).

tff(decl_32,type,
    ssItem: $i > $o ).

tff(decl_33,type,
    skac2: $i ).

tff(decl_34,type,
    singletonP: $i > $o ).

tff(decl_35,type,
    skaf83: $i > $i ).

tff(decl_36,type,
    skaf82: $i > $i ).

tff(decl_37,type,
    skaf81: $i > $i ).

tff(decl_38,type,
    skaf80: $i > $i ).

tff(decl_39,type,
    skaf79: $i > $i ).

tff(decl_40,type,
    skaf78: $i > $i ).

tff(decl_41,type,
    skaf77: $i > $i ).

tff(decl_42,type,
    skaf76: $i > $i ).

tff(decl_43,type,
    skaf75: $i > $i ).

tff(decl_44,type,
    skaf74: $i > $i ).

tff(decl_45,type,
    skaf73: $i > $i ).

tff(decl_46,type,
    skaf72: $i > $i ).

tff(decl_47,type,
    skaf71: $i > $i ).

tff(decl_48,type,
    skaf70: $i > $i ).

tff(decl_49,type,
    skaf69: $i > $i ).

tff(decl_50,type,
    skaf68: $i > $i ).

tff(decl_51,type,
    skaf67: $i > $i ).

tff(decl_52,type,
    skaf66: $i > $i ).

tff(decl_53,type,
    skaf65: $i > $i ).

tff(decl_54,type,
    skaf64: $i > $i ).

tff(decl_55,type,
    skaf63: $i > $i ).

tff(decl_56,type,
    skaf62: $i > $i ).

tff(decl_57,type,
    skaf61: $i > $i ).

tff(decl_58,type,
    skaf60: $i > $i ).

tff(decl_59,type,
    skaf59: $i > $i ).

tff(decl_60,type,
    skaf58: $i > $i ).

tff(decl_61,type,
    skaf57: $i > $i ).

tff(decl_62,type,
    skaf56: $i > $i ).

tff(decl_63,type,
    skaf55: $i > $i ).

tff(decl_64,type,
    skaf54: $i > $i ).

tff(decl_65,type,
    skaf53: $i > $i ).

tff(decl_66,type,
    skaf52: $i > $i ).

tff(decl_67,type,
    skaf51: $i > $i ).

tff(decl_68,type,
    skaf50: $i > $i ).

tff(decl_69,type,
    skaf49: $i > $i ).

tff(decl_70,type,
    skaf44: $i > $i ).

tff(decl_71,type,
    skaf48: ( $i * $i ) > $i ).

tff(decl_72,type,
    skaf47: ( $i * $i ) > $i ).

tff(decl_73,type,
    skaf46: ( $i * $i ) > $i ).

tff(decl_74,type,
    skaf45: ( $i * $i ) > $i ).

tff(decl_75,type,
    skaf43: ( $i * $i ) > $i ).

tff(decl_76,type,
    skaf42: ( $i * $i ) > $i ).

tff(decl_77,type,
    geq: ( $i * $i ) > $o ).

tff(decl_78,type,
    segmentP: ( $i * $i ) > $o ).

tff(decl_79,type,
    rearsegP: ( $i * $i ) > $o ).

tff(decl_80,type,
    frontsegP: ( $i * $i ) > $o ).

tff(decl_81,type,
    leq: ( $i * $i ) > $o ).

tff(decl_82,type,
    lt: ( $i * $i ) > $o ).

tff(decl_83,type,
    cons: ( $i * $i ) > $i ).

tff(decl_84,type,
    memberP: ( $i * $i ) > $o ).

tff(decl_85,type,
    app: ( $i * $i ) > $i ).

tff(decl_86,type,
    tl: $i > $i ).

tff(decl_87,type,
    hd: $i > $i ).

tff(decl_88,type,
    neq: ( $i * $i ) > $o ).

tff(decl_89,type,
    gt: ( $i * $i ) > $o ).

tff(decl_90,type,
    sk1: $i ).

tff(decl_91,type,
    sk2: $i ).

tff(decl_92,type,
    sk3: $i ).

tff(decl_93,type,
    sk4: $i ).

cnf(co1_7,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

cnf(co1_5,negated_conjecture,
    nil = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).

cnf(co1_8,negated_conjecture,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(app(X1,X2),X3) != sk2
    | app(X1,X3) != sk1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

cnf(clause145,axiom,
    ( app(X1,X2) = nil
    | nil != X1
    | nil != X2
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause145) ).

cnf(clause8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).

cnf(clause74,axiom,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).

cnf(clause73,axiom,
    ( app(X1,nil) = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).

cnf(co1_2,negated_conjecture,
    ssList(sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).

cnf(c_0_8,negated_conjecture,
    sk1 = sk3,
    co1_7 ).

cnf(c_0_9,negated_conjecture,
    nil = sk3,
    co1_5 ).

cnf(c_0_10,negated_conjecture,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(app(X1,X2),X3) != sk2
    | app(X1,X3) != sk1 ),
    co1_8 ).

cnf(c_0_11,negated_conjecture,
    sk1 = nil,
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,axiom,
    ( app(X1,X2) = nil
    | nil != X1
    | nil != X2
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    clause145 ).

cnf(c_0_13,axiom,
    ssList(nil),
    clause8 ).

cnf(c_0_14,negated_conjecture,
    ( app(app(X1,X2),X3) != sk2
    | app(X1,X3) != nil
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    app(nil,nil) = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_12])]),c_0_13])]) ).

cnf(c_0_16,negated_conjecture,
    ( app(app(nil,X1),nil) != sk2
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13])]) ).

cnf(c_0_17,axiom,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    clause74 ).

cnf(c_0_18,negated_conjecture,
    ( app(X1,nil) != sk2
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_19,axiom,
    ( app(X1,nil) = X1
    | ~ ssList(X1) ),
    clause73 ).

cnf(c_0_20,negated_conjecture,
    ssList(sk2),
    co1_2 ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19])]),c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : SWC007-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n003.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    : 300
% 0.12/0.33  % DateTime   : Mon Aug 28 16:36:10 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 0.18/0.54  start to proof: theBenchmark
% 0.18/0.58  % Version  : CSE_E---1.5
% 0.18/0.58  % Problem  : theBenchmark.p
% 0.18/0.58  % Proof found
% 0.18/0.58  % SZS status Theorem for theBenchmark.p
% 0.18/0.58  % SZS output start Proof
% See solution above
% 0.18/0.58  % Total time : 0.024000 s
% 0.18/0.58  % SZS output end Proof
% 0.18/0.58  % Total time : 0.030000 s
%------------------------------------------------------------------------------