TSTP Solution File: SYN797-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SYN797-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n004.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 20:19:31 EDT 2023

% Result   : Timeout 1.19s 300.20s
% Output   : None 
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named clause10)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_49,negated_conjecture,
    ( ssPv4(X1)
    | ssPv2(X3)
    | ssPv1(X2)
    | ssPv2(X2)
    | ~ ssRr(X1,X2)
    | ~ ssRr(X2,X3) ),
    clause10,
    [final] ).

cnf(c_0_50,negated_conjecture,
    ssRr(X1,skf2(X1)),
    clause2,
    [final] ).

cnf(c_0_52,negated_conjecture,
    ( ~ ssPv3(X1)
    | ~ ssPv2(X2)
    | ~ ssPv4(X2)
    | ~ ssRr(X2,X1) ),
    inference(csr,[status(thm)],[c_0_47,c_0_48]),
    [final] ).

cnf(c_0_57,negated_conjecture,
    ssRr(skf3(X1),X1),
    clause1,
    [final] ).

cnf(c_0_60,negated_conjecture,
    ( ssPv2(X1)
    | ssPv1(X2)
    | ssPv4(X2)
    | ~ ssRr(X1,X2)
    | ~ ssPv2(X2) ),
    clause5,
    [final] ).

cnf(c_0_61,negated_conjecture,
    ( ssPv1(X1)
    | ssPv2(skf2(X1))
    | ssPv2(X1)
    | ssPv4(X2)
    | ~ ssRr(X2,X1) ),
    inference(spm,[status(thm)],[c_0_49,c_0_50]),
    [final] ).

cnf(c_0_62,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssPv3(X2)
    | ~ ssPv2(X3)
    | ~ ssRr(X3,X2)
    | ~ ssRr(X1,X3) ),
    inference(csr,[status(thm)],[c_0_51,c_0_52]),
    [final] ).

cnf(c_0_71,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssPv3(skf2(X2))
    | ~ ssPv2(X2)
    | ~ ssRr(X1,X2) ),
    inference(spm,[status(thm)],[c_0_62,c_0_50]),
    [final] ).

cnf(c_0_74,negated_conjecture,
    ( ssPv1(X1)
    | ssPv2(skf3(X1))
    | ssPv4(X1)
    | ~ ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_60,c_0_57]),
    [final] ).

cnf(c_0_89,negated_conjecture,
    ( ~ ssPv3(skf2(X1))
    | ~ ssPv2(X1)
    | ~ ssPv4(X1) ),
    inference(spm,[status(thm)],[c_0_52,c_0_50]),
    [final] ).

cnf(c_0_140,negated_conjecture,
    ( ssPv4(X2)
    | ssPv2(X3)
    | ssPv1(X1)
    | ~ ssRr(X1,X2)
    | ~ ssRr(X1,X3)
    | ~ ssPv4(X1) ),
    clause14,
    [final] ).

cnf(c_0_143,negated_conjecture,
    ( ssPv3(X1)
    | ssPv4(X3)
    | ~ ssRr(X1,X2)
    | ~ ssRr(X2,X3)
    | ~ ssPv2(X2)
    | ~ ssPv4(X2) ),
    clause18,
    [final] ).

cnf(c_0_144,negated_conjecture,
    ( ssPv1(X1)
    | ssPv2(skf2(X1))
    | ssPv4(X2)
    | ~ ssPv4(X1)
    | ~ ssRr(X1,X2) ),
    inference(spm,[status(thm)],[c_0_140,c_0_50]),
    [final] ).

cnf(c_0_145,negated_conjecture,
    ( ssPv1(X2)
    | ssPv4(X2)
    | ~ ssRr(X1,X2)
    | ~ ssPv3(X1)
    | ~ ssRr(X2,X3)
    | ~ ssPv4(X3) ),
    clause28,
    [final] ).

cnf(c_0_150,negated_conjecture,
    ( ssPv1(skf3(X1))
    | ssPv2(skf2(skf3(X1)))
    | ssPv4(X1)
    | ~ ssPv4(skf3(X1)) ),
    inference(spm,[status(thm)],[c_0_144,c_0_57]),
    [final] ).

cnf(c_0_151,negated_conjecture,
    ( ssPv1(X1)
    | ssPv4(X1)
    | ~ ssPv3(X2)
    | ~ ssPv4(skf2(X1))
    | ~ ssRr(X2,X1) ),
    inference(spm,[status(thm)],[c_0_145,c_0_50]),
    [final] ).

cnf(c_0_153,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssPv3(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_147]),c_0_130]),
    [final] ).

cnf(c_0_156,negated_conjecture,
    ( ssPv1(skf3(X1))
    | ssPv2(X1)
    | ssPv4(X2)
    | ~ ssPv4(skf3(X1))
    | ~ ssRr(skf3(X1),X2) ),
    inference(spm,[status(thm)],[c_0_140,c_0_57]),
    [final] ).

cnf(c_0_179,negated_conjecture,
    ( ssPv4(X3)
    | ~ ssRr(X1,X2)
    | ~ ssPv3(X1)
    | ~ ssRr(X3,X2)
    | ~ ssRr(X2,X4)
    | ~ ssPv4(X4)
    | ~ ssPv2(X2) ),
    clause51,
    [final] ).

cnf(c_0_182,negated_conjecture,
    ( ssPv3(X1)
    | ssPv2(X3)
    | ssPv1(X2)
    | ~ ssRr(X1,X2)
    | ~ ssRr(X2,X3)
    | ~ ssPv3(X2) ),
    clause15,
    [final] ).

cnf(c_0_183,negated_conjecture,
    ( ssPv1(X2)
    | ~ ssRr(X1,X2)
    | ~ ssPv3(X1)
    | ~ ssRr(X2,X3)
    | ~ ssPv2(X3)
    | ~ ssPv3(X2) ),
    clause40,
    [final] ).

cnf(c_0_188,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssPv3(X2)
    | ~ ssPv2(skf2(X1))
    | ~ ssPv4(X3)
    | ~ ssRr(skf2(X1),X3)
    | ~ ssRr(X2,skf2(X1)) ),
    inference(spm,[status(thm)],[c_0_179,c_0_50]),
    [final] ).

cnf(c_0_192,negated_conjecture,
    ( ssPv1(X3)
    | ssPv3(X2)
    | ~ ssRr(X1,X2)
    | ~ ssPv3(X1)
    | ~ ssRr(X3,X2)
    | ~ ssPv2(X2) ),
    clause26,
    [final] ).

cnf(c_0_193,negated_conjecture,
    ( ssPv1(X1)
    | ssPv3(X2)
    | ssPv2(skf2(X1))
    | ~ ssPv3(X1)
    | ~ ssRr(X2,X1) ),
    inference(spm,[status(thm)],[c_0_182,c_0_50]),
    [final] ).

cnf(c_0_196,negated_conjecture,
    ( ssPv3(X1)
    | ssPv1(X3)
    | ssPv2(X2)
    | ~ ssRr(X1,X2)
    | ~ ssRr(X2,X3)
    | ~ ssPv3(X2) ),
    clause11,
    [final] ).

cnf(c_0_200,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssPv3(X2)
    | ~ ssPv2(skf2(X1))
    | ~ ssPv4(skf2(skf2(X1)))
    | ~ ssRr(X2,skf2(X1)) ),
    inference(spm,[status(thm)],[c_0_188,c_0_50]),
    [final] ).

cnf(c_0_205,negated_conjecture,
    ( ssPv1(X1)
    | ssPv3(skf2(X1))
    | ~ ssPv3(X2)
    | ~ ssPv2(skf2(X1))
    | ~ ssRr(X2,skf2(X1)) ),
    inference(spm,[status(thm)],[c_0_192,c_0_50]),
    [final] ).

cnf(c_0_208,negated_conjecture,
    ( ssPv1(skf2(X1))
    | ssPv3(X2)
    | ssPv2(X1)
    | ~ ssPv3(X1)
    | ~ ssRr(X2,X1) ),
    inference(spm,[status(thm)],[c_0_196,c_0_50]),
    [final] ).

cnf(c_0_242,negated_conjecture,
    ( ssPv1(X1)
    | ssPv3(X2)
    | ssPv2(skf3(X1))
    | ~ ssPv3(skf3(X1))
    | ~ ssRr(X2,skf3(X1)) ),
    inference(spm,[status(thm)],[c_0_196,c_0_57]),
    [final] ).

cnf(c_0_245,negated_conjecture,
    ( ssPv3(X3)
    | ssPv1(X4)
    | ssPv4(X2)
    | ~ ssRr(X1,X2)
    | ~ ssPv4(X1)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X4) ),
    clause44,
    [final] ).

cnf(c_0_253,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssPv3(skf2(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_240]),c_0_247]),
    [final] ).

cnf(c_0_256,negated_conjecture,
    ( ssPv1(skf3(X1))
    | ~ ssPv3(skf3(X1))
    | ~ ssPv2(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_249]),c_0_250]),c_0_251]),
    [final] ).

cnf(c_0_257,negated_conjecture,
    ( ssPv2(X3)
    | ssPv1(X1)
    | ssPv4(X1)
    | ~ ssRr(X1,X2)
    | ~ ssPv4(X2)
    | ~ ssRr(X1,X3) ),
    clause16,
    [final] ).

cnf(c_0_258,negated_conjecture,
    ( ssPv1(skf2(X1))
    | ssPv4(X1)
    | ~ ssPv4(X2)
    | ~ ssRr(X2,X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_50]),c_0_253]),
    [final] ).

cnf(c_0_262,negated_conjecture,
    ( ssPv1(X1)
    | ssPv2(skf2(X1))
    | ssPv4(X1)
    | ~ ssPv4(X2)
    | ~ ssRr(X1,X2) ),
    inference(spm,[status(thm)],[c_0_257,c_0_50]),
    [final] ).

cnf(c_0_263,negated_conjecture,
    ( ssPv1(skf2(X1))
    | ssPv4(X1)
    | ~ ssPv4(skf3(X1)) ),
    inference(spm,[status(thm)],[c_0_258,c_0_57]),
    [final] ).

cnf(c_0_265,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssPv2(skf3(X1))
    | ~ ssPv4(skf3(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_260,c_0_261]),c_0_251]),
    [final] ).

cnf(c_0_266,negated_conjecture,
    ( ssPv1(X1)
    | ssPv2(skf2(X1))
    | ssPv4(X1)
    | ~ ssPv4(skf2(X1)) ),
    inference(spm,[status(thm)],[c_0_262,c_0_50]),
    [final] ).

cnf(c_0_269,negated_conjecture,
    ( ssPv2(X3)
    | ssPv1(X2)
    | ssPv3(X2)
    | ~ ssRr(X1,X2)
    | ~ ssPv2(X1)
    | ~ ssRr(X2,X3) ),
    clause17,
    [final] ).

cnf(c_0_270,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssPv2(X1)
    | ~ ssPv4(skf3(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_265,c_0_74]),c_0_251]),
    [final] ).

cnf(c_0_273,negated_conjecture,
    ( ssPv1(X1)
    | ssPv3(X1)
    | ssPv2(skf2(X1))
    | ~ ssPv2(X2)
    | ~ ssRr(X2,X1) ),
    inference(spm,[status(thm)],[c_0_269,c_0_50]),
    [final] ).

cnf(c_0_277,negated_conjecture,
    ( ssPv1(X1)
    | ssPv3(X1)
    | ssPv2(skf2(X1))
    | ~ ssPv2(skf3(X1)) ),
    inference(spm,[status(thm)],[c_0_273,c_0_57]),
    [final] ).

cnf(c_0_296,negated_conjecture,
    ( ~ ssPv3(X1)
    | ~ ssPv3(X2)
    | ~ ssPv2(X3)
    | ~ ssRr(X3,X1)
    | ~ ssRr(X2,X3) ),
    inference(csr,[status(thm)],[c_0_289,c_0_52]),
    [final] ).

cnf(c_0_300,negated_conjecture,
    ( ssPv2(X1)
    | ssPv4(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_295,c_0_50]),c_0_272]),
    [final] ).

cnf(c_0_301,negated_conjecture,
    ( ~ ssPv3(skf2(X1))
    | ~ ssPv3(X2)
    | ~ ssPv2(X1)
    | ~ ssRr(X2,X1) ),
    inference(spm,[status(thm)],[c_0_296,c_0_50]),
    [final] ).

cnf(c_0_307,negated_conjecture,
    ( ssPv4(skf2(X1))
    | ~ ssPv4(X1) ),
    inference(spm,[status(thm)],[c_0_299,c_0_300]),
    [final] ).

cnf(c_0_323,negated_conjecture,
    ( ssPv3(X1)
    | ~ ssPv3(skf2(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_313]),c_0_298]),
    [final] ).

cnf(c_0_348,negated_conjecture,
    ( ssPv1(X1)
    | ssPv3(skf2(X1))
    | ~ ssPv3(skf3(skf2(X1)))
    | ~ ssPv2(skf2(X1)) ),
    inference(spm,[status(thm)],[c_0_205,c_0_57]),
    [final] ).

cnf(c_0_349,negated_conjecture,
    ( ~ ssPv3(X1)
    | ~ ssPv2(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_343,c_0_198]),c_0_153]),c_0_344]),c_0_333]),
    [final] ).

cnf(c_0_353,negated_conjecture,
    ( ssPv1(skf3(X1))
    | ssPv3(X1)
    | ~ ssPv3(X2)
    | ~ ssPv2(X1)
    | ~ ssRr(X2,X1) ),
    inference(spm,[status(thm)],[c_0_192,c_0_57]),
    [final] ).

cnf(c_0_356,negated_conjecture,
    ( ssPv1(skf3(X1))
    | ssPv3(skf3(X1))
    | ssPv2(X1)
    | ~ ssPv2(X2)
    | ~ ssRr(X2,skf3(X1)) ),
    inference(spm,[status(thm)],[c_0_269,c_0_57]),
    [final] ).

cnf(c_0_357,negated_conjecture,
    ( ~ ssPv3(X1)
    | ~ ssPv2(skf3(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_270,c_0_102]),c_0_73]),
    [final] ).

cnf(c_0_358,negated_conjecture,
    ~ ssPv1(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_351,c_0_352]),c_0_342]),
    [final] ).

cnf(c_0_364,negated_conjecture,
    ( ssPv1(X1)
    | ssPv4(X1)
    | ~ ssPv3(X2)
    | ~ ssPv4(skf2(X1))
    | ~ ssRr(X2,skf2(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_200,c_0_354]),c_0_266]),
    [final] ).

cnf(c_0_366,negated_conjecture,
    ( ssPv4(X3)
    | ssPv2(X2)
    | ssPv3(X2)
    | ~ ssRr(X1,X2)
    | ~ ssPv3(X1)
    | ~ ssRr(X2,X3) ),
    clause13,
    [final] ).

cnf(c_0_367,negated_conjecture,
    ( ssPv1(skf3(X1))
    | ssPv3(skf3(X1))
    | ssPv2(X1)
    | ~ ssPv2(skf3(skf3(X1))) ),
    inference(spm,[status(thm)],[c_0_356,c_0_57]),
    [final] ).

cnf(c_0_368,negated_conjecture,
    ( ssPv4(skf3(X1))
    | ~ ssPv3(X1) ),
    inference(spm,[status(thm)],[c_0_357,c_0_300]),
    [final] ).

cnf(c_0_369,negated_conjecture,
    ( ~ ssPv3(X1)
    | ~ ssPv2(skf2(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_358,c_0_359]),c_0_349]),
    [final] ).

cnf(c_0_376,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssPv3(X2)
    | ~ ssPv2(skf2(X1))
    | ~ ssPv4(skf2(X1))
    | ~ ssRr(X2,skf2(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_200,c_0_276]),c_0_153]),
    [final] ).

cnf(c_0_377,negated_conjecture,
    ( ssPv1(X1)
    | ssPv4(skf3(X1))
    | ~ ssPv4(X2)
    | ~ ssRr(X2,skf3(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_363,c_0_50]),c_0_253]),
    [final] ).

cnf(c_0_378,negated_conjecture,
    ( ssPv4(skf3(X1))
    | ~ ssPv3(X2)
    | ~ ssPv2(X1)
    | ~ ssPv4(X3)
    | ~ ssRr(X1,X3)
    | ~ ssRr(X2,X1) ),
    inference(spm,[status(thm)],[c_0_179,c_0_57]),
    [final] ).

cnf(c_0_379,negated_conjecture,
    ( ssPv1(X1)
    | ssPv4(X1)
    | ~ ssPv3(skf3(skf2(X1)))
    | ~ ssPv4(skf2(X1)) ),
    inference(spm,[status(thm)],[c_0_364,c_0_57]),
    [final] ).

cnf(c_0_380,negated_conjecture,
    ( ssPv3(skf3(X1))
    | ~ ssPv3(skf2(X1)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_349,c_0_206]),c_0_323]),c_0_365]),
    [final] ).

cnf(c_0_381,negated_conjecture,
    ( ssPv3(skf3(X1))
    | ssPv2(skf3(X1))
    | ssPv4(X1)
    | ~ ssPv3(X2)
    | ~ ssRr(X2,skf3(X1)) ),
    inference(spm,[status(thm)],[c_0_366,c_0_57]),
    [final] ).

cnf(c_0_382,negated_conjecture,
    ( ssPv2(X1)
    | ssPv4(skf3(skf3(X1))) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_367,c_0_300]),c_0_358]),c_0_368]),
    [final] ).

cnf(c_0_383,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssPv3(skf3(X1)) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_369,c_0_150]),c_0_358]),c_0_153]),
    [final] ).

cnf(c_0_384,negated_conjecture,
    ( ssPv3(skf3(X1))
    | ~ ssPv3(X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_369,c_0_206]),c_0_358]),
    [final] ).

cnf(c_0_385,negated_conjecture,
    ( ssPv2(X1)
    | ssPv4(skf2(X1)) ),
    inference(sr,[status(thm)],[c_0_370,c_0_358]),
    [final] ).

cnf(c_0_386,negated_conjecture,
    ( ssPv2(skf2(skf2(X1)))
    | ssPv2(skf2(X1))
    | ssPv4(X1) ),
    inference(sr,[status(thm)],[c_0_134,c_0_358]),
    [final] ).

cnf(c_0_387,negated_conjecture,
    ( ssPv2(X1)
    | ssPv4(skf3(X1)) ),
    inference(sr,[status(thm)],[c_0_371,c_0_358]),
    [final] ).

cnf(c_0_388,negated_conjecture,
    ( ssPv2(skf2(X1))
    | ssPv4(skf3(X1)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_277,c_0_300]),c_0_368]),c_0_372]),
    [final] ).

cnf(c_0_389,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssPv3(X2)
    | ~ ssRr(X1,X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_373,c_0_50]),c_0_253]),c_0_374]),
    [final] ).

cnf(c_0_390,negated_conjecture,
    ( ssPv4(skf2(X1))
    | ~ ssPv3(X1) ),
    inference(spm,[status(thm)],[c_0_375,c_0_300]),
    [final] ).

cnf(c_0_391,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssPv3(skf3(skf2(X1)))
    | ~ ssPv2(skf2(X1))
    | ~ ssPv4(skf2(X1)) ),
    inference(spm,[status(thm)],[c_0_376,c_0_57]),
    [final] ).

cnf(c_0_392,negated_conjecture,
    ( ssPv1(X1)
    | ssPv4(skf3(X1))
    | ~ ssPv4(skf3(skf3(X1))) ),
    inference(spm,[status(thm)],[c_0_377,c_0_57]),
    [final] ).

cnf(c_0_393,negated_conjecture,
    ( ssPv4(skf3(skf3(X1)))
    | ~ ssPv3(X2)
    | ~ ssPv2(skf3(X1))
    | ~ ssPv4(X1)
    | ~ ssRr(X2,skf3(X1)) ),
    inference(spm,[status(thm)],[c_0_378,c_0_57]),
    [final] ).

cnf(c_0_394,negated_conjecture,
    ( ssPv1(X1)
    | ssPv4(X1)
    | ~ ssPv3(skf2(skf2(X1))) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_379,c_0_380]),c_0_253]),
    [final] ).

cnf(c_0_395,negated_conjecture,
    ( ssPv2(skf2(X1))
    | ssPv4(X1)
    | ~ ssPv3(skf2(skf2(X1))) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_349,c_0_134]),c_0_365]),
    [final] ).

cnf(c_0_396,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssPv3(skf2(skf3(X1))) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_349,c_0_150]),c_0_253]),c_0_365]),
    [final] ).

cnf(c_0_397,negated_conjecture,
    ( ssPv1(skf3(X1))
    | ~ ssPv3(skf2(X1))
    | ~ ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_256,c_0_380]),
    [final] ).

cnf(c_0_398,negated_conjecture,
    ( ssPv4(skf3(X1))
    | ~ ssPv3(skf2(X1)) ),
    inference(spm,[status(thm)],[c_0_153,c_0_380]),
    [final] ).

cnf(c_0_399,negated_conjecture,
    ( ssPv4(skf3(X1))
    | ~ ssPv3(X2)
    | ~ ssPv2(X1)
    | ~ ssPv4(skf2(X1))
    | ~ ssRr(X2,X1) ),
    inference(spm,[status(thm)],[c_0_378,c_0_50]),
    [final] ).

cnf(c_0_400,negated_conjecture,
    ( ssPv1(skf3(X1))
    | ssPv3(X2)
    | ssPv2(X1)
    | ~ ssPv3(skf3(X1))
    | ~ ssRr(X2,skf3(X1)) ),
    inference(spm,[status(thm)],[c_0_182,c_0_57]),
    [final] ).

cnf(c_0_401,negated_conjecture,
    ( ssPv1(X1)
    | ssPv2(skf2(X1))
    | ssPv4(X1)
    | ~ ssPv2(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_277,c_0_74]),c_0_153]),
    [final] ).

cnf(c_0_402,negated_conjecture,
    ( ssPv1(skf2(X1))
    | ssPv3(skf2(X1))
    | ssPv2(skf2(skf2(X1)))
    | ~ ssPv2(X1) ),
    inference(spm,[status(thm)],[c_0_273,c_0_50]),
    [final] ).

cnf(c_0_403,negated_conjecture,
    ( ssPv1(skf3(X1))
    | ssPv4(skf3(X1))
    | ~ ssPv3(X2)
    | ~ ssPv4(X1)
    | ~ ssRr(X2,skf3(X1)) ),
    inference(spm,[status(thm)],[c_0_145,c_0_57]),
    [final] ).

cnf(c_0_404,negated_conjecture,
    ( ssPv3(skf3(X1))
    | ssPv2(skf3(X1))
    | ssPv4(X1)
    | ~ ssPv3(skf3(skf3(X1))) ),
    inference(spm,[status(thm)],[c_0_381,c_0_57]),
    [final] ).

cnf(c_0_405,negated_conjecture,
    ( ssPv1(skf3(X1))
    | ssPv2(skf3(X1))
    | ssPv2(X1)
    | ssPv4(X2)
    | ~ ssRr(X2,skf3(X1)) ),
    inference(spm,[status(thm)],[c_0_49,c_0_57]),
    [final] ).

cnf(c_0_406,negated_conjecture,
    ( ssPv1(skf3(X1))
    | ssPv2(skf2(skf3(X1)))
    | ssPv4(skf3(X1))
    | ~ ssPv4(X1) ),
    inference(spm,[status(thm)],[c_0_262,c_0_57]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SYN797-1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.15  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n004.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 2400
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon Oct  2 18:02:45 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.22/0.50  Running first-order theorem proving
% 0.22/0.50  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.eeosqSluev/E---3.1_5027.p
% 1.19/300.20  # Version: 3.1pre001
% 1.19/300.20  # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.19/300.20  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/300.20  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.19/300.20  # Starting new_bool_3 with 300s (1) cores
% 1.19/300.20  # Starting new_bool_1 with 300s (1) cores
% 1.19/300.20  # Starting sh5l with 300s (1) cores
% 1.19/300.20  # new_bool_1 with pid 5129 completed with status 1
% 1.19/300.20  # Result found by new_bool_1
% 1.19/300.20  # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.19/300.20  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/300.20  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.19/300.20  # Starting new_bool_3 with 300s (1) cores
% 1.19/300.20  # Starting new_bool_1 with 300s (1) cores
% 1.19/300.20  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.19/300.20  # Search class: FGHNS-FFMF11-SFFFFFNN
% 1.19/300.20  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.19/300.20  # Starting SAT001_MinMin_p005000_rr_RG with 94s (1) cores
% 1.19/300.20  # SAT001_MinMin_p005000_rr_RG with pid 5135 completed with status 1
% 1.19/300.20  # Result found by SAT001_MinMin_p005000_rr_RG
% 1.19/300.20  # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.19/300.20  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/300.20  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.19/300.20  # Starting new_bool_3 with 300s (1) cores
% 1.19/300.20  # Starting new_bool_1 with 300s (1) cores
% 1.19/300.20  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.19/300.20  # Search class: FGHNS-FFMF11-SFFFFFNN
% 1.19/300.20  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.19/300.20  # Starting SAT001_MinMin_p005000_rr_RG with 94s (1) cores
% 1.19/300.20  # Preprocessing time       : 0.002 s
% 1.19/300.20  # Presaturation interreduction done
% 1.19/300.20  
% 1.19/300.20  # No proof found!
% 1.19/300.20  # SZS status Satisfiable
% 1.19/300.20  # SZS output start Saturation
% See solution above
% 1.19/300.21  # Parsed axioms                        : 52
% 1.19/300.21  # Removed by relevancy pruning/SinE    : 0
% 1.19/300.21  # Initial clauses                      : 52
% 1.19/300.21  # Removed in clause preprocessing      : 0
% 1.19/300.21  # Initial clauses in saturation        : 52
% 1.19/300.21  # Processed clauses                    : 1418
% 1.19/300.21  # ...of these trivial                  : 0
% 1.19/300.21  # ...subsumed                          : 721
% 1.19/300.21  # ...remaining for further processing  : 697
% 1.19/300.21  # Other redundant clauses eliminated   : 0
% 1.19/300.21  # Clauses deleted for lack of memory   : 0
% 1.19/300.21  # Backward-subsumed                    : 555
% 1.19/300.21  # Backward-rewritten                   : 0
% 1.19/300.21  # Generated clauses                    : 2748
% 1.19/300.21  # ...of the previous two non-redundant : 1758
% 1.19/300.21  # ...aggressively subsumed             : 0
% 1.19/300.21  # Contextual simplify-reflections      : 200
% 1.19/300.21  # Paramodulations                      : 2744
% 1.19/300.21  # Factorizations                       : 0
% 1.19/300.21  # NegExts                              : 0
% 1.19/300.21  # Equation resolutions                 : 0
% 1.19/300.21  # Total rewrite steps                  : 0
% 1.19/300.21  # Propositional unsat checks           : 0
% 1.19/300.21  #    Propositional check models        : 0
% 1.19/300.21  #    Propositional check unsatisfiable : 0
% 1.19/300.21  #    Propositional clauses             : 0
% 1.19/300.21  #    Propositional clauses after purity: 0
% 1.19/300.21  #    Propositional unsat core size     : 0
% 1.19/300.21  #    Propositional preprocessing time  : 0.000
% 1.19/300.21  #    Propositional encoding time       : 0.000
% 1.19/300.21  #    Propositional solver time         : 0.000
% 1.19/300.21  #    Success case prop preproc time    : 0.000
% 1.19/300.21  #    Success case prop encoding time   : 0.000
% 1.19/300.21  #    Success case prop solver time     : 0.000
% 1.19/300.21  # Current number of processed clauses  : 89
% 1.19/300.21  #    Positive orientable unit clauses  : 2
% 1.19/300.21  #    Positive unorientable unit clauses: 0
% 1.19/300.21  #    Negative unit clauses             : 1
% 1.19/300.21  #    Non-unit-clauses                  : 86
% 1.19/300.21  # Current number of unprocessed clauses: 0
% 1.19/300.21  # ...number of literals in the above   : 0
% 1.19/300.21  # Current number of archived formulas  : 0
% 1.19/300.21  # Current number of archived clauses   : 608
% 1.19/300.21  # Clause-clause subsumption calls (NU) : 10568
% 1.19/300.21  # Rec. Clause-clause subsumption calls : 5027
% 1.19/300.21  # Non-unit clause-clause subsumptions  : 1392
% 1.19/300.21  # Unit Clause-clause subsumption calls : 84
% 1.19/300.21  # Rewrite failures with RHS unbound    : 0
% 1.19/300.21  # BW rewrite match attempts            : 0
% 1.19/300.21  # BW rewrite match successes           : 0
% 1.19/300.21  # Condensation attempts                : 0
% 1.19/300.21  # Condensation successes               : 0
% 1.19/300.21  # Termbank termtop insertions          : 51043
% 1.19/300.21  
% 1.19/300.21  # -------------------------------------------------
% 1.19/300.21  # User time                : 0.101 s
% 1.19/300.21  # System time              : 0.004 s
% 1.19/300.21  # Total time               : 0.105 s
% 1.19/300.21  # Maximum resident set size: 1808 pages
% 1.19/300.21  
% 1.19/300.21  # -------------------------------------------------
% 1.19/300.21  # User time                : 0.102 s
% 1.19/300.21  # System time              : 0.007 s
% 1.19/300.21  # Total time               : 0.109 s
% 1.19/300.21  # Maximum resident set size: 1720 pages
% 1.19/300.21  % E---3.1 exiting
% 1.19/300.21  % E---3.1 exiting
%------------------------------------------------------------------------------