TSTP Solution File: SWC222+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWC222+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 : n014.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:30:24 EDT 2022
% Result : Theorem 8.61s 1.50s
% Output : CNFRefutation 8.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC222+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n014.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 : Sun Jun 12 08:21:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 0.12/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.37 #
% 0.12/0.37 # Number of axioms: 205 Number of unprocessed: 205
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 205 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 17 conjectures.
% 0.12/0.37 # There are 17 start rule candidates:
% 0.12/0.37 # Found 19 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 17 start rule tableaux created.
% 0.12/0.37 # 186 extension rule candidate clauses
% 0.12/0.37 # 19 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 8.61/1.50 # There were 3 total branch saturation attempts.
% 8.61/1.50 # There were 0 of these attempts blocked.
% 8.61/1.50 # There were 0 deferred branch saturation attempts.
% 8.61/1.50 # There were 0 free duplicated saturations.
% 8.61/1.50 # There were 3 total successful branch saturations.
% 8.61/1.50 # There were 0 successful branch saturations in interreduction.
% 8.61/1.50 # There were 0 successful branch saturations on the branch.
% 8.61/1.50 # There were 3 successful branch saturations after the branch.
% 8.61/1.50 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.61/1.50 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.61/1.50 # Begin clausification derivation
% 8.61/1.50
% 8.61/1.50 # End clausification derivation
% 8.61/1.50 # Begin listing active clauses obtained from FOF to CNF conversion
% 8.61/1.50 cnf(i_0_202, negated_conjecture, (esk50_0=esk48_0)).
% 8.61/1.50 cnf(i_0_203, negated_conjecture, (esk49_0=esk51_0)).
% 8.61/1.50 cnf(i_0_3, plain, (esk2_0!=esk1_0)).
% 8.61/1.50 cnf(i_0_201, negated_conjecture, (esk48_0!=nil)).
% 8.61/1.50 cnf(i_0_5, plain, (ssItem(esk1_0))).
% 8.61/1.50 cnf(i_0_4, plain, (ssItem(esk2_0))).
% 8.61/1.50 cnf(i_0_84, plain, (ssList(nil))).
% 8.61/1.50 cnf(i_0_207, negated_conjecture, (ssList(esk48_0))).
% 8.61/1.50 cnf(i_0_206, negated_conjecture, (ssList(esk49_0))).
% 8.61/1.50 cnf(i_0_205, negated_conjecture, (ssList(esk50_0))).
% 8.61/1.50 cnf(i_0_204, negated_conjecture, (ssList(esk51_0))).
% 8.61/1.50 cnf(i_0_141, plain, (cyclefreeP(nil))).
% 8.61/1.50 cnf(i_0_143, plain, (totalorderP(nil))).
% 8.61/1.50 cnf(i_0_145, plain, (strictorderP(nil))).
% 8.61/1.50 cnf(i_0_147, plain, (totalorderedP(nil))).
% 8.61/1.50 cnf(i_0_154, plain, (strictorderedP(nil))).
% 8.61/1.50 cnf(i_0_161, plain, (duplicatefreeP(nil))).
% 8.61/1.50 cnf(i_0_163, plain, (equalelemsP(nil))).
% 8.61/1.50 cnf(i_0_195, negated_conjecture, (esk50_0=nil|ssItem(esk53_0))).
% 8.61/1.50 cnf(i_0_194, negated_conjecture, (esk50_0=nil|ssList(esk54_0))).
% 8.61/1.50 cnf(i_0_193, negated_conjecture, (esk50_0=nil|ssList(esk55_0))).
% 8.61/1.50 cnf(i_0_115, plain, (~singletonP(nil))).
% 8.61/1.50 cnf(i_0_164, plain, (nil=X1|esk46_1(X1)=hd(X1)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_166, plain, (nil=X1|esk47_1(X1)=tl(X1)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_92, plain, (nil=X1|ssItem(hd(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_89, plain, (nil=X1|ssItem(esk45_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_165, plain, (nil=X1|ssItem(esk46_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_94, plain, (nil=X1|ssList(tl(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_90, plain, (nil=X1|ssList(esk44_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_167, plain, (nil=X1|ssList(esk47_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_123, plain, (frontsegP(X1,nil)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_130, plain, (rearsegP(X1,nil)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_137, plain, (segmentP(X1,nil)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_66, plain, (esk35_1(X1)=esk36_1(X1)|duplicatefreeP(X1)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_177, plain, (app(X1,nil)=X1|~ssList(X1))).
% 8.61/1.50 cnf(i_0_98, plain, (app(nil,X1)=X1|~ssList(X1))).
% 8.61/1.50 cnf(i_0_118, plain, (frontsegP(X1,X1)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_128, plain, (rearsegP(X1,X1)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_135, plain, (segmentP(X1,X1)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_101, plain, (leq(X1,X1)|~ssItem(X1))).
% 8.61/1.50 cnf(i_0_182, plain, (geq(X1,X1)|~ssItem(X1))).
% 8.61/1.50 cnf(i_0_30, plain, (cyclefreeP(X1)|ssItem(esk10_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_29, plain, (cyclefreeP(X1)|ssItem(esk11_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_28, plain, (cyclefreeP(X1)|ssList(esk12_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_27, plain, (cyclefreeP(X1)|ssList(esk13_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_26, plain, (cyclefreeP(X1)|ssList(esk14_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_39, plain, (totalorderP(X1)|ssItem(esk15_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_38, plain, (totalorderP(X1)|ssItem(esk16_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_37, plain, (totalorderP(X1)|ssList(esk17_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_36, plain, (totalorderP(X1)|ssList(esk18_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_35, plain, (totalorderP(X1)|ssList(esk19_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_48, plain, (strictorderP(X1)|ssItem(esk20_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_47, plain, (strictorderP(X1)|ssItem(esk21_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_46, plain, (strictorderP(X1)|ssList(esk22_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_45, plain, (strictorderP(X1)|ssList(esk23_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_44, plain, (strictorderP(X1)|ssList(esk24_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_56, plain, (totalorderedP(X1)|ssItem(esk25_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_55, plain, (totalorderedP(X1)|ssItem(esk26_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_54, plain, (totalorderedP(X1)|ssList(esk27_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_53, plain, (totalorderedP(X1)|ssList(esk28_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_52, plain, (totalorderedP(X1)|ssList(esk29_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_64, plain, (strictorderedP(X1)|ssItem(esk30_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_63, plain, (strictorderedP(X1)|ssItem(esk31_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_62, plain, (strictorderedP(X1)|ssList(esk32_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_61, plain, (strictorderedP(X1)|ssList(esk33_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_60, plain, (strictorderedP(X1)|ssList(esk34_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_72, plain, (duplicatefreeP(X1)|ssItem(esk35_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_71, plain, (duplicatefreeP(X1)|ssItem(esk36_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_70, plain, (duplicatefreeP(X1)|ssList(esk37_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_69, plain, (duplicatefreeP(X1)|ssList(esk38_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_68, plain, (duplicatefreeP(X1)|ssList(esk39_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_79, plain, (equalelemsP(X1)|ssItem(esk40_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_78, plain, (equalelemsP(X1)|ssItem(esk41_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_77, plain, (equalelemsP(X1)|ssList(esk42_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_76, plain, (equalelemsP(X1)|ssList(esk43_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_124, plain, (frontsegP(nil,X1)|nil!=X1|~ssList(X1))).
% 8.61/1.50 cnf(i_0_131, plain, (rearsegP(nil,X1)|nil!=X1|~ssList(X1))).
% 8.61/1.50 cnf(i_0_138, plain, (segmentP(nil,X1)|nil!=X1|~ssList(X1))).
% 8.61/1.50 cnf(i_0_74, plain, (equalelemsP(X1)|esk41_1(X1)!=esk40_1(X1)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_12, plain, (ssItem(esk5_1(X1))|~ssList(X1)|~singletonP(X1))).
% 8.61/1.50 cnf(i_0_114, plain, (~ssItem(X1)|~memberP(nil,X1))).
% 8.61/1.50 cnf(i_0_125, plain, (nil=X1|~ssList(X1)|~frontsegP(nil,X1))).
% 8.61/1.50 cnf(i_0_132, plain, (nil=X1|~ssList(X1)|~rearsegP(nil,X1))).
% 8.61/1.50 cnf(i_0_139, plain, (nil=X1|~ssList(X1)|~segmentP(nil,X1))).
% 8.61/1.50 cnf(i_0_183, plain, (~ssItem(X1)|~lt(X1,X1))).
% 8.61/1.50 cnf(i_0_1, plain, (X1=X2|neq(X1,X2)|~ssItem(X2)|~ssItem(X1))).
% 8.61/1.50 cnf(i_0_81, plain, (X1=X2|neq(X1,X2)|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_174, plain, (app(X2,X1)=nil|nil!=X2|nil!=X1|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_11, plain, (cons(esk5_1(X1),nil)=X1|~ssList(X1)|~singletonP(X1))).
% 8.61/1.50 cnf(i_0_140, plain, (cyclefreeP(cons(X1,nil))|~ssItem(X1))).
% 8.61/1.50 cnf(i_0_142, plain, (totalorderP(cons(X1,nil))|~ssItem(X1))).
% 8.61/1.50 cnf(i_0_144, plain, (strictorderP(cons(X1,nil))|~ssItem(X1))).
% 8.61/1.50 cnf(i_0_146, plain, (totalorderedP(cons(X1,nil))|~ssItem(X1))).
% 8.61/1.50 cnf(i_0_153, plain, (strictorderedP(cons(X1,nil))|~ssItem(X1))).
% 8.61/1.50 cnf(i_0_160, plain, (duplicatefreeP(cons(X1,nil))|~ssItem(X1))).
% 8.61/1.50 cnf(i_0_162, plain, (equalelemsP(cons(X1,nil))|~ssItem(X1))).
% 8.61/1.50 cnf(i_0_169, plain, (nil=X1|cons(hd(X1),tl(X1))=X1|~ssList(X1))).
% 8.61/1.50 cnf(i_0_88, plain, (nil=X1|cons(esk45_1(X1),esk44_1(X1))=X1|~ssList(X1))).
% 8.61/1.50 cnf(i_0_91, plain, (cons(X2,X1)!=nil|~ssItem(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_85, plain, (cons(X2,X1)!=X1|~ssItem(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_24, plain, (cyclefreeP(X1)|leq(esk10_1(X1),esk11_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_23, plain, (cyclefreeP(X1)|leq(esk11_1(X1),esk10_1(X1))|~ssList(X1))).
% 8.61/1.50 cnf(i_0_176, plain, (nil=X1|app(X2,X1)!=nil|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_175, plain, (nil=X1|app(X1,X2)!=nil|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_10, plain, (singletonP(X2)|cons(X1,nil)!=X2|~ssItem(X1)|~ssList(X2))).
% 8.61/1.50 cnf(i_0_2, plain, (X1!=X2|~ssItem(X2)|~ssItem(X1)|~neq(X1,X2))).
% 8.61/1.50 cnf(i_0_188, plain, (X1!=X2|~ssItem(X2)|~ssItem(X1)|~lt(X1,X2))).
% 8.61/1.50 cnf(i_0_82, plain, (X1!=X2|~ssList(X2)|~ssList(X1)|~neq(X1,X2))).
% 8.61/1.50 cnf(i_0_83, plain, (ssList(cons(X2,X1))|~ssItem(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_96, plain, (ssList(app(X1,X2))|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_93, plain, (hd(cons(X2,X1))=X2|~ssItem(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_95, plain, (tl(cons(X2,X1))=X1|~ssItem(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_168, plain, (X1=X2|nil=X2|nil=X1|hd(X1)!=hd(X2)|tl(X1)!=tl(X2)|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_149, plain, (totalorderedP(cons(X2,X1))|nil!=X1|~ssItem(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_156, plain, (strictorderedP(cons(X2,X1))|nil!=X1|~ssItem(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_178, plain, (nil=X1|hd(app(X1,X2))=hd(X1)|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_103, plain, (leq(X2,X1)|~ssItem(X2)|~ssItem(X1)|~geq(X1,X2))).
% 8.61/1.50 cnf(i_0_187, plain, (leq(X1,X2)|~ssItem(X2)|~ssItem(X1)|~lt(X1,X2))).
% 8.61/1.50 cnf(i_0_107, plain, (lt(X2,X1)|~ssItem(X2)|~ssItem(X1)|~gt(X1,X2))).
% 8.61/1.50 cnf(i_0_102, plain, (geq(X2,X1)|~ssItem(X2)|~ssItem(X1)|~leq(X1,X2))).
% 8.61/1.50 cnf(i_0_106, plain, (gt(X2,X1)|~ssItem(X2)|~ssItem(X1)|~lt(X1,X2))).
% 8.61/1.50 cnf(i_0_33, plain, (totalorderP(X1)|~ssList(X1)|~leq(esk15_1(X1),esk16_1(X1)))).
% 8.61/1.50 cnf(i_0_32, plain, (totalorderP(X1)|~ssList(X1)|~leq(esk16_1(X1),esk15_1(X1)))).
% 8.61/1.50 cnf(i_0_42, plain, (strictorderP(X1)|~ssList(X1)|~lt(esk20_1(X1),esk21_1(X1)))).
% 8.61/1.50 cnf(i_0_41, plain, (strictorderP(X1)|~ssList(X1)|~lt(esk21_1(X1),esk20_1(X1)))).
% 8.61/1.50 cnf(i_0_50, plain, (totalorderedP(X1)|~ssList(X1)|~leq(esk25_1(X1),esk26_1(X1)))).
% 8.61/1.50 cnf(i_0_58, plain, (strictorderedP(X1)|~ssList(X1)|~lt(esk30_1(X1),esk31_1(X1)))).
% 8.61/1.50 cnf(i_0_185, plain, (X1=X2|lt(X1,X2)|~ssItem(X2)|~ssItem(X1)|~leq(X1,X2))).
% 8.61/1.50 cnf(i_0_186, plain, (X1=X2|lt(X1,X2)|~ssItem(X2)|~ssItem(X1)|~leq(X1,X2))).
% 8.61/1.50 cnf(i_0_104, plain, (~ssItem(X2)|~ssItem(X1)|~lt(X2,X1)|~lt(X1,X2))).
% 8.61/1.50 cnf(i_0_189, plain, (~ssItem(X2)|~ssItem(X1)|~gt(X2,X1)|~gt(X1,X2))).
% 8.61/1.50 cnf(i_0_13, plain, (frontsegP(X3,X2)|app(X2,X1)!=X3|~ssList(X3)|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_16, plain, (rearsegP(X3,X2)|app(X1,X2)!=X3|~ssList(X3)|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_99, plain, (X1=X2|~ssItem(X2)|~ssItem(X1)|~leq(X2,X1)|~leq(X1,X2))).
% 8.61/1.50 cnf(i_0_180, plain, (X1=X2|~ssItem(X2)|~ssItem(X1)|~geq(X2,X1)|~geq(X1,X2))).
% 8.61/1.50 cnf(i_0_117, plain, (X1=X2|~ssList(X2)|~ssList(X1)|~frontsegP(X2,X1)|~frontsegP(X1,X2))).
% 8.61/1.50 cnf(i_0_127, plain, (X1=X2|~ssList(X2)|~ssList(X1)|~rearsegP(X2,X1)|~rearsegP(X1,X2))).
% 8.61/1.50 cnf(i_0_134, plain, (X1=X2|~ssList(X2)|~ssList(X1)|~segmentP(X2,X1)|~segmentP(X1,X2))).
% 8.61/1.50 cnf(i_0_172, plain, (app(cons(X2,nil),X1)=cons(X2,X1)|~ssItem(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_112, plain, (memberP(cons(X2,X3),X1)|X1!=X2|~ssItem(X2)|~ssItem(X1)|~ssList(X3))).
% 8.61/1.50 cnf(i_0_179, plain, (nil=X1|tl(app(X1,X2))=app(tl(X1),X2)|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_9, plain, (ssList(esk3_2(X1,X2))|~ssItem(X2)|~ssList(X1)|~memberP(X1,X2))).
% 8.61/1.50 cnf(i_0_8, plain, (ssList(esk4_2(X1,X2))|~ssItem(X2)|~ssList(X1)|~memberP(X1,X2))).
% 8.61/1.50 cnf(i_0_15, plain, (ssList(esk6_2(X1,X2))|~ssList(X2)|~ssList(X1)|~frontsegP(X1,X2))).
% 8.61/1.50 cnf(i_0_18, plain, (ssList(esk7_2(X1,X2))|~ssList(X2)|~ssList(X1)|~rearsegP(X1,X2))).
% 8.61/1.50 cnf(i_0_22, plain, (ssList(esk8_2(X1,X2))|~ssList(X2)|~ssList(X1)|~segmentP(X1,X2))).
% 8.61/1.50 cnf(i_0_21, plain, (ssList(esk9_2(X1,X2))|~ssList(X2)|~ssList(X1)|~segmentP(X1,X2))).
% 8.61/1.50 cnf(i_0_171, plain, (X1=X3|app(X2,X1)!=app(X2,X3)|~ssList(X3)|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_170, plain, (X1=X3|app(X1,X2)!=app(X3,X2)|~ssList(X3)|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_151, plain, (nil=X1|totalorderedP(X1)|~ssItem(X2)|~ssList(X1)|~totalorderedP(cons(X2,X1)))).
% 8.61/1.50 cnf(i_0_158, plain, (nil=X1|strictorderedP(X1)|~ssItem(X2)|~ssList(X1)|~strictorderedP(cons(X2,X1)))).
% 8.61/1.50 cnf(i_0_86, plain, (X1=X2|cons(X3,X2)!=cons(X4,X1)|~ssItem(X4)|~ssItem(X3)|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_87, plain, (X1=X2|cons(X1,X3)!=cons(X2,X4)|~ssItem(X2)|~ssItem(X1)|~ssList(X4)|~ssList(X3))).
% 8.61/1.50 cnf(i_0_192, negated_conjecture, (esk50_0=nil|app(app(esk54_0,cons(esk53_0,nil)),esk55_0)=esk50_0)).
% 8.61/1.50 cnf(i_0_14, plain, (app(X1,esk6_2(X2,X1))=X2|~ssList(X2)|~ssList(X1)|~frontsegP(X2,X1))).
% 8.61/1.50 cnf(i_0_17, plain, (app(esk7_2(X1,X2),X2)=X1|~ssList(X2)|~ssList(X1)|~rearsegP(X1,X2))).
% 8.61/1.50 cnf(i_0_116, plain, (frontsegP(X1,X3)|~ssList(X3)|~ssList(X2)|~ssList(X1)|~frontsegP(X2,X3)|~frontsegP(X1,X2))).
% 8.61/1.50 cnf(i_0_126, plain, (rearsegP(X1,X3)|~ssList(X3)|~ssList(X2)|~ssList(X1)|~rearsegP(X2,X3)|~rearsegP(X1,X2))).
% 8.61/1.50 cnf(i_0_133, plain, (segmentP(X1,X3)|~ssList(X3)|~ssList(X2)|~ssList(X1)|~segmentP(X2,X3)|~segmentP(X1,X2))).
% 8.61/1.50 cnf(i_0_100, plain, (leq(X1,X3)|~ssItem(X3)|~ssItem(X2)|~ssItem(X1)|~leq(X2,X3)|~leq(X1,X2))).
% 8.61/1.50 cnf(i_0_184, plain, (lt(X1,X3)|~ssItem(X3)|~ssItem(X2)|~ssItem(X1)|~leq(X1,X2)|~lt(X2,X3))).
% 8.61/1.50 cnf(i_0_105, plain, (lt(X1,X3)|~ssItem(X3)|~ssItem(X2)|~ssItem(X1)|~lt(X2,X3)|~lt(X1,X2))).
% 8.61/1.50 cnf(i_0_181, plain, (geq(X1,X3)|~ssItem(X3)|~ssItem(X2)|~ssItem(X1)|~geq(X2,X3)|~geq(X1,X2))).
% 8.61/1.50 cnf(i_0_190, plain, (gt(X1,X3)|~ssItem(X3)|~ssItem(X2)|~ssItem(X1)|~gt(X2,X3)|~gt(X1,X2))).
% 8.61/1.50 cnf(i_0_191, negated_conjecture, (esk50_0=nil|leq(esk53_0,X1)|~ssItem(X1)|~memberP(esk54_0,X1)|~memberP(esk55_0,X1)|~lt(esk53_0,X1))).
% 8.61/1.50 cnf(i_0_150, plain, (nil=X2|leq(X1,hd(X2))|~ssItem(X1)|~ssList(X2)|~totalorderedP(cons(X1,X2)))).
% 8.61/1.50 cnf(i_0_157, plain, (nil=X2|lt(X1,hd(X2))|~ssItem(X1)|~ssList(X2)|~strictorderedP(cons(X1,X2)))).
% 8.61/1.50 cnf(i_0_111, plain, (memberP(cons(X3,X1),X2)|~ssItem(X3)|~ssItem(X2)|~ssList(X1)|~memberP(X1,X2))).
% 8.61/1.50 cnf(i_0_108, plain, (memberP(app(X3,X1),X2)|~ssItem(X2)|~ssList(X3)|~ssList(X1)|~memberP(X1,X2))).
% 8.61/1.50 cnf(i_0_109, plain, (memberP(app(X1,X3),X2)|~ssItem(X2)|~ssList(X3)|~ssList(X1)|~memberP(X1,X2))).
% 8.61/1.50 cnf(i_0_119, plain, (frontsegP(app(X1,X3),X2)|~ssList(X3)|~ssList(X2)|~ssList(X1)|~frontsegP(X1,X2))).
% 8.61/1.50 cnf(i_0_129, plain, (rearsegP(app(X3,X1),X2)|~ssList(X3)|~ssList(X2)|~ssList(X1)|~rearsegP(X1,X2))).
% 8.61/1.50 cnf(i_0_148, plain, (nil=X1|totalorderedP(cons(X2,X1))|~ssItem(X2)|~ssList(X1)|~totalorderedP(X1)|~leq(X2,hd(X1)))).
% 8.61/1.50 cnf(i_0_155, plain, (nil=X1|strictorderedP(cons(X2,X1))|~ssItem(X2)|~ssList(X1)|~strictorderedP(X1)|~lt(X2,hd(X1)))).
% 8.61/1.50 cnf(i_0_97, plain, (app(cons(X3,X2),X1)=cons(X3,app(X2,X1))|~ssItem(X3)|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_173, plain, (app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X3)|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_113, plain, (X1=X3|memberP(X2,X3)|~ssItem(X3)|~ssItem(X1)|~ssList(X2)|~memberP(cons(X1,X2),X3))).
% 8.61/1.50 cnf(i_0_6, plain, (memberP(X4,X3)|app(X1,cons(X3,X2))!=X4|~ssItem(X3)|~ssList(X4)|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_19, plain, (segmentP(X4,X3)|app(app(X1,X3),X2)!=X4|~ssList(X4)|~ssList(X3)|~ssList(X2)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_110, plain, (memberP(X2,X3)|memberP(X1,X3)|~ssItem(X3)|~ssList(X2)|~ssList(X1)|~memberP(app(X1,X2),X3))).
% 8.61/1.50 cnf(i_0_120, plain, (frontsegP(cons(X1,X3),cons(X2,X4))|X1!=X2|~ssItem(X2)|~ssItem(X1)|~ssList(X4)|~ssList(X3)|~frontsegP(X3,X4))).
% 8.61/1.50 cnf(i_0_122, plain, (X1=X2|~ssItem(X2)|~ssItem(X1)|~ssList(X4)|~ssList(X3)|~frontsegP(cons(X1,X3),cons(X2,X4)))).
% 8.61/1.50 cnf(i_0_136, plain, (segmentP(app(app(X3,X1),X4),X2)|~ssList(X4)|~ssList(X3)|~ssList(X2)|~ssList(X1)|~segmentP(X1,X2))).
% 8.61/1.50 cnf(i_0_121, plain, (frontsegP(X1,X2)|~ssItem(X4)|~ssItem(X3)|~ssList(X2)|~ssList(X1)|~frontsegP(cons(X3,X1),cons(X4,X2)))).
% 8.61/1.50 cnf(i_0_7, plain, (app(esk3_2(X1,X2),cons(X2,esk4_2(X1,X2)))=X1|~ssItem(X2)|~ssList(X1)|~memberP(X1,X2))).
% 8.61/1.50 cnf(i_0_20, plain, (app(app(esk8_2(X1,X2),X2),esk9_2(X1,X2))=X1|~ssList(X2)|~ssList(X1)|~segmentP(X1,X2))).
% 8.61/1.50 cnf(i_0_75, plain, (app(esk42_1(X1),cons(esk40_1(X1),cons(esk41_1(X1),esk43_1(X1))))=X1|equalelemsP(X1)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_80, plain, (X2=X3|app(X4,cons(X2,cons(X3,X5)))!=X1|~ssItem(X3)|~ssItem(X2)|~ssList(X5)|~ssList(X4)|~ssList(X1)|~equalelemsP(X1))).
% 8.61/1.50 cnf(i_0_25, plain, (app(app(esk12_1(X1),cons(esk10_1(X1),esk13_1(X1))),cons(esk11_1(X1),esk14_1(X1)))=X1|cyclefreeP(X1)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_34, plain, (app(app(esk17_1(X1),cons(esk15_1(X1),esk18_1(X1))),cons(esk16_1(X1),esk19_1(X1)))=X1|totalorderP(X1)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_43, plain, (app(app(esk22_1(X1),cons(esk20_1(X1),esk23_1(X1))),cons(esk21_1(X1),esk24_1(X1)))=X1|strictorderP(X1)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_51, plain, (app(app(esk27_1(X1),cons(esk25_1(X1),esk28_1(X1))),cons(esk26_1(X1),esk29_1(X1)))=X1|totalorderedP(X1)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_59, plain, (app(app(esk32_1(X1),cons(esk30_1(X1),esk33_1(X1))),cons(esk31_1(X1),esk34_1(X1)))=X1|strictorderedP(X1)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_67, plain, (app(app(esk37_1(X1),cons(esk35_1(X1),esk38_1(X1))),cons(esk36_1(X1),esk39_1(X1)))=X1|duplicatefreeP(X1)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_73, plain, (X2!=X3|app(app(X4,cons(X2,X5)),cons(X3,X6))!=X1|~ssItem(X3)|~ssItem(X2)|~ssList(X6)|~ssList(X5)|~ssList(X4)|~ssList(X1)|~duplicatefreeP(X1))).
% 8.61/1.50 cnf(i_0_57, plain, (leq(X2,X3)|app(app(X4,cons(X2,X5)),cons(X3,X6))!=X1|~ssItem(X3)|~ssItem(X2)|~ssList(X6)|~ssList(X5)|~ssList(X4)|~ssList(X1)|~totalorderedP(X1))).
% 8.61/1.50 cnf(i_0_65, plain, (lt(X2,X3)|app(app(X4,cons(X2,X5)),cons(X3,X6))!=X1|~ssItem(X3)|~ssItem(X2)|~ssList(X6)|~ssList(X5)|~ssList(X4)|~ssList(X1)|~strictorderedP(X1))).
% 8.61/1.50 cnf(i_0_40, plain, (leq(X3,X2)|leq(X2,X3)|app(app(X4,cons(X2,X5)),cons(X3,X6))!=X1|~ssItem(X3)|~ssItem(X2)|~ssList(X6)|~ssList(X5)|~ssList(X4)|~ssList(X1)|~totalorderP(X1))).
% 8.61/1.50 cnf(i_0_49, plain, (lt(X3,X2)|lt(X2,X3)|app(app(X4,cons(X2,X5)),cons(X3,X6))!=X1|~ssItem(X3)|~ssItem(X2)|~ssList(X6)|~ssList(X5)|~ssList(X4)|~ssList(X1)|~strictorderP(X1))).
% 8.61/1.50 cnf(i_0_200, negated_conjecture, (ssItem(esk52_3(X1,X2,X3))|app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssItem(X1)|~ssList(X3)|~ssList(X2))).
% 8.61/1.50 cnf(i_0_198, negated_conjecture, (memberP(X1,esk52_3(X2,X3,X1))|app(app(X3,cons(X2,nil)),X1)!=esk48_0|~ssItem(X2)|~ssList(X3)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_199, negated_conjecture, (memberP(X1,esk52_3(X2,X1,X3))|app(app(X1,cons(X2,nil)),X3)!=esk48_0|~ssItem(X2)|~ssList(X3)|~ssList(X1))).
% 8.61/1.50 cnf(i_0_197, negated_conjecture, (leq(X1,esk52_3(X1,X2,X3))|app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssItem(X1)|~ssList(X3)|~ssList(X2))).
% 8.61/1.50 cnf(i_0_31, plain, (app(app(X4,cons(X2,X5)),cons(X3,X6))!=X1|~ssItem(X3)|~ssItem(X2)|~ssList(X6)|~ssList(X5)|~ssList(X4)|~ssList(X1)|~cyclefreeP(X1)|~leq(X3,X2)|~leq(X2,X3))).
% 8.61/1.50 cnf(i_0_196, negated_conjecture, (app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssItem(X1)|~ssList(X3)|~ssList(X2)|~leq(esk52_3(X1,X2,X3),X1))).
% 8.61/1.50 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 8.61/1.50 # Begin printing tableau
% 8.61/1.50 # Found 7 steps
% 8.61/1.50 cnf(i_0_207, negated_conjecture, (ssList(esk48_0)), inference(start_rule)).
% 8.61/1.50 cnf(i_0_250, plain, (ssList(esk48_0)), inference(extension_rule, [i_0_164])).
% 8.61/1.50 cnf(i_0_2602, plain, (esk48_0=nil), inference(closure_rule, [i_0_201])).
% 8.61/1.50 cnf(i_0_2603, plain, (esk46_1(esk48_0)=hd(esk48_0)), inference(extension_rule, [i_0_2])).
% 8.61/1.50 cnf(i_0_2837, plain, (~ssItem(hd(esk48_0))), inference(etableau_closure_rule, [i_0_2837, ...])).
% 8.61/1.50 cnf(i_0_2838, plain, (~ssItem(esk46_1(esk48_0))), inference(etableau_closure_rule, [i_0_2838, ...])).
% 8.61/1.50 cnf(i_0_2839, plain, (~neq(esk46_1(esk48_0),hd(esk48_0))), inference(etableau_closure_rule, [i_0_2839, ...])).
% 8.61/1.50 # End printing tableau
% 8.61/1.50 # SZS output end
% 8.61/1.50 # Branches closed with saturation will be marked with an "s"
% 8.61/1.51 # Child (27607) has found a proof.
% 8.61/1.51
% 8.61/1.51 # Proof search is over...
% 8.61/1.51 # Freeing feature tree
%------------------------------------------------------------------------------