TSTP Solution File: SWC355-1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SWC355-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n015.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 : Tue Apr 30 20:45:28 EDT 2024

% Result   : Unsatisfiable 0.16s 0.58s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem  : SWC355-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.11  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31  % Computer : n015.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Tue Apr 30 00:22:32 EDT 2024
% 0.10/0.31  % CPUTime  : 
% 0.16/0.32  % Drodi V3.6.0
% 0.16/0.58  % Refutation found
% 0.16/0.58  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.16/0.58  % SZS output start CNFRefutation for theBenchmark
% 0.16/0.58  fof(f8,axiom,(
% 0.16/0.58    ssList(nil) ),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f29,axiom,(
% 0.16/0.58    (![U]: (ssList(skaf66(U)) ))),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f72,axiom,(
% 0.16/0.58    (![U,V]: (( ~ ssList(U)| duplicatefreeP(U)| ssItem(V) ) ))),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f74,axiom,(
% 0.16/0.58    (![U]: (( ~ ssList(U)| app(nil,U) = U ) ))),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f85,axiom,(
% 0.16/0.58    (![U,V]: (( ~ ssList(U)| ~ ssList(V)| ssList(app(V,U)) ) ))),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f86,axiom,(
% 0.16/0.58    (![U,V]: (( ~ ssItem(U)| ~ ssList(V)| ssList(cons(U,V)) ) ))),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f173,axiom,(
% 0.16/0.58    (![U,V,W,X]: (( app(app(U,V),W) != X| ~ ssList(W)| ~ ssList(U)| ~ ssList(V)| ~ ssList(X)| segmentP(X,V) ) ))),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f179,axiom,(
% 0.16/0.58    (![U,V,W,X,Y]: (( app(app(U,cons(V,W)),cons(V,X)) != Y| ~ ssList(X)| ~ ssList(W)| ~ ssList(U)| ~ ssItem(V)| ~ duplicatefreeP(Y)| ~ ssList(Y) ) ))),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f186,negated_conjecture,(
% 0.16/0.58    ssList(sk1) ),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f187,negated_conjecture,(
% 0.16/0.58    ssList(sk2) ),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f190,negated_conjecture,(
% 0.16/0.58    sk2 = sk4 ),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f191,negated_conjecture,(
% 0.16/0.58    sk1 = sk3 ),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f192,negated_conjecture,(
% 0.16/0.58    ( neq(sk2,nil)| neq(sk2,nil) ) ),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f197,negated_conjecture,(
% 0.16/0.58    ( ssItem(sk5)| ~ neq(sk4,nil) ) ),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f198,negated_conjecture,(
% 0.16/0.58    ( app(sk3,cons(sk5,nil)) = sk4| ~ neq(sk4,nil) ) ),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f199,negated_conjecture,(
% 0.16/0.58    ( ~ segmentP(sk2,sk1)| ~ neq(sk4,nil) ) ),
% 0.16/0.58    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.58  fof(f207,plain,(
% 0.16/0.58    ssList(nil)),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f8])).
% 0.16/0.58  fof(f228,plain,(
% 0.16/0.58    ![X0]: (ssList(skaf66(X0)))),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f29])).
% 0.16/0.58  fof(f271,plain,(
% 0.16/0.58    (![U]: (~ssList(U)|duplicatefreeP(U)))|(![V]: ssItem(V))),
% 0.16/0.58    inference(miniscoping,[status(esa)],[f72])).
% 0.16/0.58  fof(f272,plain,(
% 0.16/0.58    ![X0,X1]: (~ssList(X0)|duplicatefreeP(X0)|ssItem(X1))),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f271])).
% 0.16/0.58  fof(f274,plain,(
% 0.16/0.58    ![X0]: (~ssList(X0)|app(nil,X0)=X0)),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f74])).
% 0.16/0.58  fof(f285,plain,(
% 0.16/0.58    ![X0,X1]: (~ssList(X0)|~ssList(X1)|ssList(app(X1,X0)))),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f85])).
% 0.16/0.58  fof(f286,plain,(
% 0.16/0.58    ![X0,X1]: (~ssItem(X0)|~ssList(X1)|ssList(cons(X0,X1)))),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f86])).
% 0.16/0.58  fof(f405,plain,(
% 0.16/0.58    ![V,X]: ((((![U]: ((![W]: (~app(app(U,V),W)=X|~ssList(W)))|~ssList(U)))|~ssList(V))|~ssList(X))|segmentP(X,V))),
% 0.16/0.58    inference(miniscoping,[status(esa)],[f173])).
% 0.16/0.58  fof(f406,plain,(
% 0.16/0.58    ![X0,X1,X2,X3]: (~app(app(X0,X1),X2)=X3|~ssList(X2)|~ssList(X0)|~ssList(X1)|~ssList(X3)|segmentP(X3,X1))),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f405])).
% 0.16/0.58  fof(f416,plain,(
% 0.16/0.58    ![Y]: (((![V]: ((![U]: ((![W]: ((![X]: (~app(app(U,cons(V,W)),cons(V,X))=Y|~ssList(X)))|~ssList(W)))|~ssList(U)))|~ssItem(V)))|~duplicatefreeP(Y))|~ssList(Y))),
% 0.16/0.58    inference(miniscoping,[status(esa)],[f179])).
% 0.16/0.58  fof(f417,plain,(
% 0.16/0.58    ![X0,X1,X2,X3,X4]: (~app(app(X0,cons(X1,X2)),cons(X1,X3))=X4|~ssList(X3)|~ssList(X2)|~ssList(X0)|~ssItem(X1)|~duplicatefreeP(X4)|~ssList(X4))),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f416])).
% 0.16/0.58  fof(f430,plain,(
% 0.16/0.58    ssList(sk1)),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f186])).
% 0.16/0.58  fof(f431,plain,(
% 0.16/0.58    ssList(sk2)),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f187])).
% 0.16/0.58  fof(f434,plain,(
% 0.16/0.58    sk2=sk4),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f190])).
% 0.16/0.58  fof(f435,plain,(
% 0.16/0.58    sk1=sk3),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f191])).
% 0.16/0.58  fof(f436,plain,(
% 0.16/0.58    neq(sk2,nil)|neq(sk2,nil)),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f192])).
% 0.16/0.58  fof(f441,plain,(
% 0.16/0.58    ssItem(sk5)|~neq(sk4,nil)),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f197])).
% 0.16/0.58  fof(f442,plain,(
% 0.16/0.58    app(sk3,cons(sk5,nil))=sk4|~neq(sk4,nil)),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f198])).
% 0.16/0.58  fof(f443,plain,(
% 0.16/0.58    ~segmentP(sk2,sk1)|~neq(sk4,nil)),
% 0.16/0.58    inference(cnf_transformation,[status(esa)],[f199])).
% 0.16/0.58  fof(f444,plain,(
% 0.16/0.58    spl0_0 <=> ~ssList(X0)|duplicatefreeP(X0)),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f445,plain,(
% 0.16/0.58    ![X0]: (~ssList(X0)|duplicatefreeP(X0)|~spl0_0)),
% 0.16/0.58    inference(component_clause,[status(thm)],[f444])).
% 0.16/0.58  fof(f447,plain,(
% 0.16/0.58    spl0_1 <=> ssItem(X1)),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f448,plain,(
% 0.16/0.58    ![X0]: (ssItem(X0)|~spl0_1)),
% 0.16/0.58    inference(component_clause,[status(thm)],[f447])).
% 0.16/0.58  fof(f450,plain,(
% 0.16/0.58    spl0_0|spl0_1),
% 0.16/0.58    inference(split_clause,[status(thm)],[f272,f444,f447])).
% 0.16/0.58  fof(f451,plain,(
% 0.16/0.58    spl0_2 <=> neq(sk2,nil)),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f452,plain,(
% 0.16/0.58    neq(sk2,nil)|~spl0_2),
% 0.16/0.58    inference(component_clause,[status(thm)],[f451])).
% 0.16/0.58  fof(f454,plain,(
% 0.16/0.58    spl0_2),
% 0.16/0.58    inference(split_clause,[status(thm)],[f436,f451])).
% 0.16/0.58  fof(f455,plain,(
% 0.16/0.58    spl0_3 <=> neq(sk4,nil)),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f457,plain,(
% 0.16/0.58    ~neq(sk4,nil)|spl0_3),
% 0.16/0.58    inference(component_clause,[status(thm)],[f455])).
% 0.16/0.58  fof(f459,plain,(
% 0.16/0.58    spl0_4 <=> ssItem(sk5)),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f463,plain,(
% 0.16/0.58    spl0_5 <=> app(sk3,cons(sk5,nil))=sk4),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f464,plain,(
% 0.16/0.58    app(sk3,cons(sk5,nil))=sk4|~spl0_5),
% 0.16/0.58    inference(component_clause,[status(thm)],[f463])).
% 0.16/0.58  fof(f467,plain,(
% 0.16/0.58    spl0_6 <=> segmentP(sk2,sk1)),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f471,plain,(
% 0.16/0.58    spl0_4|~spl0_3),
% 0.16/0.58    inference(split_clause,[status(thm)],[f441,f459,f455])).
% 0.16/0.58  fof(f472,plain,(
% 0.16/0.58    spl0_5|~spl0_3),
% 0.16/0.58    inference(split_clause,[status(thm)],[f442,f463,f455])).
% 0.16/0.58  fof(f473,plain,(
% 0.16/0.58    ~spl0_6|~spl0_3),
% 0.16/0.58    inference(split_clause,[status(thm)],[f443,f467,f455])).
% 0.16/0.58  fof(f494,plain,(
% 0.16/0.58    ![X0,X1,X2]: (~ssList(X0)|~ssList(X1)|~ssList(X2)|~ssList(app(app(X1,X2),X0))|segmentP(app(app(X1,X2),X0),X2))),
% 0.16/0.58    inference(destructive_equality_resolution,[status(esa)],[f406])).
% 0.16/0.58  fof(f498,plain,(
% 0.16/0.58    ![X0,X1,X2,X3]: (~ssList(X0)|~ssList(X1)|~ssList(X2)|~ssItem(X3)|~duplicatefreeP(app(app(X2,cons(X3,X1)),cons(X3,X0)))|~ssList(app(app(X2,cons(X3,X1)),cons(X3,X0))))),
% 0.16/0.58    inference(destructive_equality_resolution,[status(esa)],[f417])).
% 0.16/0.58  fof(f505,plain,(
% 0.16/0.58    ~neq(sk2,nil)|spl0_3),
% 0.16/0.58    inference(forward_demodulation,[status(thm)],[f434,f457])).
% 0.16/0.58  fof(f506,plain,(
% 0.16/0.58    $false|spl0_3|~spl0_2),
% 0.16/0.58    inference(forward_subsumption_resolution,[status(thm)],[f452,f505])).
% 0.16/0.58  fof(f507,plain,(
% 0.16/0.58    spl0_3|~spl0_2),
% 0.16/0.58    inference(contradiction_clause,[status(thm)],[f506])).
% 0.16/0.58  fof(f510,plain,(
% 0.16/0.58    app(sk1,cons(sk5,nil))=sk4|~spl0_5),
% 0.16/0.58    inference(forward_demodulation,[status(thm)],[f435,f464])).
% 0.16/0.58  fof(f511,plain,(
% 0.16/0.58    app(sk1,cons(sk5,nil))=sk2|~spl0_5),
% 0.16/0.58    inference(forward_demodulation,[status(thm)],[f434,f510])).
% 0.16/0.58  fof(f512,plain,(
% 0.16/0.58    ![X0,X1,X2,X3]: (~ssList(X0)|~ssList(X1)|~ssList(X2)|~ssItem(X3)|~ssList(app(app(X2,cons(X3,X1)),cons(X3,X0)))|~spl0_0)),
% 0.16/0.58    inference(backward_subsumption_resolution,[status(thm)],[f498,f445])).
% 0.16/0.58  fof(f524,plain,(
% 0.16/0.58    app(nil,sk1)=sk1),
% 0.16/0.58    inference(resolution,[status(thm)],[f274,f430])).
% 0.16/0.58  fof(f525,plain,(
% 0.16/0.58    spl0_7 <=> ssList(nil)),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f527,plain,(
% 0.16/0.58    ~ssList(nil)|spl0_7),
% 0.16/0.58    inference(component_clause,[status(thm)],[f525])).
% 0.16/0.58  fof(f535,plain,(
% 0.16/0.58    $false|spl0_7),
% 0.16/0.58    inference(forward_subsumption_resolution,[status(thm)],[f527,f207])).
% 0.16/0.58  fof(f536,plain,(
% 0.16/0.58    spl0_7),
% 0.16/0.58    inference(contradiction_clause,[status(thm)],[f535])).
% 0.16/0.58  fof(f569,plain,(
% 0.16/0.58    spl0_10 <=> ssList(sk1)),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f571,plain,(
% 0.16/0.58    ~ssList(sk1)|spl0_10),
% 0.16/0.58    inference(component_clause,[status(thm)],[f569])).
% 0.16/0.58  fof(f574,plain,(
% 0.16/0.58    $false|spl0_10),
% 0.16/0.58    inference(forward_subsumption_resolution,[status(thm)],[f571,f430])).
% 0.16/0.58  fof(f575,plain,(
% 0.16/0.58    spl0_10),
% 0.16/0.58    inference(contradiction_clause,[status(thm)],[f574])).
% 0.16/0.58  fof(f690,plain,(
% 0.16/0.58    ![X0,X1,X2,X3]: (~ssList(cons(X0,X1))|~ssList(app(X2,cons(X0,X3)))|~ssList(X1)|~ssList(X3)|~ssList(X2)|~ssItem(X0)|~spl0_0)),
% 0.16/0.58    inference(resolution,[status(thm)],[f285,f512])).
% 0.16/0.58  fof(f691,plain,(
% 0.16/0.58    ![X0,X1,X2,X3]: (~ssList(app(X0,cons(X1,X2)))|~ssList(X3)|~ssList(X2)|~ssList(X0)|~ssItem(X1)|~spl0_0)),
% 0.16/0.58    inference(forward_subsumption_resolution,[status(thm)],[f690,f286])).
% 0.16/0.58  fof(f695,plain,(
% 0.16/0.58    spl0_14 <=> ssList(sk2)),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f697,plain,(
% 0.16/0.58    ~ssList(sk2)|spl0_14),
% 0.16/0.58    inference(component_clause,[status(thm)],[f695])).
% 0.16/0.58  fof(f712,plain,(
% 0.16/0.58    spl0_15 <=> ssList(cons(sk5,nil))),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f714,plain,(
% 0.16/0.58    ~ssList(cons(sk5,nil))|spl0_15),
% 0.16/0.58    inference(component_clause,[status(thm)],[f712])).
% 0.16/0.58  fof(f742,plain,(
% 0.16/0.58    $false|spl0_14),
% 0.16/0.58    inference(forward_subsumption_resolution,[status(thm)],[f697,f431])).
% 0.16/0.58  fof(f743,plain,(
% 0.16/0.58    spl0_14),
% 0.16/0.58    inference(contradiction_clause,[status(thm)],[f742])).
% 0.16/0.58  fof(f951,plain,(
% 0.16/0.58    ![X0,X1]: (~ssList(X0)|ssList(cons(X1,X0))|~spl0_1)),
% 0.16/0.58    inference(forward_subsumption_resolution,[status(thm)],[f286,f448])).
% 0.16/0.58  fof(f1022,plain,(
% 0.16/0.58    spl0_27 <=> ~ssList(X0)|~ssList(app(sk1,X0))|segmentP(app(app(nil,sk1),X0),sk1)),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f1023,plain,(
% 0.16/0.58    ![X0]: (~ssList(X0)|~ssList(app(sk1,X0))|segmentP(app(app(nil,sk1),X0),sk1)|~spl0_27)),
% 0.16/0.58    inference(component_clause,[status(thm)],[f1022])).
% 0.16/0.58  fof(f1025,plain,(
% 0.16/0.58    ![X0]: (~ssList(X0)|~ssList(nil)|~ssList(sk1)|~ssList(app(sk1,X0))|segmentP(app(app(nil,sk1),X0),sk1))),
% 0.16/0.58    inference(paramodulation,[status(thm)],[f524,f494])).
% 0.16/0.58  fof(f1026,plain,(
% 0.16/0.58    spl0_27|~spl0_7|~spl0_10),
% 0.16/0.58    inference(split_clause,[status(thm)],[f1025,f1022,f525,f569])).
% 0.16/0.58  fof(f1040,plain,(
% 0.16/0.58    ![X0]: (~ssList(X0)|~ssList(app(sk1,X0))|segmentP(app(sk1,X0),sk1)|~spl0_27)),
% 0.16/0.58    inference(forward_demodulation,[status(thm)],[f524,f1023])).
% 0.16/0.58  fof(f1150,plain,(
% 0.16/0.58    spl0_35 <=> ssList(app(sk1,cons(sk5,nil)))),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f1152,plain,(
% 0.16/0.58    ~ssList(app(sk1,cons(sk5,nil)))|spl0_35),
% 0.16/0.58    inference(component_clause,[status(thm)],[f1150])).
% 0.16/0.58  fof(f1153,plain,(
% 0.16/0.58    ~ssList(cons(sk5,nil))|~ssList(app(sk1,cons(sk5,nil)))|segmentP(sk2,sk1)|~spl0_27|~spl0_5),
% 0.16/0.58    inference(paramodulation,[status(thm)],[f511,f1040])).
% 0.16/0.58  fof(f1154,plain,(
% 0.16/0.58    ~spl0_15|~spl0_35|spl0_6|~spl0_27|~spl0_5),
% 0.16/0.58    inference(split_clause,[status(thm)],[f1153,f712,f1150,f467,f1022,f463])).
% 0.16/0.58  fof(f1160,plain,(
% 0.16/0.58    ~ssList(sk2)|~spl0_5|spl0_35),
% 0.16/0.58    inference(forward_demodulation,[status(thm)],[f511,f1152])).
% 0.16/0.58  fof(f1161,plain,(
% 0.16/0.58    $false|~spl0_5|spl0_35),
% 0.16/0.58    inference(forward_subsumption_resolution,[status(thm)],[f1160,f431])).
% 0.16/0.58  fof(f1162,plain,(
% 0.16/0.58    ~spl0_5|spl0_35),
% 0.16/0.58    inference(contradiction_clause,[status(thm)],[f1161])).
% 0.16/0.58  fof(f1182,plain,(
% 0.16/0.58    ~ssList(nil)|~spl0_1|spl0_15),
% 0.16/0.58    inference(resolution,[status(thm)],[f951,f714])).
% 0.16/0.58  fof(f1183,plain,(
% 0.16/0.58    ~spl0_7|~spl0_1|spl0_15),
% 0.16/0.58    inference(split_clause,[status(thm)],[f1182,f525,f447,f712])).
% 0.16/0.58  fof(f1190,plain,(
% 0.16/0.58    spl0_37 <=> ~ssList(app(X0,cons(X1,X2)))|~ssList(X2)|~ssList(X0)|~ssItem(X1)),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f1191,plain,(
% 0.16/0.58    ![X0,X1,X2]: (~ssList(app(X0,cons(X1,X2)))|~ssList(X2)|~ssList(X0)|~ssItem(X1)|~spl0_37)),
% 0.16/0.58    inference(component_clause,[status(thm)],[f1190])).
% 0.16/0.58  fof(f1193,plain,(
% 0.16/0.58    spl0_38 <=> ~ssList(X3)),
% 0.16/0.58    introduced(split_symbol_definition)).
% 0.16/0.58  fof(f1194,plain,(
% 0.16/0.58    ![X0]: (~ssList(X0)|~spl0_38)),
% 0.16/0.58    inference(component_clause,[status(thm)],[f1193])).
% 0.16/0.58  fof(f1196,plain,(
% 0.16/0.58    spl0_37|spl0_38|~spl0_0),
% 0.16/0.58    inference(split_clause,[status(thm)],[f691,f1190,f1193,f444])).
% 0.16/0.58  fof(f1210,plain,(
% 0.16/0.58    ~ssList(sk2)|~ssList(nil)|~ssList(sk1)|~ssItem(sk5)|~spl0_37|~spl0_5),
% 0.16/0.58    inference(paramodulation,[status(thm)],[f511,f1191])).
% 0.16/0.58  fof(f1211,plain,(
% 0.16/0.58    ~spl0_14|~spl0_7|~spl0_10|~spl0_4|~spl0_37|~spl0_5),
% 0.16/0.58    inference(split_clause,[status(thm)],[f1210,f695,f525,f569,f459,f1190,f463])).
% 0.16/0.58  fof(f1212,plain,(
% 0.16/0.58    $false|~spl0_38),
% 0.16/0.58    inference(backward_subsumption_resolution,[status(thm)],[f228,f1194])).
% 0.16/0.58  fof(f1213,plain,(
% 0.16/0.58    ~spl0_38),
% 0.16/0.58    inference(contradiction_clause,[status(thm)],[f1212])).
% 0.16/0.58  fof(f1214,plain,(
% 0.16/0.58    $false),
% 0.16/0.58    inference(sat_refutation,[status(thm)],[f450,f454,f471,f472,f473,f507,f536,f575,f743,f1026,f1154,f1162,f1183,f1196,f1211,f1213])).
% 0.16/0.58  % SZS output end CNFRefutation for theBenchmark.p
% 2.05/0.60  % Elapsed time: 0.284082 seconds
% 2.05/0.60  % CPU time: 2.085009 seconds
% 2.05/0.60  % Total memory used: 92.371 MB
% 2.05/0.60  % Net memory used: 89.764 MB
%------------------------------------------------------------------------------