0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/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 : n018.cluster.edu 0.12/0.33 Model : x86_64 x86_64 0.12/0.33 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 RAMPerCPU : 8042.1875MB 0.12/0.33 OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 960 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Aug 9 04:13:30 EDT 2022 0.12/0.33 % CPUTime : 0.19/0.39 # No SInE strategy applied 0.19/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4c 0.19/0.39 # and selection function SelectCQPrecWNTNp. 0.19/0.39 # 0.19/0.39 # Presaturation interreduction done 0.19/0.39 # Number of axioms: 205 Number of unprocessed: 199 0.19/0.39 # Tableaux proof search. 0.19/0.39 # APR header successfully linked. 0.19/0.39 # 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 # 199 beginning clauses after preprocessing and clausification 0.19/0.39 # Creating start rules for all 15 conjectures. 0.19/0.39 # There are 15 start rule candidates: 0.19/0.39 # Found 24 unit axioms. 0.19/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.19/0.39 # 15 start rule tableaux created. 0.19/0.39 # 175 extension rule candidate clauses 0.19/0.39 # 24 unit axiom clauses 0.19/0.39 0.19/0.39 # Requested 8, 32 cores available to the main process. 0.19/0.45 # Creating equality axioms 0.19/0.45 # Ran out of tableaux, making start rules for all clauses 0.19/0.45 # Creating equality axioms 0.19/0.45 # Ran out of tableaux, making start rules for all clauses 0.19/0.45 # There were 1 total branch saturation attempts. 0.19/0.45 # There were 0 of these attempts blocked. 0.19/0.45 # There were 0 deferred branch saturation attempts. 0.19/0.45 # There were 0 free duplicated saturations. 0.19/0.45 # There were 1 total successful branch saturations. 0.19/0.45 # There were 0 successful branch saturations in interreduction. 0.19/0.45 # There were 0 successful branch saturations on the branch. 0.19/0.45 # There were 1 successful branch saturations after the branch. 0.19/0.45 # There were 1 total branch saturation attempts. 0.19/0.45 # There were 0 of these attempts blocked. 0.19/0.45 # There were 0 deferred branch saturation attempts. 0.19/0.45 # There were 0 free duplicated saturations. 0.19/0.45 # There were 1 total successful branch saturations. 0.19/0.45 # There were 0 successful branch saturations in interreduction. 0.19/0.45 # There were 0 successful branch saturations on the branch. 0.19/0.45 # There were 1 successful branch saturations after the branch. 0.19/0.45 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.45 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.45 # Begin clausification derivation 0.19/0.45 0.19/0.45 # End clausification derivation 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion 0.19/0.45 cnf(i_0_203, negated_conjecture, (esk50_0=esk48_0)). 0.19/0.45 cnf(i_0_191, negated_conjecture, (esk51_0=esk49_0)). 0.19/0.45 cnf(i_0_31, plain, (ssList(nil))). 0.19/0.45 cnf(i_0_207, negated_conjecture, (ssList(esk48_0))). 0.19/0.45 cnf(i_0_206, negated_conjecture, (ssList(esk49_0))). 0.19/0.45 cnf(i_0_197, negated_conjecture, (ssList(esk52_0))). 0.19/0.45 cnf(i_0_196, negated_conjecture, (ssList(esk53_0))). 0.19/0.45 cnf(i_0_9, plain, (strictorderedP(nil))). 0.19/0.45 cnf(i_0_193, negated_conjecture, (strictorderedP(esk48_0))). 0.19/0.45 cnf(i_0_176, plain, (ssItem(esk43_0))). 0.19/0.45 cnf(i_0_175, plain, (ssItem(esk44_0))). 0.19/0.45 cnf(i_0_6, plain, (equalelemsP(nil))). 0.19/0.45 cnf(i_0_22, plain, (totalorderedP(nil))). 0.19/0.45 cnf(i_0_154, plain, (duplicatefreeP(nil))). 0.19/0.45 cnf(i_0_147, plain, (totalorderP(nil))). 0.19/0.45 cnf(i_0_171, plain, (strictorderP(nil))). 0.19/0.45 cnf(i_0_73, plain, (cyclefreeP(nil))). 0.19/0.45 cnf(i_0_192, negated_conjecture, (app(app(esk52_0,esk48_0),esk53_0)=esk49_0)). 0.19/0.45 cnf(i_0_134, plain, (segmentP(nil,nil))). 0.19/0.45 cnf(i_0_97, plain, (frontsegP(nil,nil))). 0.19/0.45 cnf(i_0_110, plain, (rearsegP(nil,nil))). 0.19/0.45 cnf(i_0_138, plain, (app(nil,nil)=nil)). 0.19/0.45 cnf(i_0_174, plain, (esk44_0!=esk43_0)). 0.19/0.45 cnf(i_0_152, plain, (~singletonP(nil))). 0.19/0.45 cnf(i_0_202, negated_conjecture, (esk49_0=nil|esk48_0!=nil)). 0.19/0.45 cnf(i_0_66, plain, (~lt(X1,X1)|~ssItem(X1))). 0.19/0.45 cnf(i_0_5, plain, (~memberP(nil,X1)|~ssItem(X1))). 0.19/0.45 cnf(i_0_198, negated_conjecture, (neq(esk49_0,nil)|esk48_0!=nil)). 0.19/0.45 cnf(i_0_200, negated_conjecture, (esk49_0=nil|neq(esk49_0,nil))). 0.19/0.45 cnf(i_0_199, negated_conjecture, (esk48_0!=nil|~neq(esk48_0,nil)|~segmentP(esk49_0,esk48_0))). 0.19/0.45 cnf(i_0_201, negated_conjecture, (esk49_0=nil|~neq(esk48_0,nil)|~segmentP(esk49_0,esk48_0))). 0.19/0.45 cnf(i_0_143, plain, (cons(X1,X2)!=X2|~ssItem(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_146, plain, (cons(X1,X2)!=nil|~ssItem(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_30, plain, (frontsegP(X1,X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_32, plain, (rearsegP(X1,X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_183, plain, (segmentP(X1,nil)|~ssList(X1))). 0.19/0.45 cnf(i_0_101, plain, (strictorderedP(cons(X1,nil))|~ssItem(X1))). 0.19/0.45 cnf(i_0_135, plain, (X1=nil|~segmentP(nil,X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_107, plain, (esk26_1(X1)=hd(X1)|X1=nil|~ssList(X1))). 0.19/0.45 cnf(i_0_140, plain, (app(X1,nil)=X1|~ssList(X1))). 0.19/0.45 cnf(i_0_21, plain, (geq(X1,X1)|~ssItem(X1))). 0.19/0.45 cnf(i_0_53, plain, (segmentP(X1,X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_142, plain, (leq(X1,X1)|~ssItem(X1))). 0.19/0.45 cnf(i_0_10, plain, (app(nil,X1)=X1|~ssList(X1))). 0.19/0.45 cnf(i_0_77, plain, (~neq(X1,X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_153, plain, (frontsegP(X1,nil)|~ssList(X1))). 0.19/0.45 cnf(i_0_8, plain, (rearsegP(X1,nil)|~ssList(X1))). 0.19/0.45 cnf(i_0_96, plain, (X1=nil|~frontsegP(nil,X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_93, plain, (esk25_1(X1)=tl(X1)|nil=X1|~ssList(X1))). 0.19/0.45 cnf(i_0_151, plain, (equalelemsP(cons(X1,nil))|~ssItem(X1))). 0.19/0.45 cnf(i_0_99, plain, (~neq(X1,X1)|~ssItem(X1))). 0.19/0.45 cnf(i_0_20, plain, (totalorderedP(cons(X1,nil))|~ssItem(X1))). 0.19/0.45 cnf(i_0_111, plain, (X1=nil|~rearsegP(nil,X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_25, plain, (duplicatefreeP(cons(X1,nil))|~ssItem(X1))). 0.19/0.45 cnf(i_0_26, plain, (totalorderP(cons(X1,nil))|~ssItem(X1))). 0.19/0.45 cnf(i_0_36, plain, (strictorderP(cons(X1,nil))|~ssItem(X1))). 0.19/0.45 cnf(i_0_74, plain, (X1=nil|ssList(tl(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_131, plain, (cyclefreeP(cons(X1,nil))|~ssItem(X1))). 0.19/0.45 cnf(i_0_46, plain, (equalelemsP(X1)|esk10_1(X1)!=esk9_1(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_173, plain, (~gt(X1,X2)|~gt(X2,X1)|~ssItem(X1)|~ssItem(X2))). 0.19/0.45 cnf(i_0_104, plain, (~lt(X1,X2)|~lt(X2,X1)|~ssItem(X1)|~ssItem(X2))). 0.19/0.45 cnf(i_0_187, plain, (ssItem(esk47_1(X1))|~singletonP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_106, plain, (X1=nil|ssItem(esk26_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_55, plain, (nil=X1|ssList(esk13_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_94, plain, (nil=X1|ssList(esk25_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_113, plain, (leq(X1,X2)|~geq(X2,X1)|~ssItem(X1)|~ssItem(X2))). 0.19/0.45 cnf(i_0_169, plain, (leq(X1,X2)|~lt(X1,X2)|~ssItem(X2)|~ssItem(X1))). 0.19/0.45 cnf(i_0_178, plain, (lt(X1,X2)|~gt(X2,X1)|~ssItem(X1)|~ssItem(X2))). 0.19/0.45 cnf(i_0_# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.45 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.45 # Begin clausification derivation 0.19/0.45 0.19/0.45 # End clausification derivation 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion 0.19/0.45 cnf(i_0_203, negated_conjecture, (esk50_0=esk48_0)). 0.19/0.45 cnf(i_0_191, negated_conjecture, (esk51_0=esk49_0)). 0.19/0.45 cnf(i_0_31, plain, (ssList(nil))). 0.19/0.45 cnf(i_0_207, negated_conjecture, (ssList(esk48_0))). 0.19/0.45 cnf(i_0_206, negated_conjecture, (ssList(esk49_0))). 0.19/0.45 cnf(i_0_197, negated_conjecture, (ssList(esk52_0))). 0.19/0.45 cnf(i_0_196, negated_conjecture, (ssList(esk53_0))). 0.19/0.45 cnf(i_0_9, plain, (strictorderedP(nil))). 0.19/0.45 cnf(i_0_193, negated_conjecture, (strictorderedP(esk48_0))). 0.19/0.45 cnf(i_0_176, plain, (ssItem(esk43_0))). 0.19/0.45 cnf(i_0_175, plain, (ssItem(esk44_0))). 0.19/0.45 cnf(i_0_6, plain, (equalelemsP(nil))). 0.19/0.45 cnf(i_0_22, plain, (totalorderedP(nil))). 0.19/0.45 cnf(i_0_154, plain, (duplicatefreeP(nil))). 0.19/0.45 cnf(i_0_147, plain, (totalorderP(nil))). 0.19/0.45 cnf(i_0_171, plain, (strictorderP(nil))). 0.19/0.45 cnf(i_0_73, plain, (cyclefreeP(nil))). 0.19/0.45 cnf(i_0_192, negated_conjecture, (app(app(esk52_0,esk48_0),esk53_0)=esk49_0)). 0.19/0.45 cnf(i_0_134, plain, (segmentP(nil,nil))). 0.19/0.45 cnf(i_0_97, plain, (frontsegP(nil,nil))). 0.19/0.45 cnf(i_0_110, plain, (rearsegP(nil,nil))). 0.19/0.45 cnf(i_0_138, plain, (app(nil,nil)=nil)). 0.19/0.45 cnf(i_0_174, plain, (esk44_0!=esk43_0)). 0.19/0.45 cnf(i_0_152, plain, (~singletonP(nil))). 0.19/0.45 cnf(i_0_202, negated_conjecture, (esk49_0=nil|esk48_0!=nil)). 0.19/0.45 cnf(i_0_66, plain, (~lt(X1,X1)|~ssItem(X1))). 0.19/0.45 cnf(i_0_5, plain, (~memberP(nil,X1)|~ssItem(X1))). 0.19/0.45 cnf(i_0_198, negated_conjecture, (neq(esk49_0,nil)|esk48_0!=nil)). 0.19/0.45 cnf(i_0_200, negated_conjecture, (esk49_0=nil|neq(esk49_0,nil))). 0.19/0.45 cnf(i_0_199, negated_conjecture, (esk48_0!=nil|~neq(esk48_0,nil)|~segmentP(esk49_0,esk48_0))). 0.19/0.45 cnf(i_0_201, negated_conjecture, (esk49_0=nil|~neq(esk48_0,nil)|~segmentP(esk49_0,esk48_0))). 0.19/0.45 cnf(i_0_143, plain, (cons(X1,X2)!=X2|~ssItem(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_146, plain, (cons(X1,X2)!=nil|~ssItem(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_30, plain, (frontsegP(X1,X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_32, plain, (rearsegP(X1,X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_183, plain, (segmentP(X1,nil)|~ssList(X1))). 0.19/0.45 cnf(i_0_101, plain, (strictorderedP(cons(X1,nil))|~ssItem(X1))). 0.19/0.45 cnf(i_0_135, plain, (X1=nil|~segmentP(nil,X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_107, plain, (esk26_1(X1)=hd(X1)|X1=nil|~ssList(X1))). 0.19/0.45 cnf(i_0_140, plain, (app(X1,nil)=X1|~ssList(X1))). 0.19/0.45 cnf(i_0_21, plain, (geq(X1,X1)|~ssItem(X1))). 0.19/0.45 cnf(i_0_53, plain, (segmentP(X1,X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_142, plain, (leq(X1,X1)|~ssItem(X1))). 0.19/0.45 cnf(i_0_10, plain, (app(nil,X1)=X1|~ssList(X1))). 0.19/0.45 cnf(i_0_77, plain, (~neq(X1,X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_153, plain, (frontsegP(X1,nil)|~ssList(X1))). 0.19/0.45 cnf(i_0_8, plain, (rearsegP(X1,nil)|~ssList(X1))). 0.19/0.45 cnf(i_0_96, plain, (X1=nil|~frontsegP(nil,X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_93, plain, (esk25_1(X1)=tl(X1)|nil=X1|~ssList(X1))). 0.19/0.45 cnf(i_0_151, plain, (equalelemsP(cons(X1,nil))|~ssItem(X1))). 0.19/0.45 cnf(i_0_99, plain, (~neq(X1,X1)|~ssItem(X1))). 0.19/0.45 cnf(i_0_20, plain, (totalorderedP(cons(X1,nil))|~ssItem(X1))). 0.19/0.45 cnf(i_0_111, plain, (X1=nil|~rearsegP(nil,X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_25, plain, (duplicatefreeP(cons(X1,nil))|~ssItem(X1))). 0.19/0.45 cnf(i_0_26, plain, (totalorderP(cons(X1,nil))|~ssItem(X1))). 0.19/0.45 cnf(i_0_36, plain, (strictorderP(cons(X1,nil))|~ssItem(X1))). 0.19/0.45 cnf(i_0_74, plain, (X1=nil|ssList(tl(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_131, plain, (cyclefreeP(cons(X1,nil))|~ssItem(X1))). 0.19/0.45 cnf(i_0_46, plain, (equalelemsP(X1)|esk10_1(X1)!=esk9_1(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_173, plain, (~gt(X1,X2)|~gt(X2,X1)|~ssItem(X1)|~ssItem(X2))). 0.19/0.45 cnf(i_0_104, plain, (~lt(X1,X2)|~lt(X2,X1)|~ssItem(X1)|~ssItem(X2))). 0.19/0.45 cnf(i_0_187, plain, (ssItem(esk47_1(X1))|~singletonP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_106, plain, (X1=nil|ssItem(esk26_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_55, plain, (nil=X1|ssList(esk13_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_94, plain, (nil=X1|ssList(esk25_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_113, plain, (leq(X1,X2)|~geq(X2,X1)|~ssItem(X1)|~ssItem(X2))). 0.19/0.45 cnf(i_0_169, plain, (leq(X1,X2)|~lt(X1,X2)|~ssItem(X2)|~ssItem(X1))). 0.19/0.45 cnf(i_0_178, plain, (lt(X1,X2)|~gt(X2,X1)|~ssItem(X1)|~ssItem(X2))). 0.19/0.45 cnf(i_0_59, plain, (strictorderedP(X1)|~lt(esk15_1(X1),esk16_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_72, plain, (nil=X1|ssItem(hd(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_136, plain, (X1=nil|app(X1,X2)!=nil|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_137, plain, (nil=X1|app(X2,X1)!=nil|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_24, plain, (ssList(cons(X1,X2))|~ssItem(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_23, plain, (ssList(app(X1,X2))|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_56, plain, (nil=X1|ssItem(esk14_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_63, plain, (strictorderedP(X1)|ssList(esk17_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_114, plain, (totalorderedP(X1)|~leq(esk27_1(X1),esk28_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_158, plain, (totalorderP(X1)|~leq(esk38_1(X1),esk39_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_159, plain, (totalorderP(X1)|~leq(esk39_1(X1),esk38_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_86, plain, (strictorderP(X1)|~lt(esk20_1(X1),esk21_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_62, plain, (strictorderedP(X1)|ssList(esk18_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_61, plain, (strictorderedP(X1)|ssList(esk19_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_65, plain, (strictorderedP(X1)|ssItem(esk15_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_64, plain, (strictorderedP(X1)|ssItem(esk16_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_49, plain, (equalelemsP(X1)|ssList(esk11_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_85, plain, (strictorderP(X1)|~lt(esk21_1(X1),esk20_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_112, plain, (geq(X1,X2)|~leq(X2,X1)|~ssItem(X1)|~ssItem(X2))). 0.19/0.45 cnf(i_0_177, plain, (gt(X1,X2)|~lt(X2,X1)|~ssItem(X1)|~ssItem(X2))). 0.19/0.45 cnf(i_0_48, plain, (equalelemsP(X1)|ssList(esk12_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_51, plain, (equalelemsP(X1)|ssItem(esk9_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_68, plain, (X1=nil|strictorderedP(X1)|~strictorderedP(cons(X2,X1))|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_50, plain, (equalelemsP(X1)|ssItem(esk10_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_118, plain, (totalorderedP(X1)|ssList(esk29_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_117, plain, (totalorderedP(X1)|ssList(esk30_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_123, plain, (esk32_1(X1)=esk33_1(X1)|duplicatefreeP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_116, plain, (totalorderedP(X1)|ssList(esk31_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_120, plain, (totalorderedP(X1)|ssItem(esk27_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_119, plain, (totalorderedP(X1)|ssItem(esk28_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_127, plain, (duplicatefreeP(X1)|ssList(esk34_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_126, plain, (duplicatefreeP(X1)|ssList(esk35_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_125, plain, (duplicatefreeP(X1)|ssList(esk36_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_129, plain, (duplicatefreeP(X1)|ssItem(esk32_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_128, plain, (duplicatefreeP(X1)|ssItem(esk33_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_163, plain, (totalorderP(X1)|ssList(esk40_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_162, plain, (totalorderP(X1)|ssList(esk41_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_161, plain, (totalorderP(X1)|ssList(esk42_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_165, plain, (totalorderP(X1)|ssItem(esk38_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_164, plain, (totalorderP(X1)|ssItem(esk39_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_90, plain, (strictorderP(X1)|ssList(esk22_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_89, plain, (strictorderP(X1)|ssList(esk23_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_88, plain, (strictorderP(X1)|ssList(esk24_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_92, plain, (strictorderP(X1)|ssItem(esk20_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_91, plain, (strictorderP(X1)|ssItem(esk21_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_43, plain, (cyclefreeP(X1)|ssList(esk6_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_42, plain, (cyclefreeP(X1)|ssList(esk7_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_41, plain, (cyclefreeP(X1)|ssList(esk8_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_45, plain, (cyclefreeP(X1)|ssItem(esk4_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_44, plain, (cyclefreeP(X1)|ssItem(esk5_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_78, plain, (X1=X2|neq(X2,X1)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_98, plain, (X1=X2|neq(X1,X2)|~ssItem(X2)|~ssItem(X1))). 0.19/0.45 cnf(i_0_100, plain, (X1=X2|~frontsegP(X2,X1)|~frontsegP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_105, plain, (X1=X2|~rearsegP(X2,X1)|~rearsegP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_186, plain, (cons(esk47_1(X1),nil)=X1|~singletonP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_188, plain, (singletonP(cons(X1,nil))|~ssItem(X1)|~ssList(cons(X1,nil)))). 0.19/0.45 cnf(i_0_95, plain, (cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1))). 0.19/0.45 cnf(i_0_103, plain, (hd(cons(X1,X2))=X1|~ssItem(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_144, plain, (X1=X2|~segmentP(X2,X1)|~segmentP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_102, plain, (X1=X2|~geq(X2,X1)|~geq(X1,X2)|~ssItem(X2)|~ssItem(X1))). 0.19/0.45 cnf(i_0_122, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2)|~ssItem(X2)|~ssItem(X1))). 0.19/0.45 cnf(i_0_139, plain, (tl(cons(X1,X2))=X2|~ssItem(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_109, plain, (app(cons(X1,nil),X2)=cons(X1,X2)|~ssItem(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_16, plain, (ssList(esk1_2(X1,X2))|~segmentP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_17, plain, (ssList(esk2_2(X1,X2))|~segmentP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_57, plain, (cons(esk14_1(X1),esk13_1(X1))=X1|nil=X1|~ssList(X1))). 0.19/0.45 cnf(i_0_39, plain, (cyclefreeP(X1)|leq(esk4_1(X1),esk5_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_28, plain, (ssList(esk3_2(X1,X2))|~frontsegP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_155, plain, (ssList(esk37_2(X1,X2))|~rearsegP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_180, plain, (ssList(esk45_2(X1,X2))|~memberP(X1,X2)|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_181, plain, (ssList(esk46_2(X1,X2))|~memberP(X1,X2)|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_38, plain, (cyclefreeP(X1)|leq(esk5_1(X1),esk4_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_80, plain, (X1=nil|totalorderedP(X1)|~totalorderedP(cons(X2,X1))|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_141, plain, (X1=X2|app(X3,X1)!=app(X3,X2)|~ssList(X2)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_11, plain, (X1=X2|app(X1,X3)!=app(X2,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_170, plain, (X1=X2|lt(X1,X2)|~leq(X1,X2)|~ssItem(X2)|~ssItem(X1))). 0.19/0.45 cnf(i_0_132, plain, (nil=X1|X2=nil|X2=X1|hd(X2)!=hd(X1)|tl(X2)!=tl(X1)|~ssList(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_7, plain, (hd(app(X1,X2))=hd(X1)|X1=nil|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_14, plain, (X1=X2|cons(X3,X2)!=cons(X4,X1)|~ssItem(X4)|~ssItem(X3)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_145, plain, (tl(app(X1,X2))=app(tl(X1),X2)|nil=X1|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_71, plain, (X1=nil|strictorderedP(cons(X2,X1))|~lt(X2,hd(X1))|~strictorderedP(X1)|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_67, plain, (X1=nil|lt(X2,hd(X1))|~strictorderedP(cons(X2,X1))|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_15, plain, (X1=X2|cons(X1,X3)!=cons(X2,X4)|~ssItem(X2)|~ssItem(X1)|~ssList(X4)|~ssList(X3))). 0.19/0.45 cnf(i_0_157, plain, (rearsegP(app(X1,X2),X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_29, plain, (frontsegP(app(X1,X2),X1)|~ssList(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_33, plain, (memberP(cons(X1,X2),X1)|~ssItem(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_2, plain, (X1=X2|~ssItem(X2)|~ssItem(X1)|~frontsegP(cons(X2,X3),cons(X1,X4))|~ssList(X4)|~ssList(X3))). 0.19/0.45 cnf(i_0_108, plain, (frontsegP(X1,X2)|~frontsegP(X3,X2)|~frontsegP(X1,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_75, plain, (rearsegP(X1,X2)|~rearsegP(X3,X2)|~rearsegP(X1,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_156, plain, (app(esk37_2(X1,X2),X2)=X1|~rearsegP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_189, plain, (segmentP(X1,X2)|~segmentP(X3,X2)|~segmentP(X1,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_184, plain, (lt(X1,X2)|~lt(X3,X2)|~lt(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))). 0.19/0.45 cnf(i_0_195, negated_conjecture, (app(X1,cons(X2,nil))!=esk48_0|app(cons(X3,nil),X4)!=esk53_0|~lt(X2,X3)|~ssItem(X2)|~ssItem(X3)|~ssList(X1)|~ssList(X4))). 0.19/0.45 cnf(i_0_194, negated_conjecture, (app(X1,cons(X2,nil))!=esk52_0|app(cons(X3,nil),X4)!=esk48_0|~lt(X2,X3)|~ssItem(X3)|~ssItem(X2)|~ssList(X4)|~ssList(X1))). 0.19/0.45 cnf(i_0_27, plain, (app(X1,esk3_2(X2,X1))=X2|~frontsegP(X2,X1)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_81, plain, (X1=nil|leq(X2,hd(X1))|~totalorderedP(cons(X2,X1))|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_12, plain, (geq(X1,X2)|~geq(X3,X2)|~geq(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))). 0.19/0.45 cnf(i_0_13, plain, (gt(X1,X2)|~gt(X3,X2)|~gt(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))). 0.19/0.45 cnf(i_0_167, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))). 0.19/0.45 cnf(i_0_172, plain, (lt(X1,X2)|~lt(X3,X2)|~leq(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))). 0.19/0.45 cnf(i_0_76, plain, (app(cons(X1,X2),X3)=cons(X1,app(X2,X3))|~ssItem(X1)|~ssList(X2)|~ssList(X3))). 0.19/0.45 cnf(i_0_190, plain, (app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X3)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_4, plain, (frontsegP(app(X1,X2),X3)|~frontsegP(X1,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_34, plain, (memberP(cons(X1,X2),X3)|~memberP(X2,X3)|~ssItem(X1)|~ssItem(X3)|~ssList(X2))). 0.19/0.45 cnf(i_0_19, plain, (segmentP(app(app(X1,X2),X3),X2)|~ssList(app(app(X1,X2),X3))|~ssList(X3)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_150, plain, (memberP(app(X1,X2),X3)|~memberP(X2,X3)|~ssItem(X3)|~ssList(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_149, plain, (memberP(app(X1,X2),X3)|~memberP(X1,X3)|~ssItem(X3)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_133, plain, (rearsegP(app(X1,X2),X3)|~rearsegP(X2,X3)|~ssList(X1)|~ssList(X3)|~ssList(X2))). 0.19/0.45 cnf(i_0_35, plain, (X1=X2|memberP(X3,X2)|~memberP(cons(X1,X3),X2)|~ssItem(X2)|~ssItem(X1)|~ssList(X3))). 0.19/0.45 cnf(i_0_3, plain, (frontsegP(X1,X2)|~ssItem(X3)|~ssItem(X4)|~frontsegP(cons(X4,X1),cons(X3,X2))|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_82, plain, (X1=nil|totalorderedP(cons(X2,X1))|~leq(X2,hd(X1))|~totalorderedP(X1)|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_54, plain, (segmentP(app(app(X1,X2),X3),X4)|~segmentP(X2,X4)|~ssList(X3)|~ssList(X1)|~ssList(X4)|~ssList(X2))). 0.19/0.45 cnf(i_0_179, plain, (memberP(app(X1,cons(X2,X3)),X2)|~ssItem(X2)|~ssList(app(X1,cons(X2,X3)))|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_148, plain, (memberP(X1,X2)|memberP(X3,X2)|~memberP(app(X1,X3),X2)|~ssItem(X2)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_1, plain, (frontsegP(cons(X1,X2),cons(X1,X3))|~ssItem(X1)|~frontsegP(X2,X3)|~ssList(X3)|~ssList(X2))). 0.19/0.45 cnf(i_0_52, plain, (X1=X2|~equalelemsP(app(X3,cons(X1,cons(X2,X4))))|~ssItem(X2)|~ssItem(X1)|~ssList(app(X3,cons(X1,cons(X2,X4))))|~ssList(X4)|~ssList(X3))). 0.19/0.45 cnf(i_0_130, plain, (~duplicatefreeP(app(app(X1,cons(X2,X3)),cons(X2,X4)))|~ssItem(X2)|~ssList(app(app(X1,cons(X2,X3)),cons(X2,X4)))|~ssList(X4)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_47, plain, (app(esk11_1(X1),cons(esk9_1(X1),cons(esk10_1(X1),esk12_1(X1))))=X1|equalelemsP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_18, plain, (app(app(esk1_2(X1,X2),X2),esk2_2(X1,X2))=X1|~segmentP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_58, plain, (lt(X1,X2)|~strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))|~ssItem(X2)|~ssItem(X1)|~ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))|~ssList(X5)|~ssList(X4)|~ssList(X3))). 0.19/0.45 cnf(i_0_182, plain, (app(esk45_2(X1,X2),cons(X2,esk46_2(X1,X2)))=X1|~memberP(X1,X2)|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_115, plain, (app(app(esk29_1(X1),cons(esk27_1(X1),esk30_1(X1))),cons(esk28_1(X1),esk31_1(X1)))=X1|totalorderedP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_60, plain, (app(app(esk17_1(X1),cons(esk15_1(X1),esk18_1(X1))),cons(esk16_1(X1),esk19_1(X1)))=X1|strictorderedP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_121, plain, (leq(X1,X2)|~totalorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))|~ssItem(X2)|~ssItem(X1)|~ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))|~ssList(X5)|~ssList(X4)|~ssList(X3))). 0.19/0.45 cnf(i_0_37, plain, (~cyclefreeP(app(app(X1,cons(X2,X3)),cons(X4,X5)))|~leq(X4,X2)|~leq(X2,X4)|~ssItem(X4)|~ssItem(X2)|~ssList(app(app(X1,cons(X2,X3)),cons(X4,X5)))|~ssList(X5)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_40, plain, (app(app(esk6_1(X1),cons(esk4_1(X1),esk7_1(X1))),cons(esk5_1(X1),esk8_1(X1)))=X1|cyclefreeP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_84, plain, (lt(X1,X2)|lt(X2,X1)|~strictorderP(app(app(X3,cons(X2,X4)),cons(X1,X5)))|~ssItem(X1)|~ssItem(X2)|~ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))|~ssList(X5)|~ssList(X4)|~ssList(X3))). 0.19/0.45 cnf(i_0_87, 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))). 0.19/0.45 cnf(i_0_166, plain, (leq(X1,X2)|leq(X2,X1)|~totalorderP(app(app(X3,cons(X2,X4)),cons(X1,X5)))|~ssItem(X1)|~ssItem(X2)|~ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))|~ssList(X5)|~ssList(X4)|~ssList(X3))). 0.19/0.45 cnf(i_0_124, plain, (app(app(esk34_1(X1),cons(esk32_1(X1),esk35_1(X1))),cons(esk33_1(X1),esk36_1(X1)))=X1|duplicatefreeP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_160, plain, (app(app(esk40_1(X1),cons(esk38_1(X1),esk41_1(X1))),cons(esk39_1(X1),esk42_1(X1)))=X1|totalorderP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_1595, plain, (X273=X273)). 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.19/0.45 # Begin printing tableau 0.19/0.45 # Found 8 steps 0.19/0.45 cnf(i_0_1595, plain, (app(nil,nil)=app(nil,nil)), inference(start_rule)). 0.19/0.45 cnf(i_0_2310, plain, (app(nil,nil)=app(nil,nil)), inference(extension_rule, [i_0_141])). 0.19/0.45 cnf(i_0_2659, plain, (~ssList(nil)), inference(closure_rule, [i_0_31])). 0.19/0.45 cnf(i_0_2660, plain, (~ssList(nil)), inference(closure_rule, [i_0_31])). 0.19/0.45 cnf(i_0_2661, plain, (~ssList(nil)), inference(closure_rule, [i_0_31])). 0.19/0.45 cnf(i_0_2657, plain, (nil=nil), inference(extension_rule, [i_0_1598])). 0.19/0.45 cnf(i_0_3327, plain, (nil!=app(nil,nil)), inference(closure_rule, [i_0_138])). 0.19/0.45 cnf(i_0_3325, plain, (nil=app(nil,nil)), inference(etableau_closure_rule, [i_0_3325, ...])). 0.19/0.45 # End printing tableau 0.19/0.45 # SZS output end 0.19/0.45 # Branches closed with saturation will be marked with an "s" 0.19/0.45 59, plain, (strictorderedP(X1)|~lt(esk15_1(X1),esk16_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_72, plain, (nil=X1|ssItem(hd(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_136, plain, (X1=nil|app(X1,X2)!=nil|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_137, plain, (nil=X1|app(X2,X1)!=nil|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_24, plain, (ssList(cons(X1,X2))|~ssItem(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_23, plain, (ssList(app(X1,X2))|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_56, plain, (nil=X1|ssItem(esk14_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_63, plain, (strictorderedP(X1)|ssList(esk17_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_114, plain, (totalorderedP(X1)|~leq(esk27_1(X1),esk28_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_158, plain, (totalorderP(X1)|~leq(esk38_1(X1),esk39_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_159, plain, (totalorderP(X1)|~leq(esk39_1(X1),esk38_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_86, plain, (strictorderP(X1)|~lt(esk20_1(X1),esk21_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_62, plain, (strictorderedP(X1)|ssList(esk18_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_61, plain, (strictorderedP(X1)|ssList(esk19_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_65, plain, (strictorderedP(X1)|ssItem(esk15_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_64, plain, (strictorderedP(X1)|ssItem(esk16_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_49, plain, (equalelemsP(X1)|ssList(esk11_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_85, plain, (strictorderP(X1)|~lt(esk21_1(X1),esk20_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_112, plain, (geq(X1,X2)|~leq(X2,X1)|~ssItem(X1)|~ssItem(X2))). 0.19/0.45 cnf(i_0_177, plain, (gt(X1,X2)|~lt(X2,X1)|~ssItem(X1)|~ssItem(X2))). 0.19/0.45 cnf(i_0_48, plain, (equalelemsP(X1)|ssList(esk12_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_51, plain, (equalelemsP(X1)|ssItem(esk9_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_68, plain, (X1=nil|strictorderedP(X1)|~strictorderedP(cons(X2,X1))|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_50, plain, (equalelemsP(X1)|ssItem(esk10_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_118, plain, (totalorderedP(X1)|ssList(esk29_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_117, plain, (totalorderedP(X1)|ssList(esk30_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_123, plain, (esk32_1(X1)=esk33_1(X1)|duplicatefreeP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_116, plain, (totalorderedP(X1)|ssList(esk31_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_120, plain, (totalorderedP(X1)|ssItem(esk27_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_119, plain, (totalorderedP(X1)|ssItem(esk28_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_127, plain, (duplicatefreeP(X1)|ssList(esk34_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_126, plain, (duplicatefreeP(X1)|ssList(esk35_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_125, plain, (duplicatefreeP(X1)|ssList(esk36_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_129, plain, (duplicatefreeP(X1)|ssItem(esk32_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_128, plain, (duplicatefreeP(X1)|ssItem(esk33_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_163, plain, (totalorderP(X1)|ssList(esk40_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_162, plain, (totalorderP(X1)|ssList(esk41_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_161, plain, (totalorderP(X1)|ssList(esk42_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_165, plain, (totalorderP(X1)|ssItem(esk38_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_164, plain, (totalorderP(X1)|ssItem(esk39_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_90, plain, (strictorderP(X1)|ssList(esk22_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_89, plain, (strictorderP(X1)|ssList(esk23_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_88, plain, (strictorderP(X1)|ssList(esk24_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_92, plain, (strictorderP(X1)|ssItem(esk20_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_91, plain, (strictorderP(X1)|ssItem(esk21_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_43, plain, (cyclefreeP(X1)|ssList(esk6_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_42, plain, (cyclefreeP(X1)|ssList(esk7_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_41, plain, (cyclefreeP(X1)|ssList(esk8_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_45, plain, (cyclefreeP(X1)|ssItem(esk4_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_44, plain, (cyclefreeP(X1)|ssItem(esk5_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_78, plain, (X1=X2|neq(X2,X1)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_98, plain, (X1=X2|neq(X1,X2)|~ssItem(X2)|~ssItem(X1))). 0.19/0.45 cnf(i_0_100, plain, (X1=X2|~frontsegP(X2,X1)|~frontsegP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_105, plain, (X1=X2|~rearsegP(X2,X1)|~rearsegP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_186, plain, (cons(esk47_1(X1),nil)=X1|~singletonP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_188, plain, (singletonP(cons(X1,nil))|~ssItem(X1)|~ssList(cons(X1,nil)))). 0.19/0.45 cnf(i_0_95, plain, (cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1))). 0.19/0.45 cnf(i_0_103, plain, (hd(cons(X1,X2))=X1|~ssItem(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_144, plain, (X1=X2|~segmentP(X2,X1)|~segmentP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_102, plain, (X1=X2|~geq(X2,X1)|~geq(X1,X2)|~ssItem(X2)|~ssItem(X1))). 0.19/0.45 cnf(i_0_122, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2)|~ssItem(X2)|~ssItem(X1))). 0.19/0.45 cnf(i_0_139, plain, (tl(cons(X1,X2))=X2|~ssItem(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_109, plain, (app(cons(X1,nil),X2)=cons(X1,X2)|~ssItem(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_16, plain, (ssList(esk1_2(X1,X2))|~segmentP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_17, plain, (ssList(esk2_2(X1,X2))|~segmentP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_57, plain, (cons(esk14_1(X1),esk13_1(X1))=X1|nil=X1|~ssList(X1))). 0.19/0.45 cnf(i_0_39, plain, (cyclefreeP(X1)|leq(esk4_1(X1),esk5_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_28, plain, (ssList(esk3_2(X1,X2))|~frontsegP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_155, plain, (ssList(esk37_2(X1,X2))|~rearsegP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_180, plain, (ssList(esk45_2(X1,X2))|~memberP(X1,X2)|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_181, plain, (ssList(esk46_2(X1,X2))|~memberP(X1,X2)|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_38, plain, (cyclefreeP(X1)|leq(esk5_1(X1),esk4_1(X1))|~ssList(X1))). 0.19/0.45 cnf(i_0_80, plain, (X1=nil|totalorderedP(X1)|~totalorderedP(cons(X2,X1))|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_141, plain, (X1=X2|app(X3,X1)!=app(X3,X2)|~ssList(X2)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_11, plain, (X1=X2|app(X1,X3)!=app(X2,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_170, plain, (X1=X2|lt(X1,X2)|~leq(X1,X2)|~ssItem(X2)|~ssItem(X1))). 0.19/0.45 cnf(i_0_132, plain, (nil=X1|X2=nil|X2=X1|hd(X2)!=hd(X1)|tl(X2)!=tl(X1)|~ssList(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_7, plain, (hd(app(X1,X2))=hd(X1)|X1=nil|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_14, plain, (X1=X2|cons(X3,X2)!=cons(X4,X1)|~ssItem(X4)|~ssItem(X3)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_145, plain, (tl(app(X1,X2))=app(tl(X1),X2)|nil=X1|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_71, plain, (X1=nil|strictorderedP(cons(X2,X1))|~lt(X2,hd(X1))|~strictorderedP(X1)|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_67, plain, (X1=nil|lt(X2,hd(X1))|~strictorderedP(cons(X2,X1))|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_15, plain, (X1=X2|cons(X1,X3)!=cons(X2,X4)|~ssItem(X2)|~ssItem(X1)|~ssList(X4)|~ssList(X3))). 0.19/0.45 cnf(i_0_157, plain, (rearsegP(app(X1,X2),X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_29, plain, (frontsegP(app(X1,X2),X1)|~ssList(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_33, plain, (memberP(cons(X1,X2),X1)|~ssItem(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_2, plain, (X1=X2|~ssItem(X2)|~ssItem(X1)|~frontsegP(cons(X2,X3),cons(X1,X4))|~ssList(X4)|~ssList(X3))). 0.19/0.45 cnf(i_0_108, plain, (frontsegP(X1,X2)|~frontsegP(X3,X2)|~frontsegP(X1,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_75, plain, (rearsegP(X1,X2)|~rearsegP(X3,X2)|~rearsegP(X1,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_156, plain, (app(esk37_2(X1,X2),X2)=X1|~rearsegP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_189, plain, (segmentP(X1,X2)|~segmentP(X3,X2)|~segmentP(X1,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_184, plain, (lt(X1,X2)|~lt(X3,X2)|~lt(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))). 0.19/0.45 cnf(i_0_195, negated_conjecture, (app(X1,cons(X2,nil))!=esk48_0|app(cons(X3,nil),X4)!=esk53_0|~lt(X2,X3)|~ssItem(X2)|~ssItem(X3)|~ssList(X1)|~ssList(X4))). 0.19/0.45 cnf(i_0_194, negated_conjecture, (app(X1,cons(X2,nil))!=esk52_0|app(cons(X3,nil),X4)!=esk48_0|~lt(X2,X3)|~ssItem(X3)|~ssItem(X2)|~ssList(X4)|~ssList(X1))). 0.19/0.45 cnf(i_0_27, plain, (app(X1,esk3_2(X2,X1))=X2|~frontsegP(X2,X1)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_81, plain, (X1=nil|leq(X2,hd(X1))|~totalorderedP(cons(X2,X1))|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_12, plain, (geq(X1,X2)|~geq(X3,X2)|~geq(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))). 0.19/0.45 cnf(i_0_13, plain, (gt(X1,X2)|~gt(X3,X2)|~gt(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))). 0.19/0.45 cnf(i_0_167, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))). 0.19/0.45 cnf(i_0_172, plain, (lt(X1,X2)|~lt(X3,X2)|~leq(X1,X3)|~ssItem(X2)|~ssItem(X3)|~ssItem(X1))). 0.19/0.45 cnf(i_0_76, plain, (app(cons(X1,X2),X3)=cons(X1,app(X2,X3))|~ssItem(X1)|~ssList(X2)|~ssList(X3))). 0.19/0.45 cnf(i_0_190, plain, (app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X3)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_4, plain, (frontsegP(app(X1,X2),X3)|~frontsegP(X1,X3)|~ssList(X2)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_34, plain, (memberP(cons(X1,X2),X3)|~memberP(X2,X3)|~ssItem(X1)|~ssItem(X3)|~ssList(X2))). 0.19/0.45 cnf(i_0_19, plain, (segmentP(app(app(X1,X2),X3),X2)|~ssList(app(app(X1,X2),X3))|~ssList(X3)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_150, plain, (memberP(app(X1,X2),X3)|~memberP(X2,X3)|~ssItem(X3)|~ssList(X1)|~ssList(X2))). 0.19/0.45 cnf(i_0_149, plain, (memberP(app(X1,X2),X3)|~memberP(X1,X3)|~ssItem(X3)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_133, plain, (rearsegP(app(X1,X2),X3)|~rearsegP(X2,X3)|~ssList(X1)|~ssList(X3)|~ssList(X2))). 0.19/0.45 cnf(i_0_35, plain, (X1=X2|memberP(X3,X2)|~memberP(cons(X1,X3),X2)|~ssItem(X2)|~ssItem(X1)|~ssList(X3))). 0.19/0.45 cnf(i_0_3, plain, (frontsegP(X1,X2)|~ssItem(X3)|~ssItem(X4)|~frontsegP(cons(X4,X1),cons(X3,X2))|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_82, plain, (X1=nil|totalorderedP(cons(X2,X1))|~leq(X2,hd(X1))|~totalorderedP(X1)|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_54, plain, (segmentP(app(app(X1,X2),X3),X4)|~segmentP(X2,X4)|~ssList(X3)|~ssList(X1)|~ssList(X4)|~ssList(X2))). 0.19/0.45 cnf(i_0_179, plain, (memberP(app(X1,cons(X2,X3)),X2)|~ssItem(X2)|~ssList(app(X1,cons(X2,X3)))|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_148, plain, (memberP(X1,X2)|memberP(X3,X2)|~memberP(app(X1,X3),X2)|~ssItem(X2)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_1, plain, (frontsegP(cons(X1,X2),cons(X1,X3))|~ssItem(X1)|~frontsegP(X2,X3)|~ssList(X3)|~ssList(X2))). 0.19/0.45 cnf(i_0_52, plain, (X1=X2|~equalelemsP(app(X3,cons(X1,cons(X2,X4))))|~ssItem(X2)|~ssItem(X1)|~ssList(app(X3,cons(X1,cons(X2,X4))))|~ssList(X4)|~ssList(X3))). 0.19/0.45 cnf(i_0_130, plain, (~duplicatefreeP(app(app(X1,cons(X2,X3)),cons(X2,X4)))|~ssItem(X2)|~ssList(app(app(X1,cons(X2,X3)),cons(X2,X4)))|~ssList(X4)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_47, plain, (app(esk11_1(X1),cons(esk9_1(X1),cons(esk10_1(X1),esk12_1(X1))))=X1|equalelemsP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_18, plain, (app(app(esk1_2(X1,X2),X2),esk2_2(X1,X2))=X1|~segmentP(X1,X2)|~ssList(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_58, plain, (lt(X1,X2)|~strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))|~ssItem(X2)|~ssItem(X1)|~ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))|~ssList(X5)|~ssList(X4)|~ssList(X3))). 0.19/0.45 cnf(i_0_182, plain, (app(esk45_2(X1,X2),cons(X2,esk46_2(X1,X2)))=X1|~memberP(X1,X2)|~ssItem(X2)|~ssList(X1))). 0.19/0.45 cnf(i_0_115, plain, (app(app(esk29_1(X1),cons(esk27_1(X1),esk30_1(X1))),cons(esk28_1(X1),esk31_1(X1)))=X1|totalorderedP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_60, plain, (app(app(esk17_1(X1),cons(esk15_1(X1),esk18_1(X1))),cons(esk16_1(X1),esk19_1(X1)))=X1|strictorderedP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_121, plain, (leq(X1,X2)|~totalorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))|~ssItem(X2)|~ssItem(X1)|~ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))|~ssList(X5)|~ssList(X4)|~ssList(X3))). 0.19/0.45 cnf(i_0_37, plain, (~cyclefreeP(app(app(X1,cons(X2,X3)),cons(X4,X5)))|~leq(X4,X2)|~leq(X2,X4)|~ssItem(X4)|~ssItem(X2)|~ssList(app(app(X1,cons(X2,X3)),cons(X4,X5)))|~ssList(X5)|~ssList(X3)|~ssList(X1))). 0.19/0.45 cnf(i_0_40, plain, (app(app(esk6_1(X1),cons(esk4_1(X1),esk7_1(X1))),cons(esk5_1(X1),esk8_1(X1)))=X1|cyclefreeP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_84, plain, (lt(X1,X2)|lt(X2,X1)|~strictorderP(app(app(X3,cons(X2,X4)),cons(X1,X5)))|~ssItem(X1)|~ssItem(X2)|~ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))|~ssList(X5)|~ssList(X4)|~ssList(X3))). 0.19/0.45 cnf(i_0_87, 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))). 0.19/0.45 cnf(i_0_166, plain, (leq(X1,X2)|leq(X2,X1)|~totalorderP(app(app(X3,cons(X2,X4)),cons(X1,X5)))|~ssItem(X1)|~ssItem(X2)|~ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))|~ssList(X5)|~ssList(X4)|~ssList(X3))). 0.19/0.45 cnf(i_0_124, plain, (app(app(esk34_1(X1),cons(esk32_1(X1),esk35_1(X1))),cons(esk33_1(X1),esk36_1(X1)))=X1|duplicatefreeP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_160, plain, (app(app(esk40_1(X1),cons(esk38_1(X1),esk41_1(X1))),cons(esk39_1(X1),esk42_1(X1)))=X1|totalorderP(X1)|~ssList(X1))). 0.19/0.45 cnf(i_0_1595, plain, (X273=X273)). 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.19/0.45 # Begin printing tableau 0.19/0.45 # Found 8 steps 0.19/0.45 cnf(i_0_1595, plain, (app(nil,nil)=app(nil,nil)), inference(start_rule)). 0.19/0.45 cnf(i_0_2310, plain, (app(nil,nil)=app(nil,nil)), inference(extension_rule, [i_0_141])). 0.19/0.45 cnf(i_0_2659, plain, (~ssList(nil)), inference(closure_rule, [i_0_31])). 0.19/0.45 cnf(i_0_2660, plain, (~ssList(nil)), inference(closure_rule, [i_0_31])). 0.19/0.45 cnf(i_0_2661, plain, (~ssList(nil)), inference(closure_rule, [i_0_31])). 0.19/0.45 cnf(i_0_2657, plain, (nil=nil), inference(extension_rule, [i_0_1598])). 0.19/0.45 cnf(i_0_3327, plain, (nil!=app(nil,nil)), inference(closure_rule, [i_0_138])). 0.19/0.45 cnf(i_0_3325, plain, (nil=app(nil,nil)), inference(etableau_closure_rule, [i_0_3325, ...])). 0.19/0.45 # End printing tableau 0.19/0.45 # SZS output end 0.19/0.45 # Branches closed with saturation will be marked with an "s" 0.19/0.46 # Child (12014) has found a proof. 0.19/0.46 0.19/0.46 # Proof search is over... 0.19/0.46 # Freeing feature tree 0.19/0.46 EOF