0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.13/0.34 % Computer : n018.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Wed Jul 14 13:19:54 EDT 2021 0.13/0.34 % CPUTime : 0.19/0.38 # No SInE strategy applied 0.19/0.38 # Auto-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y 0.19/0.38 # and selection function SelectMaxLComplexAvoidPosPred. 0.19/0.38 # 0.19/0.38 # Number of axioms: 216 Number of unprocessed: 216 0.19/0.38 # Tableaux proof search. 0.19/0.38 # APR header successfully linked. 0.19/0.38 # Hello from C++ 0.19/0.39 # The folding up rule is enabled... 0.19/0.39 # Local unification is enabled... 0.19/0.39 # Any saturation attempts will use folding labels... 0.19/0.39 # 216 beginning clauses after preprocessing and clausification 0.19/0.39 # Creating start rules for all 28 conjectures. 0.19/0.39 # There are 28 start rule candidates: 0.19/0.39 # Found 19 unit axioms. 0.19/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.19/0.39 # 28 start rule tableaux created. 0.19/0.39 # 197 extension rule candidate clauses 0.19/0.39 # 19 unit axiom clauses 0.19/0.39 0.19/0.39 # Requested 8, 32 cores available to the main process. 0.19/0.46 # There were 4 total branch saturation attempts. 0.19/0.46 # There were 0 of these attempts blocked. 0.19/0.46 # There were 0 deferred branch saturation attempts. 0.19/0.46 # There were 0 free duplicated saturations. 0.19/0.46 # There were 4 total successful branch saturations. 0.19/0.46 # There were 3 successful branch saturations in interreduction. 0.19/0.46 # There were 0 successful branch saturations on the branch. 0.19/0.46 # There were 1 successful branch saturations after the branch. 0.19/0.46 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.46 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.46 # Begin clausification derivation 0.19/0.46 0.19/0.46 # End clausification derivation 0.19/0.46 # Begin listing active clauses obtained from FOF to CNF conversion 0.19/0.46 cnf(i_0_214, negated_conjecture, (esk50_0=esk48_0)). 0.19/0.46 cnf(i_0_191, negated_conjecture, (esk49_0=esk51_0)). 0.19/0.46 cnf(i_0_10, plain, (esk7_0!=esk6_0)). 0.19/0.46 cnf(i_0_62, plain, (ssList(nil))). 0.19/0.46 cnf(i_0_218, negated_conjecture, (ssList(esk48_0))). 0.19/0.46 cnf(i_0_217, negated_conjecture, (ssList(esk49_0))). 0.19/0.46 cnf(i_0_216, negated_conjecture, (ssList(esk50_0))). 0.19/0.46 cnf(i_0_215, negated_conjecture, (ssList(esk51_0))). 0.19/0.46 cnf(i_0_14, plain, (totalorderedP(nil))). 0.19/0.46 cnf(i_0_9, plain, (ssItem(esk6_0))). 0.19/0.46 cnf(i_0_11, plain, (ssItem(esk7_0))). 0.19/0.46 cnf(i_0_13, plain, (equalelemsP(nil))). 0.19/0.46 cnf(i_0_182, plain, (strictorderedP(nil))). 0.19/0.46 cnf(i_0_118, plain, (cyclefreeP(nil))). 0.19/0.46 cnf(i_0_174, plain, (totalorderP(nil))). 0.19/0.46 cnf(i_0_134, plain, (strictorderP(nil))). 0.19/0.46 cnf(i_0_180, plain, (duplicatefreeP(nil))). 0.19/0.46 cnf(i_0_17, plain, (~singletonP(nil))). 0.19/0.46 cnf(i_0_212, negated_conjecture, (neq(esk49_0,nil))). 0.19/0.46 cnf(i_0_208, negated_conjecture, (ssList(esk53_0)|neq(esk49_0,nil))). 0.19/0.46 cnf(i_0_206, negated_conjecture, (ssList(esk54_0)|neq(esk49_0,nil))). 0.19/0.46 cnf(i_0_210, negated_conjecture, (ssItem(esk52_0)|neq(esk49_0,nil))). 0.19/0.46 cnf(i_0_128, plain, (nil=X1|esk34_1(X1)=tl(X1)|~ssList(X1))). 0.19/0.46 cnf(i_0_169, plain, (nil=X1|esk42_1(X1)=hd(X1)|~ssList(X1))). 0.19/0.46 cnf(i_0_177, plain, (X1=nil|ssItem(hd(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_122, plain, (nil=X1|ssList(tl(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_77, plain, (nil=X1|ssList(esk20_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_129, plain, (nil=X1|ssList(esk34_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_78, plain, (nil=X1|ssItem(esk21_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_170, plain, (nil=X1|ssItem(esk42_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_16, plain, (frontsegP(X1,nil)|~ssList(X1))). 0.19/0.46 cnf(i_0_74, plain, (rearsegP(X1,nil)|~ssList(X1))). 0.19/0.46 cnf(i_0_133, plain, (segmentP(X1,nil)|~ssList(X1))). 0.19/0.46 cnf(i_0_80, plain, (esk22_1(X1)=esk23_1(X1)|duplicatefreeP(X1)|~ssList(X1))). 0.19/0.46 cnf(i_0_158, plain, (app(X1,nil)=X1|~ssList(X1))). 0.19/0.46 cnf(i_0_179, plain, (app(nil,X1)=X1|~ssList(X1))). 0.19/0.46 cnf(i_0_209, negated_conjecture, (ssList(esk53_0)|~neq(esk51_0,nil))). 0.19/0.46 cnf(i_0_207, negated_conjecture, (ssList(esk54_0)|~neq(esk51_0,nil))). 0.19/0.46 cnf(i_0_211, negated_conjecture, (ssItem(esk52_0)|~neq(esk51_0,nil))). 0.19/0.46 cnf(i_0_71, plain, (leq(X1,X1)|~ssItem(X1))). 0.19/0.46 cnf(i_0_103, plain, (frontsegP(X1,X1)|~ssList(X1))). 0.19/0.46 cnf(i_0_70, plain, (geq(X1,X1)|~ssItem(X1))). 0.19/0.46 cnf(i_0_96, plain, (rearsegP(X1,X1)|~ssList(X1))). 0.19/0.46 cnf(i_0_76, plain, (segmentP(X1,X1)|~ssList(X1))). 0.19/0.46 cnf(i_0_5, plain, (totalorderedP(X1)|ssList(esk3_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_4, plain, (totalorderedP(X1)|ssList(esk4_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_3, plain, (totalorderedP(X1)|ssList(esk5_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_7, plain, (totalorderedP(X1)|ssItem(esk1_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_6, plain, (totalorderedP(X1)|ssItem(esk2_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_109, plain, (equalelemsP(X1)|ssList(esk31_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_108, plain, (equalelemsP(X1)|ssList(esk32_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_111, plain, (equalelemsP(X1)|ssItem(esk29_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_110, plain, (equalelemsP(X1)|ssItem(esk30_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_188, plain, (strictorderedP(X1)|ssList(esk45_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_187, plain, (strictorderedP(X1)|ssList(esk46_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_186, plain, (strictorderedP(X1)|ssList(esk47_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_190, plain, (strictorderedP(X1)|ssItem(esk43_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_189, plain, (strictorderedP(X1)|ssItem(esk44_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_57, plain, (cyclefreeP(X1)|ssList(esk16_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_56, plain, (cyclefreeP(X1)|ssList(esk17_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_55, plain, (cyclefreeP(X1)|ssList(esk18_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_59, plain, (cyclefreeP(X1)|ssItem(esk14_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_58, plain, (cyclefreeP(X1)|ssItem(esk15_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_48, plain, (totalorderP(X1)|ssList(esk11_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_47, plain, (totalorderP(X1)|ssList(esk12_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_46, plain, (totalorderP(X1)|ssList(esk13_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_50, plain, (totalorderP(X1)|ssItem(esk9_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_49, plain, (totalorderP(X1)|ssItem(esk10_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_165, plain, (strictorderP(X1)|ssList(esk39_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_164, plain, (strictorderP(X1)|ssList(esk40_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_163, plain, (strictorderP(X1)|ssList(esk41_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_167, plain, (strictorderP(X1)|ssItem(esk37_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_166, plain, (strictorderP(X1)|ssItem(esk38_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_84, plain, (duplicatefreeP(X1)|ssList(esk24_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_83, plain, (duplicatefreeP(X1)|ssList(esk25_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_82, plain, (duplicatefreeP(X1)|ssList(esk26_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_86, plain, (duplicatefreeP(X1)|ssItem(esk22_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_85, plain, (duplicatefreeP(X1)|ssItem(esk23_1(X1))|~ssList(X1))). 0.19/0.46 cnf(i_0_92, plain, (frontsegP(nil,X1)|nil!=X1|~ssList(X1))). 0.19/0.46 cnf(i_0_41, plain, (rearsegP(nil,X1)|nil!=X1|~ssList(X1))). 0.19/0.46 cnf(i_0_116, plain, (segmentP(nil,X1)|nil!=X1|~ssList(X1))). 0.19/0.46 cnf(i_0_202, negated_conjecture, (app(esk53_0,esk54_0)=esk50_0|neq(esk49_0,nil))). 0.19/0.46 cnf(i_0_106, plain, (equalelemsP(X1)|esk30_1(X1)!=esk29_1(X1)|~ssList(X1))). 0.19/0.46 cnf(i_0_121, plain, (ssItem(esk33_1(X1))|~ssList(X1)|~singletonP(X1))). 0.19/0.46 cnf(i_0_30, plain, (~ssItem(X1)|~memberP(nil,X1))). 0.19/0.46 cnf(i_0_91, plain, (nil=X1|~ssList(X1)|~frontsegP(nil,X1))). 0.19/0.46 cnf(i_0_40, plain, (nil=X1|~ssList(X1)|~rearsegP(nil,X1))). 0.19/0.46 cnf(i_0_115, plain, (nil=X1|~ssList(X1)|~segmentP(nil,X1))). 0.19/0.46 cnf(i_0_203, negated_conjecture, (app(esk53_0,esk54_0)=esk50_0|~neq(esk51_0,nil))). 0.19/0.46 cnf(i_0_213, negated_conjecture, (neq(esk49_0,nil)|~neq(esk51_0,nil))). 0.19/0.46 cnf(i_0_181, plain, (~ssItem(X1)|~lt(X1,X1))). 0.19/0.46 cnf(i_0_148, plain, (X1=X2|neq(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.46 cnf(i_0_149, plain, (X1=X2|neq(X1,X2)|~ssItem(X2)|~ssItem(X1))). 0.19/0.46 cnf(i_0_112, plain, (app(X1,X2)=nil|X1!=nil|nil!=X2|~ssList(X2)|~ssList(X1))). 0.19/0.47 cnf(i_0_120, plain, (cons(esk33_1(X1),nil)=X1|~ssList(X1)|~singletonP(X1))). 0.19/0.47 cnf(i_0_178, plain, (totalorderedP(cons(X1,nil))|~ssItem(X1))). 0.19/0.47 cnf(i_0_141, plain, (equalelemsP(cons(X1,nil))|~ssItem(X1))). 0.19/0.47 cnf(i_0_135, plain, (strictorderedP(cons(X1,nil))|~ssItem(X1))). 0.19/0.47 cnf(i_0_29, plain, (cyclefreeP(cons(X1,nil))|~ssItem(X1))). 0.19/0.47 cnf(i_0_104, plain, (totalorderP(cons(X1,nil))|~ssItem(X1))). 0.19/0.47 cnf(i_0_72, plain, (strictorderP(cons(X1,nil))|~ssItem(X1))). 0.19/0.47 cnf(i_0_117, plain, (duplicatefreeP(cons(X1,nil))|~ssItem(X1))). 0.19/0.47 cnf(i_0_98, plain, (X1=nil|cons(hd(X1),tl(X1))=X1|~ssList(X1))). 0.19/0.47 cnf(i_0_79, plain, (nil=X1|cons(esk21_1(X1),esk20_1(X1))=X1|~ssList(X1))). 0.19/0.47 cnf(i_0_143, plain, (cons(X2,X1)!=nil|~ssList(X1)|~ssItem(X2))). 0.19/0.47 cnf(i_0_28, plain, (cons(X2,X1)!=X1|~ssList(X1)|~ssItem(X2))). 0.19/0.47 cnf(i_0_53, plain, (cyclefreeP(X1)|leq(esk14_1(X1),esk15_1(X1))|~ssList(X1))). 0.19/0.47 cnf(i_0_52, plain, (cyclefreeP(X1)|leq(esk15_1(X1),esk14_1(X1))|~ssList(X1))). 0.19/0.47 cnf(i_0_114, plain, (X1=nil|app(X1,X2)!=nil|~ssList(X2)|~ssList(X1))). 0.19/0.47 cnf(i_0_113, plain, (nil=X1|app(X2,X1)!=nil|~ssList(X2)|~ssList(X1))). 0.19/0.47 cnf(i_0_119, plain, (singletonP(X2)|cons(X1,nil)!=X2|~ssList(X2)|~ssItem(X1))). 0.19/0.47 cnf(i_0_147, plain, (X1!=X2|~ssList(X2)|~ssList(X1)|~neq(X1,X2))). 0.19/0.47 cnf(i_0_18, plain, (X1!=X2|~ssItem(X2)|~ssItem(X1)|~lt(X2,X1))). 0.19/0.47 cnf(i_0_150, plain, (X1!=X2|~ssItem(X2)|~ssItem(X1)|~neq(X1,X2))). 0.19/0.47 cnf(i_0_90, plain, (ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2))). 0.19/0.47 cnf(i_0_173, plain, (ssList(app(X1,X2))|~ssList(X2)|~ssList(X1))). 0.19/0.47 cnf(i_0_168, plain, (hd(cons(X2,X1))=X2|~ssList(X1)|~ssItem(X2))). 0.19/0.47 cnf(i_0_37, plain, (tl(cons(X2,X1))=X1|~ssList(X1)|~ssItem(X2))). 0.19/0.47 cnf(i_0_12, plain, (X1=X2|X1=nil|nil=X2|hd(X1)!=hd(X2)|tl(X1)!=tl(X2)|~ssList(X2)|~ssList(X1))). 0.19/0.47 cnf(i_0_126, plain, (totalorderedP(cons(X2,X1))|nil!=X1|~ssList(X1)|~ssItem(X2))). 0.19/0.47 cnf(i_0_26, plain, (strictorderedP(cons(X2,X1))|nil!=X1|~ssList(X1)|~ssItem(X2))). 0.19/0.47 cnf(i_0_136, plain, (X1=nil|hd(app(X1,X2))=hd(X1)|~ssList(X2)|~ssList(X1))). 0.19/0.47 cnf(i_0_21, plain, (leq(X2,X1)|~ssItem(X2)|~ssItem(X1)|~geq(X1,X2))). 0.19/0.47 cnf(i_0_19, plain, (leq(X1,X2)|~ssItem(X2)|~ssItem(X1)|~lt(X1,X2))). 0.19/0.47 cnf(i_0_88, plain, (gt(X2,X1)|~ssItem(X2)|~ssItem(X1)|~lt(X1,X2))). 0.19/0.47 cnf(i_0_89, plain, (lt(X2,X1)|~ssItem(X2)|~ssItem(X1)|~gt(X1,X2))). 0.19/0.47 cnf(i_0_22, plain, (geq(X2,X1)|~ssItem(X2)|~ssItem(X1)|~leq(X1,X2))). 0.19/0.47 cnf(i_0_1, plain, (totalorderedP(X1)|~ssList(X1)|~leq(esk1_1(X1),esk2_1(X1)))). 0.19/0.47 cnf(i_0_184, plain, (strictorderedP(X1)|~ssList(X1)|~lt(esk43_1(X1),esk44_1(X1)))). 0.19/0.47 cnf(i_0_43, plain, (totalorderP(X1)|~ssList(X1)|~leq(esk9_1(X1),esk10_1(X1)))). 0.19/0.47 cnf(i_0_44, plain, (totalorderP(X1)|~ssList(X1)|~leq(esk10_1(X1),esk9_1(X1)))). 0.19/0.47 cnf(i_0_161, plain, (strictorderP(X1)|~ssList(X1)|~lt(esk37_1(X1),esk38_1(X1)))). 0.19/0.47 cnf(i_0_160, plain, (strictorderP(X1)|~ssList(X1)|~lt(esk38_1(X1),esk37_1(X1)))). 0.19/0.47 cnf(i_0_20, plain, (X1=X2|lt(X1,X2)|~ssItem(X2)|~ssItem(X1)|~leq(X1,X2))). 0.19/0.47 cnf(i_0_132, plain, (X1=X2|lt(X1,X2)|~ssItem(X2)|~ssItem(X1)|~leq(X1,X2))). 0.19/0.47 cnf(i_0_15, plain, (~ssItem(X2)|~ssItem(X1)|~gt(X2,X1)|~gt(X1,X2))). 0.19/0.47 cnf(i_0_171, plain, (~ssItem(X2)|~ssItem(X1)|~lt(X2,X1)|~lt(X1,X2))). 0.19/0.47 cnf(i_0_69, plain, (rearsegP(X1,X3)|X1!=app(X2,X3)|~ssList(X3)|~ssList(X2)|~ssList(X1))). 0.19/0.47 cnf(i_0_36, plain, (frontsegP(X3,X2)|app(X2,X1)!=X3|~ssList(X3)|~ssList(X2)|~ssList(X1))). 0.19/0.47 cnf(i_0_200, negated_conjecture, (esk52_0=X1|neq(esk49_0,nil)|~ssItem(X1)|~geq(X1,esk52_0)|~memberP(esk51_0,X1))). 0.19/0.47 cnf(i_0_176, plain, (X1=X2|~ssList(X2)|~ssList(X1)|~frontsegP(X2,X1)|~frontsegP(X1,X2))). 0.19/0.47 cnf(i_0_75, plain, (X1=X2|~ssList(X2)|~ssList(X1)|~rearsegP(X2,X1)|~rearsegP(X1,X2))). 0.19/0.47 cnf(i_0_66, plain, (X1=X2|~ssList(X2)|~ssList(X1)|~segmentP(X2,X1)|~segmentP(X1,X2))). 0.19/0.47 cnf(i_0_137, plain, (X1=X2|~ssItem(X2)|~ssItem(X1)|~leq(X2,X1)|~leq(X1,X2))). 0.19/0.47 cnf(i_0_42, plain, (X1=X2|~ssItem(X2)|~ssItem(X1)|~geq(X2,X1)|~geq(X1,X2))). 0.19/0.47 cnf(i_0_97, plain, (app(cons(X2,nil),X1)=cons(X2,X1)|~ssList(X1)|~ssItem(X2))). 0.19/0.47 cnf(i_0_145, plain, (memberP(cons(X1,X3),X2)|X1!=X2|~ssList(X3)|~ssItem(X2)|~ssItem(X1))). 0.19/0.47 cnf(i_0_151, plain, (nil=X1|tl(app(X1,X2))=app(tl(X1),X2)|~ssList(X2)|~ssList(X1))). 0.19/0.47 cnf(i_0_201, negated_conjecture, (esk52_0=X1|~ssItem(X1)|~geq(X1,esk52_0)|~memberP(esk51_0,X1)|~neq(esk51_0,nil))). 0.19/0.47 cnf(i_0_35, plain, (ssList(esk8_2(X1,X2))|~ssList(X2)|~ssList(X1)|~frontsegP(X1,X2))). 0.19/0.47 cnf(i_0_67, plain, (ssList(esk19_2(X1,X2))|~ssList(X2)|~ssList(X1)|~rearsegP(X1,X2))). 0.19/0.47 cnf(i_0_99, plain, (ssList(esk27_2(X1,X2))|~ssList(X2)|~ssList(X1)|~segmentP(X1,X2))). 0.19/0.47 cnf(i_0_101, plain, (ssList(esk28_2(X1,X2))|~ssList(X2)|~ssList(X1)|~segmentP(X1,X2))). 0.19/0.47 cnf(i_0_154, plain, (ssList(esk35_2(X1,X2))|~ssList(X1)|~ssItem(X2)|~memberP(X1,X2))). 0.19/0.47 cnf(i_0_156, plain, (ssList(esk36_2(X1,X2))|~ssList(X1)|~ssItem(X2)|~memberP(X1,X2))). 0.19/0.47 cnf(i_0_130, plain, (X1=X3|app(X2,X1)!=app(X2,X3)|~ssList(X3)|~ssList(X2)|~ssList(X1))). 0.19/0.47 cnf(i_0_94, plain, (X1=X3|app(X1,X2)!=app(X3,X2)|~ssList(X3)|~ssList(X2)|~ssList(X1))). 0.19/0.47 cnf(i_0_125, plain, (nil=X1|totalorderedP(X1)|~ssList(X1)|~ssItem(X2)|~totalorderedP(cons(X2,X1)))). 0.19/0.47 cnf(i_0_25, plain, (nil=X1|strictorderedP(X1)|~ssList(X1)|~ssItem(X2)|~strictorderedP(cons(X2,X1)))). 0.19/0.47 cnf(i_0_32, plain, (X1=X2|cons(X3,X2)!=cons(X4,X1)|~ssList(X2)|~ssList(X1)|~ssItem(X4)|~ssItem(X3))). 0.19/0.47 cnf(i_0_31, plain, (X1=X2|cons(X1,X3)!=cons(X2,X4)|~ssList(X4)|~ssList(X3)|~ssItem(X2)|~ssItem(X1))). 0.19/0.47 cnf(i_0_68, plain, (app(esk19_2(X1,X2),X2)=X1|~ssList(X2)|~ssList(X1)|~rearsegP(X1,X2))). 0.19/0.47 cnf(i_0_34, plain, (app(X1,esk8_2(X2,X1))=X2|~ssList(X2)|~ssList(X1)|~frontsegP(X2,X1))). 0.19/0.47 cnf(i_0_153, plain, (leq(X1,X3)|~ssItem(X3)|~ssItem(X2)|~ssItem(X1)|~leq(X2,X3)|~leq(X1,X2))). 0.19/0.47 cnf(i_0_93, plain, (gt(X1,X3)|~ssItem(X3)|~ssItem(X2)|~ssItem(X1)|~gt(X2,X3)|~gt(X1,X2))). 0.19/0.47 cnf(i_0_33, plain, (frontsegP(X1,X3)|~ssList(X3)|~ssList(X2)|~ssList(X1)|~frontsegP(X2,X3)|~frontsegP(X1,X2))). 0.19/0.47 cnf(i_0_61, plain, (lt(X1,X3)|~ssItem(X3)|~ssItem(X2)|~ssItem(X1)|~leq(X1,X2)|~lt(X2,X3))). 0.19/0.47 cnf(i_0_95, plain, (lt(X1,X3)|~ssItem(X3)|~ssItem(X2)|~ssItem(X1)|~lt(X2,X3)|~lt(X1,X2))). 0.19/0.47 cnf(i_0_131, plain, (geq(X1,X3)|~ssItem(X3)|~ssItem(X2)|~ssItem(X1)|~geq(X2,X3)|~geq(X1,X2))). 0.19/0.47 cnf(i_0_39, plain, (rearsegP(X1,X3)|~ssList(X3)|~ssList(X2)|~ssList(X1)|~rearsegP(X2,X3)|~rearsegP(X1,X2))). 0.19/0.47 cnf(i_0_73, plain, (segmentP(X1,X3)|~ssList(X3)|~ssList(X2)|~ssList(X1)|~segmentP(X2,X3)|~segmentP(X1,X2))). 0.19/0.47 cnf(i_0_124, plain, (nil=X2|leq(X1,hd(X2))|~ssList(X2)|~ssItem(X1)|~totalorderedP(cons(X1,X2)))). 0.19/0.47 cnf(i_0_24, plain, (nil=X2|lt(X1,hd(X2))|~ssList(X2)|~ssItem(X1)|~strictorderedP(cons(X1,X2)))). 0.19/0.47 cnf(i_0_175, plain, (frontsegP(app(X1,X3),X2)|~ssList(X3)|~ssList(X2)|~ssList(X1)|~frontsegP(X1,X2))). 0.19/0.47 cnf(i_0_144, plain, (memberP(cons(X3,X1),X2)|~ssList(X1)|~ssItem(X3)|~ssItem(X2)|~memberP(X1,X2))). 0.19/0.47 cnf(i_0_139, plain, (memberP(app(X3,X1),X2)|~ssList(X3)|~ssList(X1)|~ssItem(X2)|~memberP(X1,X2))). 0.19/0.47 cnf(i_0_140, plain, (memberP(app(X1,X3),X2)|~ssList(X3)|~ssList(X1)|~ssItem(X2)|~memberP(X1,X2))). 0.19/0.47 cnf(i_0_152, plain, (rearsegP(app(X3,X1),X2)|~ssList(X3)|~ssList(X2)|~ssList(X1)|~rearsegP(X1,X2))). 0.19/0.47 cnf(i_0_27, plain, (X1=nil|strictorderedP(cons(X2,X1))|~ssList(X1)|~ssItem(X2)|~strictorderedP(X1)|~lt(X2,hd(X1)))). 0.19/0.47 cnf(i_0_127, plain, (nil=X1|totalorderedP(cons(X2,X1))|~ssList(X1)|~totalorderedP(X1)|~ssItem(X2)|~leq(X2,hd(X1)))). 0.19/0.47 cnf(i_0_204, negated_conjecture, (app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0|neq(esk49_0,nil))). 0.19/0.47 cnf(i_0_205, negated_conjecture, (app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0|~neq(esk51_0,nil))). 0.19/0.47 cnf(i_0_38, plain, (cons(X3,app(X2,X1))=app(cons(X3,X2),X1)|~ssList(X2)|~ssList(X1)|~ssItem(X3))). 0.19/0.47 cnf(i_0_172, plain, (app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X3)|~ssList(X2)|~ssList(X1))). 0.19/0.47 cnf(i_0_146, plain, (X1=X3|memberP(X2,X3)|~ssList(X2)|~ssItem(X3)|~ssItem(X1)|~memberP(cons(X1,X2),X3))). 0.19/0.47 cnf(i_0_102, plain, (segmentP(X2,X4)|X2!=app(app(X3,X4),X1)|~ssList(X4)|~ssList(X3)|~ssList(X2)|~ssList(X1))). 0.19/0.47 cnf(i_0_157, plain, (memberP(X4,X3)|app(X2,cons(X3,X1))!=X4|~ssList(X4)|~ssList(X2)|~ssList(X1)|~ssItem(X3))). 0.19/0.47 cnf(i_0_138, plain, (memberP(X2,X3)|memberP(X1,X3)|~ssList(X2)|~ssList(X1)|~ssItem(X3)|~memberP(app(X1,X2),X3))). 0.19/0.47 cnf(i_0_63, plain, (frontsegP(cons(X3,X1),cons(X4,X2))|X3!=X4|~ssList(X2)|~ssList(X1)|~ssItem(X4)|~ssItem(X3)|~frontsegP(X1,X2))). 0.19/0.47 cnf(i_0_64, plain, (X1=X2|~ssList(X4)|~ssList(X3)|~ssItem(X2)|~ssItem(X1)|~frontsegP(cons(X1,X3),cons(X2,X4)))). 0.19/0.47 cnf(i_0_142, plain, (segmentP(app(app(X3,X1),X4),X2)|~ssList(X4)|~ssList(X3)|~ssList(X2)|~ssList(X1)|~segmentP(X1,X2))). 0.19/0.47 cnf(i_0_65, plain, (frontsegP(X1,X2)|~ssList(X2)|~ssList(X1)|~ssItem(X4)|~ssItem(X3)|~frontsegP(cons(X3,X1),cons(X4,X2)))). 0.19/0.47 cnf(i_0_100, plain, (app(app(esk27_2(X1,X2),X2),esk28_2(X1,X2))=X1|~ssList(X2)|~ssList(X1)|~segmentP(X1,X2))). 0.19/0.47 cnf(i_0_155, plain, (app(esk35_2(X1,X2),cons(X2,esk36_2(X1,X2)))=X1|~ssList(X1)|~ssItem(X2)|~memberP(X1,X2))). 0.19/0.47 cnf(i_0_107, plain, (app(esk31_1(X1),cons(esk29_1(X1),cons(esk30_1(X1),esk32_1(X1))))=X1|equalelemsP(X1)|~ssList(X1))). 0.19/0.47 cnf(i_0_105, plain, (X2=X3|X1!=app(X4,cons(X2,cons(X3,X5)))|~ssList(X5)|~ssList(X4)|~ssList(X1)|~ssItem(X3)|~ssItem(X2)|~equalelemsP(X1))). 0.19/0.47 cnf(i_0_2, plain, (app(app(esk3_1(X1),cons(esk1_1(X1),esk4_1(X1))),cons(esk2_1(X1),esk5_1(X1)))=X1|totalorderedP(X1)|~ssList(X1))). 0.19/0.47 cnf(i_0_45, plain, (app(app(esk11_1(X1),cons(esk9_1(X1),esk12_1(X1))),cons(esk10_1(X1),esk13_1(X1)))=X1|totalorderP(X1)|~ssList(X1))). 0.19/0.47 cnf(i_0_162, plain, (app(app(esk39_1(X1),cons(esk37_1(X1),esk40_1(X1))),cons(esk38_1(X1),esk41_1(X1)))=X1|strictorderP(X1)|~ssList(X1))). 0.19/0.47 cnf(i_0_185, plain, (app(app(esk45_1(X1),cons(esk43_1(X1),esk46_1(X1))),cons(esk44_1(X1),esk47_1(X1)))=X1|strictorderedP(X1)|~ssList(X1))). 0.19/0.47 cnf(i_0_54, plain, (app(app(esk16_1(X1),cons(esk14_1(X1),esk17_1(X1))),cons(esk15_1(X1),esk18_1(X1)))=X1|cyclefreeP(X1)|~ssList(X1))). 0.19/0.47 cnf(i_0_81, plain, (app(app(esk24_1(X1),cons(esk22_1(X1),esk25_1(X1))),cons(esk23_1(X1),esk26_1(X1)))=X1|duplicatefreeP(X1)|~ssList(X1))). 0.19/0.47 cnf(i_0_87, plain, (X2!=X3|app(app(X4,cons(X2,X5)),cons(X3,X6))!=X1|~ssList(X6)|~ssList(X5)|~ssList(X4)|~ssList(X1)|~ssItem(X3)|~ssItem(X2)|~duplicatefreeP(X1))). 0.19/0.47 cnf(i_0_8, plain, (leq(X2,X3)|X1!=app(app(X4,cons(X2,X5)),cons(X3,X6))|~ssList(X6)|~ssList(X5)|~ssList(X4)|~ssList(X1)|~totalorderedP(X1)|~ssItem(X3)|~ssItem(X2))). 0.19/0.47 cnf(i_0_183, plain, (lt(X2,X3)|X1!=app(app(X4,cons(X2,X5)),cons(X3,X6))|~ssList(X6)|~ssList(X5)|~ssList(X4)|~ssList(X1)|~ssItem(X3)|~ssItem(X2)|~strictorderedP(X1))). 0.19/0.47 cnf(i_0_51, plain, (leq(X3,X2)|leq(X2,X3)|X1!=app(app(X4,cons(X2,X5)),cons(X3,X6))|~ssList(X6)|~ssList(X5)|~ssList(X4)|~ssList(X1)|~ssItem(X3)|~ssItem(X2)|~totalorderP(X1))). 0.19/0.47 cnf(i_0_159, plain, (lt(X3,X2)|lt(X2,X3)|X1!=app(app(X4,cons(X2,X5)),cons(X3,X6))|~ssList(X6)|~ssList(X5)|~ssList(X4)|~ssList(X1)|~ssItem(X3)|~ssItem(X2)|~strictorderP(X1))). 0.19/0.47 cnf(i_0_192, negated_conjecture, (neq(esk49_0,nil)|app(X2,X3)!=esk48_0|esk55_3(X1,X2,X3)!=X1|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssList(X3)|~ssList(X2)|~ssItem(X1))). 0.19/0.47 cnf(i_0_60, plain, (app(app(X4,cons(X2,X5)),cons(X3,X6))!=X1|~ssList(X6)|~ssList(X5)|~ssList(X4)|~ssList(X1)|~ssItem(X3)|~ssItem(X2)|~cyclefreeP(X1)|~leq(X3,X2)|~leq(X2,X3))). 0.19/0.47 cnf(i_0_193, negated_conjecture, (app(X2,X3)!=esk48_0|esk55_3(X1,X2,X3)!=X1|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssList(X3)|~ssList(X2)|~ssItem(X1)|~neq(esk51_0,nil))). 0.19/0.47 cnf(i_0_198, negated_conjecture, (neq(esk49_0,nil)|ssItem(esk55_3(X1,X2,X3))|app(X2,X3)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssList(X3)|~ssList(X2)|~ssItem(X1))). 0.19/0.47 cnf(i_0_199, negated_conjecture, (ssItem(esk55_3(X1,X2,X3))|app(X2,X3)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssList(X3)|~ssList(X2)|~ssItem(X1)|~neq(esk51_0,nil))). 0.19/0.47 cnf(i_0_196, negated_conjecture, (neq(esk49_0,nil)|memberP(esk49_0,esk55_3(X1,X2,X3))|app(X2,X3)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssList(X3)|~ssList(X2)|~ssItem(X1))). 0.19/0.47 cnf(i_0_194, negated_conjecture, (neq(esk49_0,nil)|geq(esk55_3(X1,X2,X3),X1)|app(X2,X3)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssList(X3)|~ssList(X2)|~ssItem(X1))). 0.19/0.47 cnf(i_0_197, negated_conjecture, (memberP(esk49_0,esk55_3(X1,X2,X3))|app(X2,X3)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssList(X3)|~ssList(X2)|~ssItem(X1)|~neq(esk51_0,nil))). 0.19/0.47 cnf(i_0_195, negated_conjecture, (geq(esk55_3(X1,X2,X3),X1)|app(X2,X3)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssList(X3)|~ssList(X2)|~ssItem(X1)|~neq(esk51_0,nil))). 0.19/0.47 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.19/0.47 # Begin printing tableau 0.19/0.47 # Found 8 steps 0.19/0.47 cnf(i_0_205, negated_conjecture, (app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0|~neq(esk51_0,nil)), inference(start_rule)). 0.19/0.47 cnf(i_0_275, plain, (app(app(esk53_0,cons(esk52_0,nil)),esk54_0)=esk51_0), inference(extension_rule, [i_0_147])). 0.19/0.47 cnf(i_0_1333, plain, (~ssList(esk51_0)), inference(closure_rule, [i_0_215])). 0.19/0.47 cnf(i_0_1334, plain, (~ssList(app(app(esk53_0,cons(esk52_0,nil)),esk54_0))), inference(extension_rule, [i_0_173])). 0.19/0.47 cnf(i_0_276, plain, (~neq(esk51_0,nil)), inference(etableau_closure_rule, [i_0_276, ...])). 0.19/0.47 cnf(i_0_1335, plain, (~neq(app(app(esk53_0,cons(esk52_0,nil)),esk54_0),esk51_0)), inference(etableau_closure_rule, [i_0_1335, ...])). 0.19/0.47 cnf(i_0_1585, plain, (~ssList(esk54_0)), inference(etableau_closure_rule, [i_0_1585, ...])). 0.19/0.47 cnf(i_0_1586, plain, (~ssList(app(esk53_0,cons(esk52_0,nil)))), inference(etableau_closure_rule, [i_0_1586, ...])). 0.19/0.47 # End printing tableau 0.19/0.47 # SZS output end 0.19/0.47 # Branches closed with saturation will be marked with an "s" 0.19/0.47 # Child (27672) has found a proof. 0.19/0.47 0.19/0.47 # Proof search is over... 0.19/0.47 # Freeing feature tree 0.19/0.47 EOF