TSTP Solution File: SWC354-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWC354-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n009.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 20:31:21 EDT 2022
% Result : Unsatisfiable 4.33s 0.93s
% Output : CNFRefutation 4.33s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC354-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.32 % Computer : n009.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sat Jun 11 20:47:53 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.18/0.37 # No SInE strategy applied
% 0.18/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S032N
% 0.18/0.37 # and selection function SelectUnlessUniqMax.
% 0.18/0.37 #
% 0.18/0.37 # Presaturation interreduction done
% 0.18/0.37 # Number of axioms: 197 Number of unprocessed: 186
% 0.18/0.37 # Tableaux proof search.
% 0.18/0.37 # APR header successfully linked.
% 0.18/0.37 # Hello from C++
% 0.18/0.40 # The folding up rule is enabled...
% 0.18/0.40 # Local unification is enabled...
% 0.18/0.40 # Any saturation attempts will use folding labels...
% 0.18/0.40 # 186 beginning clauses after preprocessing and clausification
% 0.18/0.40 # Creating start rules for all 7 conjectures.
% 0.18/0.40 # There are 7 start rule candidates:
% 0.18/0.40 # Found 64 unit axioms.
% 0.18/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.40 # 7 start rule tableaux created.
% 0.18/0.40 # 122 extension rule candidate clauses
% 0.18/0.40 # 64 unit axiom clauses
% 0.18/0.40
% 0.18/0.40 # Requested 8, 32 cores available to the main process.
% 0.18/0.40 # There are not enough tableaux to fork, creating more from the initial 7
% 0.18/0.40 # Returning from population with 159 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.40 # We now have 159 tableaux to operate on
% 4.33/0.93 # There were 1 total branch saturation attempts.
% 4.33/0.93 # There were 0 of these attempts blocked.
% 4.33/0.93 # There were 0 deferred branch saturation attempts.
% 4.33/0.93 # There were 0 free duplicated saturations.
% 4.33/0.93 # There were 1 total successful branch saturations.
% 4.33/0.93 # There were 0 successful branch saturations in interreduction.
% 4.33/0.93 # There were 0 successful branch saturations on the branch.
% 4.33/0.93 # There were 1 successful branch saturations after the branch.
% 4.33/0.93 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.33/0.93 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.33/0.93 # Begin clausification derivation
% 4.33/0.93
% 4.33/0.93 # End clausification derivation
% 4.33/0.93 # Begin listing active clauses obtained from FOF to CNF conversion
% 4.33/0.93 cnf(i_0_388, negated_conjecture, (sk3=sk1)).
% 4.33/0.93 cnf(i_0_387, negated_conjecture, (sk2=sk4)).
% 4.33/0.93 cnf(i_0_205, plain, (ssList(nil))).
% 4.33/0.93 cnf(i_0_383, negated_conjecture, (ssList(sk1))).
% 4.33/0.93 cnf(i_0_384, negated_conjecture, (ssList(sk4))).
% 4.33/0.93 cnf(i_0_198, plain, (equalelemsP(nil))).
% 4.33/0.93 cnf(i_0_389, negated_conjecture, (neq(sk4,nil))).
% 4.33/0.93 cnf(i_0_199, plain, (duplicatefreeP(nil))).
% 4.33/0.93 cnf(i_0_200, plain, (strictorderedP(nil))).
% 4.33/0.93 cnf(i_0_201, plain, (totalorderedP(nil))).
% 4.33/0.93 cnf(i_0_202, plain, (strictorderP(nil))).
% 4.33/0.93 cnf(i_0_203, plain, (totalorderP(nil))).
% 4.33/0.93 cnf(i_0_204, plain, (cyclefreeP(nil))).
% 4.33/0.93 cnf(i_0_206, plain, (ssItem(skac3))).
% 4.33/0.93 cnf(i_0_207, plain, (ssItem(skac2))).
% 4.33/0.93 cnf(i_0_210, plain, (ssList(skaf82(X1)))).
% 4.33/0.93 cnf(i_0_211, plain, (ssList(skaf81(X1)))).
% 4.33/0.93 cnf(i_0_212, plain, (ssList(skaf80(X1)))).
% 4.33/0.93 cnf(i_0_215, plain, (ssList(skaf77(X1)))).
% 4.33/0.93 cnf(i_0_216, plain, (ssList(skaf76(X1)))).
% 4.33/0.93 cnf(i_0_217, plain, (ssList(skaf75(X1)))).
% 4.33/0.93 cnf(i_0_219, plain, (ssList(skaf73(X1)))).
% 4.33/0.93 cnf(i_0_220, plain, (ssList(skaf72(X1)))).
% 4.33/0.93 cnf(i_0_221, plain, (ssList(skaf71(X1)))).
% 4.33/0.93 cnf(i_0_224, plain, (ssList(skaf68(X1)))).
% 4.33/0.93 cnf(i_0_225, plain, (ssList(skaf67(X1)))).
% 4.33/0.93 cnf(i_0_226, plain, (ssList(skaf66(X1)))).
% 4.33/0.93 cnf(i_0_229, plain, (ssList(skaf63(X1)))).
% 4.33/0.93 cnf(i_0_230, plain, (ssList(skaf62(X1)))).
% 4.33/0.93 cnf(i_0_231, plain, (ssList(skaf61(X1)))).
% 4.33/0.93 cnf(i_0_234, plain, (ssList(skaf58(X1)))).
% 4.33/0.93 cnf(i_0_235, plain, (ssList(skaf57(X1)))).
% 4.33/0.93 cnf(i_0_236, plain, (ssList(skaf56(X1)))).
% 4.33/0.93 cnf(i_0_239, plain, (ssList(skaf53(X1)))).
% 4.33/0.93 cnf(i_0_240, plain, (ssList(skaf52(X1)))).
% 4.33/0.93 cnf(i_0_241, plain, (ssList(skaf51(X1)))).
% 4.33/0.93 cnf(i_0_209, plain, (ssItem(skaf83(X1)))).
% 4.33/0.93 cnf(i_0_213, plain, (ssItem(skaf79(X1)))).
% 4.33/0.93 cnf(i_0_214, plain, (ssItem(skaf78(X1)))).
% 4.33/0.93 cnf(i_0_218, plain, (ssItem(skaf74(X1)))).
% 4.33/0.93 cnf(i_0_222, plain, (ssItem(skaf70(X1)))).
% 4.33/0.93 cnf(i_0_223, plain, (ssItem(skaf69(X1)))).
% 4.33/0.93 cnf(i_0_227, plain, (ssItem(skaf65(X1)))).
% 4.33/0.93 cnf(i_0_228, plain, (ssItem(skaf64(X1)))).
% 4.33/0.93 cnf(i_0_232, plain, (ssItem(skaf60(X1)))).
% 4.33/0.93 cnf(i_0_233, plain, (ssItem(skaf59(X1)))).
% 4.33/0.93 cnf(i_0_237, plain, (ssItem(skaf55(X1)))).
% 4.33/0.93 cnf(i_0_238, plain, (ssItem(skaf54(X1)))).
% 4.33/0.93 cnf(i_0_242, plain, (ssItem(skaf50(X1)))).
% 4.33/0.93 cnf(i_0_243, plain, (ssItem(skaf49(X1)))).
% 4.33/0.93 cnf(i_0_244, plain, (ssItem(skaf44(X1)))).
% 4.33/0.93 cnf(i_0_245, plain, (ssList(skaf48(X1,X2)))).
% 4.33/0.93 cnf(i_0_276, plain, (segmentP(nil,nil))).
% 4.33/0.93 cnf(i_0_246, plain, (ssList(skaf47(X1,X2)))).
% 4.33/0.93 cnf(i_0_247, plain, (ssList(skaf46(X1,X2)))).
% 4.33/0.93 cnf(i_0_248, plain, (ssList(skaf45(X1,X2)))).
% 4.33/0.93 cnf(i_0_249, plain, (ssList(skaf43(X1,X2)))).
% 4.33/0.93 cnf(i_0_250, plain, (ssList(skaf42(X1,X2)))).
% 4.33/0.93 cnf(i_0_278, plain, (rearsegP(nil,nil))).
% 4.33/0.93 cnf(i_0_280, plain, (frontsegP(nil,nil))).
% 4.33/0.93 cnf(i_0_342, plain, (app(nil,nil)=nil)).
% 4.33/0.93 cnf(i_0_251, plain, (skac2!=skac3)).
% 4.33/0.93 cnf(i_0_208, plain, (~singletonP(nil))).
% 4.33/0.93 cnf(i_0_394, negated_conjecture, (~segmentP(sk4,sk1))).
% 4.33/0.93 cnf(i_0_260, plain, (~lt(X1,X1)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_268, plain, (~memberP(nil,X1)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_253, plain, (segmentP(X1,nil)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_277, plain, (nil=X1|~segmentP(nil,X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_296, plain, (cons(X1,X2)!=X2|~ssItem(X1)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_295, plain, (cons(X1,X2)!=nil|~ssItem(X1)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_252, plain, (geq(X1,X1)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_254, plain, (segmentP(X1,X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_273, plain, (nil=X1|ssItem(hd(X1))|~ssList(X1))).
% 4.33/0.93 cnf(i_0_269, plain, (ssItem(X1)|duplicatefreeP(X2)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_256, plain, (rearsegP(X1,X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_258, plain, (frontsegP(X1,X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_259, plain, (leq(X1,X1)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_312, plain, (~neq(X1,X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_255, plain, (rearsegP(X1,nil)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_257, plain, (frontsegP(X1,nil)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_279, plain, (nil=X1|~rearsegP(nil,X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_272, plain, (nil=X1|ssList(tl(X1))|~ssList(X1))).
% 4.33/0.93 cnf(i_0_314, plain, (~neq(X1,X1)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_281, plain, (nil=X1|~frontsegP(nil,X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_261, plain, (equalelemsP(cons(X1,nil))|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_262, plain, (duplicatefreeP(cons(X1,nil))|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_263, plain, (strictorderedP(cons(X1,nil))|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_286, plain, (equalelemsP(X1)|skaf78(X1)!=skaf79(X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_311, plain, (~lt(X1,X2)|~lt(X2,X1)|~ssItem(X1)|~ssItem(X2))).
% 4.33/0.93 cnf(i_0_307, plain, (~gt(X1,X2)|~gt(X2,X1)|~ssItem(X1)|~ssItem(X2))).
% 4.33/0.93 cnf(i_0_304, plain, (leq(X1,X2)|~geq(X2,X1)|~ssItem(X1)|~ssItem(X2))).
% 4.33/0.93 cnf(i_0_270, plain, (app(X1,nil)=X1|~ssList(X1))).
% 4.33/0.93 cnf(i_0_264, plain, (totalorderedP(cons(X1,nil))|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_265, plain, (strictorderP(cons(X1,nil))|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_266, plain, (totalorderP(cons(X1,nil))|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_267, plain, (cyclefreeP(cons(X1,nil))|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_271, plain, (app(nil,X1)=X1|~ssList(X1))).
% 4.33/0.93 cnf(i_0_300, plain, (leq(X1,X2)|~lt(X1,X2)|~ssItem(X2)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_302, plain, (lt(X1,X2)|~gt(X2,X1)|~ssItem(X1)|~ssItem(X2))).
% 4.33/0.93 cnf(i_0_287, plain, (strictorderedP(X1)|~lt(skaf69(X1),skaf70(X1))|~ssList(X1))).
% 4.33/0.93 cnf(i_0_288, plain, (totalorderedP(X1)|~leq(skaf64(X1),skaf65(X1))|~ssList(X1))).
% 4.33/0.93 cnf(i_0_283, plain, (ssList(cons(X1,X2))|~ssItem(X1)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_316, plain, (nil=X1|app(X2,X1)!=nil|~ssList(X1)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_297, plain, (X1=X2|neq(X2,X1)|~ssList(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_294, plain, (hd(cons(X1,X2))=X1|~ssItem(X1)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_289, plain, (strictorderP(X1)|~lt(skaf60(X1),skaf59(X1))|~ssList(X1))).
% 4.33/0.93 cnf(i_0_290, plain, (strictorderP(X1)|~lt(skaf59(X1),skaf60(X1))|~ssList(X1))).
% 4.33/0.93 cnf(i_0_291, plain, (totalorderP(X1)|~leq(skaf55(X1),skaf54(X1))|~ssList(X1))).
% 4.33/0.93 cnf(i_0_292, plain, (totalorderP(X1)|~leq(skaf54(X1),skaf55(X1))|~ssList(X1))).
% 4.33/0.93 cnf(i_0_282, plain, (ssList(app(X1,X2))|~ssList(X1)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_315, plain, (nil=X1|app(X1,X2)!=nil|~ssList(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_298, plain, (cons(skaf44(X1),nil)=X1|~singletonP(X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_299, plain, (X1=X2|neq(X2,X1)|~ssItem(X2)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_313, plain, (singletonP(cons(X1,nil))|~ssItem(X1)|~ssList(cons(X1,nil)))).
% 4.33/0.93 cnf(i_0_293, plain, (tl(cons(X1,X2))=X2|~ssItem(X1)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_305, plain, (geq(X1,X2)|~leq(X2,X1)|~ssItem(X1)|~ssItem(X2))).
% 4.33/0.93 cnf(i_0_303, plain, (gt(X1,X2)|~lt(X2,X1)|~ssItem(X1)|~ssItem(X2))).
% 4.33/0.93 cnf(i_0_324, plain, (X1=X2|~segmentP(X2,X1)|~segmentP(X1,X2)|~ssList(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_325, plain, (X1=X2|~rearsegP(X2,X1)|~rearsegP(X1,X2)|~ssList(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_301, plain, (cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1))).
% 4.33/0.93 cnf(i_0_326, plain, (X1=X2|~frontsegP(X2,X1)|~frontsegP(X1,X2)|~ssList(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_323, plain, (X1=X2|~geq(X2,X1)|~geq(X1,X2)|~ssItem(X2)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_327, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2)|~ssItem(X2)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_321, plain, (nil=X1|strictorderedP(X1)|~ssItem(X2)|~ssList(X1)|~strictorderedP(cons(X2,X1)))).
% 4.33/0.93 cnf(i_0_306, plain, (cons(skaf83(X1),skaf82(X1))=X1|nil=X1|~ssList(X1))).
% 4.33/0.93 cnf(i_0_393, negated_conjecture, (cons(hd(sk4),nil)=sk1|~neq(nil,sk4)|~ssItem(hd(sk4))|~ssList(cons(hd(sk4),nil)))).
% 4.33/0.93 cnf(i_0_322, plain, (nil=X1|totalorderedP(X1)|~ssItem(X2)|~ssList(X1)|~totalorderedP(cons(X2,X1)))).
% 4.33/0.93 cnf(i_0_284, plain, (leq(skaf50(X1),skaf49(X1))|cyclefreeP(X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_320, plain, (hd(app(X1,X2))=hd(X1)|nil=X1|~ssList(X1)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_318, plain, (X1=X2|lt(X1,X2)|~leq(X1,X2)|~ssItem(X2)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_347, plain, (X1=X2|app(X3,X1)!=app(X3,X2)|~ssList(X2)|~ssList(X1)|~ssList(X3))).
% 4.33/0.93 cnf(i_0_348, plain, (X1=X2|app(X1,X3)!=app(X2,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_285, plain, (leq(skaf49(X1),skaf50(X1))|cyclefreeP(X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_317, plain, (app(cons(X1,nil),X2)=cons(X1,X2)|~ssItem(X1)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_332, plain, (nil=X1|leq(X2,hd(X1))|~ssItem(X2)|~ssList(X1)|~totalorderedP(cons(X2,X1)))).
% 4.33/0.93 cnf(i_0_368, plain, (X1=X2|cons(X3,X1)!=cons(X4,X2)|~ssItem(X4)|~ssItem(X3)|~ssList(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_367, plain, (X1=X2|cons(X1,X3)!=cons(X2,X4)|~ssItem(X2)|~ssItem(X1)|~ssList(X4)|~ssList(X3))).
% 4.33/0.93 cnf(i_0_374, plain, (nil=X1|nil=X2|X1=X2|tl(X1)!=tl(X2)|hd(X1)!=hd(X2)|~ssList(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_335, plain, (memberP(cons(X1,X2),X1)|~ssItem(X1)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_340, plain, (rearsegP(app(X1,X2),X2)|~ssList(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_331, plain, (nil=X1|lt(X2,hd(X1))|~ssItem(X2)|~ssList(X1)|~strictorderedP(cons(X2,X1)))).
% 4.33/0.93 cnf(i_0_349, plain, (segmentP(X1,X2)|~segmentP(X3,X2)|~segmentP(X1,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_357, plain, (nil=X1|strictorderedP(cons(X2,X1))|~lt(X2,hd(X1))|~ssItem(X2)|~ssList(X1)|~strictorderedP(X1))).
% 4.33/0.93 cnf(i_0_373, plain, (X1=X2|~frontsegP(cons(X1,X3),cons(X2,X4))|~ssItem(X2)|~ssItem(X1)|~ssList(X4)|~ssList(X3))).
% 4.33/0.93 cnf(i_0_336, plain, (memberP(cons(X1,X2),X3)|~memberP(X2,X3)|~ssItem(X1)|~ssItem(X3)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_341, plain, (frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_330, plain, (tl(app(X1,X2))=app(tl(X1),X2)|nil=X1|~ssList(X1)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_345, plain, (geq(X1,X2)|~geq(X3,X2)|~geq(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_350, plain, (rearsegP(X1,X2)|~rearsegP(X3,X2)|~rearsegP(X1,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_351, plain, (frontsegP(X1,X2)|~frontsegP(X3,X2)|~frontsegP(X1,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_353, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_329, plain, (app(X1,skaf45(X2,X1))=X2|~frontsegP(X2,X1)|~ssList(X1)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_356, plain, (nil=X1|totalorderedP(cons(X2,X1))|~leq(X2,hd(X1))|~ssItem(X2)|~ssList(X1)|~totalorderedP(X1))).
% 4.33/0.93 cnf(i_0_371, plain, (frontsegP(X1,X2)|~frontsegP(cons(X3,X1),cons(X4,X2))|~ssItem(X4)|~ssItem(X3)|~ssList(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_358, plain, (X1=X2|memberP(X3,X2)|~memberP(cons(X1,X3),X2)|~ssItem(X2)|~ssItem(X1)|~ssList(X3))).
% 4.33/0.93 cnf(i_0_333, plain, (rearsegP(app(X1,X2),X3)|~rearsegP(X2,X3)|~ssList(X1)|~ssList(X3)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_328, plain, (app(skaf46(X1,X2),X2)=X1|~rearsegP(X1,X2)|~ssList(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_354, plain, (app(cons(X1,X2),X3)=cons(X1,app(X2,X3))|~ssItem(X1)|~ssList(X3)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_344, plain, (lt(X1,X2)|~lt(X3,X2)|~leq(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_352, plain, (lt(X1,X2)|~lt(X3,X2)|~lt(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_343, plain, (gt(X1,X2)|~gt(X3,X2)|~gt(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))).
% 4.33/0.93 cnf(i_0_334, plain, (frontsegP(app(X1,X2),X3)|~frontsegP(X1,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_338, plain, (memberP(app(X1,X2),X3)|~memberP(X2,X3)|~ssItem(X3)|~ssList(X1)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_337, plain, (memberP(app(X1,X2),X3)|~memberP(X1,X3)|~ssItem(X3)|~ssList(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_355, plain, (memberP(X1,X2)|memberP(X3,X2)|~memberP(app(X1,X3),X2)|~ssItem(X2)|~ssList(X3)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_370, plain, (segmentP(app(app(X1,X2),X3),X2)|~ssList(app(app(X1,X2),X3))|~ssList(X3)|~ssList(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_346, plain, (app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3))).
% 4.33/0.93 cnf(i_0_369, plain, (segmentP(app(app(X1,X2),X3),X4)|~segmentP(X2,X4)|~ssList(X1)|~ssList(X3)|~ssList(X4)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_372, plain, (memberP(app(X1,cons(X2,X3)),X2)|~ssItem(X2)|~ssList(app(X1,cons(X2,X3)))|~ssList(X3)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_339, plain, (app(skaf80(X1),cons(skaf78(X1),cons(skaf79(X1),skaf81(X1))))=X1|equalelemsP(X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_375, plain, (frontsegP(cons(X1,X2),cons(X1,X3))|~frontsegP(X2,X3)|~ssItem(X1)|~ssList(X3)|~ssList(X2))).
% 4.33/0.93 cnf(i_0_377, plain, (X1=X2|~ssItem(X2)|~ssItem(X1)|~ssList(app(X3,cons(X1,cons(X2,X4))))|~ssList(X4)|~ssList(X3)|~equalelemsP(app(X3,cons(X1,cons(X2,X4)))))).
% 4.33/0.93 cnf(i_0_376, plain, (~ssItem(X1)|~ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))|~ssList(X4)|~ssList(X3)|~ssList(X2)|~duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))))).
% 4.33/0.93 cnf(i_0_366, plain, (app(skaf42(X1,X2),cons(X2,skaf43(X2,X1)))=X1|~memberP(X1,X2)|~ssItem(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_365, plain, (app(app(skaf47(X1,X2),X2),skaf48(X2,X1))=X1|~segmentP(X1,X2)|~ssList(X2)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_379, plain, (leq(X1,X2)|~ssItem(X2)|~ssItem(X1)|~ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))|~ssList(X5)|~ssList(X4)|~ssList(X3)|~totalorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))))).
% 4.33/0.93 cnf(i_0_359, plain, (app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),cons(skaf74(X1),skaf77(X1)))=X1|duplicatefreeP(X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_378, plain, (lt(X1,X2)|~ssItem(X2)|~ssItem(X1)|~ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))|~ssList(X5)|~ssList(X4)|~ssList(X3)|~strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))))).
% 4.33/0.93 cnf(i_0_382, plain, (~leq(X1,X2)|~leq(X2,X1)|~ssItem(X1)|~ssItem(X2)|~ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))|~ssList(X5)|~ssList(X4)|~ssList(X3)|~cyclefreeP(app(app(X3,cons(X2,X4)),cons(X1,X5))))).
% 4.33/0.93 cnf(i_0_381, plain, (leq(X1,X2)|leq(X2,X1)|~ssItem(X1)|~ssItem(X2)|~ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))|~ssList(X5)|~ssList(X4)|~ssList(X3)|~totalorderP(app(app(X3,cons(X2,X4)),cons(X1,X5))))).
% 4.33/0.93 cnf(i_0_360, plain, (app(app(skaf71(X1),cons(skaf69(X1),skaf72(X1))),cons(skaf70(X1),skaf73(X1)))=X1|strictorderedP(X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_380, plain, (lt(X1,X2)|lt(X2,X1)|~ssItem(X1)|~ssItem(X2)|~ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))|~ssList(X5)|~ssList(X4)|~ssList(X3)|~strictorderP(app(app(X3,cons(X2,X4)),cons(X1,X5))))).
% 4.33/0.93 cnf(i_0_361, plain, (app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1)))=X1|totalorderedP(X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_362, plain, (app(app(skaf61(X1),cons(skaf59(X1),skaf62(X1))),cons(skaf60(X1),skaf63(X1)))=X1|strictorderP(X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_363, plain, (app(app(skaf56(X1),cons(skaf54(X1),skaf57(X1))),cons(skaf55(X1),skaf58(X1)))=X1|totalorderP(X1)|~ssList(X1))).
% 4.33/0.93 cnf(i_0_364, plain, (app(app(skaf51(X1),cons(skaf49(X1),skaf52(X1))),cons(skaf50(X1),skaf53(X1)))=X1|cyclefreeP(X1)|~ssList(X1))).
% 4.33/0.93 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 4.33/0.93 # Begin printing tableau
% 4.33/0.93 # Found 5 steps
% 4.33/0.93 cnf(i_0_384, negated_conjecture, (ssList(sk4)), inference(start_rule)).
% 4.33/0.93 cnf(i_0_427, plain, (ssList(sk4)), inference(extension_rule, [i_0_282])).
% 4.33/0.93 cnf(i_0_3523, plain, (~ssList(nil)), inference(closure_rule, [i_0_205])).
% 4.33/0.93 cnf(i_0_3522, plain, (ssList(app(nil,sk4))), inference(extension_rule, [i_0_253])).
% 4.33/0.93 cnf(i_0_6375, plain, (segmentP(app(nil,sk4),nil)), inference(etableau_closure_rule, [i_0_6375, ...])).
% 4.33/0.93 # End printing tableau
% 4.33/0.93 # SZS output end
% 4.33/0.93 # Branches closed with saturation will be marked with an "s"
% 4.33/0.94 # Child (2883) has found a proof.
% 4.33/0.94
% 4.33/0.94 # Proof search is over...
% 4.33/0.94 # Freeing feature tree
%------------------------------------------------------------------------------