%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX222-1 : TPTP v9.3.0. Released v9.3.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 : n005.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 : 300s % DateTime : Tue May 5 07:00:45 PM UTC 2026 % Result : Unsatisfiable 0.20s 0.43s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX222-1 : TPTP v9.3.0. Released v9.3.0. % 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.34 % Computer : n005.cluster.edu % 0.15/0.34 % Model : x86_64 x86_64 % 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.34 % Memory : 8042.1875MB % 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.34 % CPULimit : 300 % 0.15/0.34 % WCLimit : 300 % 0.15/0.34 % DateTime : Tue May 5 12:34:30 EDT 2026 % 0.15/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 54 Number of unprocessed: 53 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 53 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 1 conjectures. % 0.20/0.38 # There are 1 start rule candidates: % 0.20/0.38 # Found 48 unit axioms. % 0.20/0.38 # 1 start rule tableaux created. % 0.20/0.38 # 5 extension rule candidate clauses % 0.20/0.38 # 48 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.38 # Creating equality axioms % 0.20/0.38 # Ran out of tableaux, making start rules for all clauses % 0.20/0.38 # Returning from population with 85 new_tableaux and 0 remaining starting tableaux. % 0.20/0.38 # We now have 85 tableaux to operate on % 0.20/0.43 # There were 1 total branch saturation attempts. % 0.20/0.43 # There were 0 of these attempts blocked. % 0.20/0.43 # There were 0 deferred branch saturation attempts. % 0.20/0.43 # There were 0 free duplicated saturations. % 0.20/0.43 # There were 1 total successful branch saturations. % 0.20/0.43 # There were 0 successful branch saturations in interreduction. % 0.20/0.43 # There were 0 successful branch saturations on the branch. % 0.20/0.43 # There were 1 successful branch saturations after the branch. % 0.20/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # Begin clausification derivation % 0.20/0.43 % 0.20/0.43 # End clausification derivation % 0.20/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.43 cnf(i_0_60, plain, (notb(bfalse)=btrue)). % 0.20/0.43 cnf(i_0_59, plain, (notb(btrue)=bfalse)). % 0.20/0.43 cnf(i_0_84, plain, (eq4(bfalse,btrue)=bfalse)). % 0.20/0.43 cnf(i_0_85, plain, (eq4(btrue,bfalse)=bfalse)). % 0.20/0.43 cnf(i_0_78, plain, (eq(a,b)=bfalse)). % 0.20/0.43 cnf(i_0_70, plain, (nf(var(X1))=btrue)). % 0.20/0.43 cnf(i_0_80, plain, (eq(b,a)=bfalse)). % 0.20/0.43 cnf(i_0_108, plain, (eq(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_111, plain, (eq4(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_110, plain, (eq3(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_64, plain, (andb(btrue,X1)=X1)). % 0.20/0.43 cnf(i_0_65, plain, (andb(bfalse,X1)=bfalse)). % 0.20/0.43 cnf(i_0_79, plain, (eq(a,c)=bfalse)). % 0.20/0.43 cnf(i_0_81, plain, (eq(b,c)=bfalse)). % 0.20/0.43 cnf(i_0_82, plain, (eq(c,a)=bfalse)). % 0.20/0.43 cnf(i_0_83, plain, (eq(c,b)=bfalse)). % 0.20/0.43 cnf(i_0_61, plain, (index(nil,X1)=nothing)). % 0.20/0.43 cnf(i_0_69, plain, (nf(lam(X1))=nf(X1))). % 0.20/0.43 cnf(i_0_57, plain, (aux(X1,X2,X3,nothing)=bfalse)). % 0.20/0.43 cnf(i_0_105, plain, (eq3(lam(X1),var(X2))=bfalse)). % 0.20/0.43 cnf(i_0_107, plain, (eq3(var(X1),lam(X2))=bfalse)). % 0.20/0.43 cnf(i_0_94, plain, (eq(a,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_95, plain, (eq(b,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_91, plain, (eq(arr(X1,X2),a)=bfalse)). % 0.20/0.43 cnf(i_0_92, plain, (eq(arr(X1,X2),b)=bfalse)). % 0.20/0.43 cnf(i_0_87, plain, (eq3(var(zero),var(suc(X1)))=bfalse)). % 0.20/0.43 cnf(i_0_73, plain, (tc(X1,lam(X2),a)=bfalse)). % 0.20/0.43 cnf(i_0_96, plain, (eq(c,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_93, plain, (eq(arr(X1,X2),c)=bfalse)). % 0.20/0.43 cnf(i_0_74, plain, (tc(X1,lam(X2),b)=bfalse)). % 0.20/0.43 cnf(i_0_75, plain, (tc(X1,lam(X2),c)=bfalse)). % 0.20/0.43 cnf(i_0_66, plain, (nf(app(lam(X1),X2,X3))=bfalse)). % 0.20/0.43 cnf(i_0_88, plain, (eq3(var(suc(X1)),var(zero))=bfalse)). % 0.20/0.43 cnf(i_0_62, plain, (index(cons(X1,X2),zero)=just(X1))). % 0.20/0.43 cnf(i_0_100, plain, (eq3(lam(X1),lam(X2))=eq3(X1,X2))). % 0.20/0.43 cnf(i_0_63, plain, (index(cons(X1,X2),suc(X3))=index(X2,X3))). % 0.20/0.43 cnf(i_0_104, plain, (eq3(lam(X1),app(X2,X3,X4))=bfalse)). % 0.20/0.43 cnf(i_0_58, plain, (aux(X1,X2,X3,just(X4))=eq(X4,X2))). % 0.20/0.43 cnf(i_0_106, plain, (eq3(var(X1),app(X2,X3,X4))=bfalse)). % 0.20/0.43 cnf(i_0_102, plain, (eq3(app(X1,X2,X3),lam(X4))=bfalse)). % 0.20/0.43 cnf(i_0_103, plain, (eq3(app(X1,X2,X3),var(X4))=bfalse)). % 0.20/0.43 cnf(i_0_72, plain, (tc(cons(X1,X2),X3,X4)=tc(X2,lam(X3),arr(X1,X4)))). % 0.20/0.43 cnf(i_0_68, plain, (nf(app(var(X1),X2,X3))=nf(X2))). % 0.20/0.43 cnf(i_0_76, plain, (aux(X1,X2,X3,index(X1,X3))=tc(X1,var(X3),X2))). % 0.20/0.43 cnf(i_0_86, plain, (eq3(var(suc(X1)),var(suc(X2)))=eq3(var(X1),var(X2)))). % 0.20/0.43 cnf(i_0_71, plain, (andb(tc(X1,X2,arr(X3,X4)),tc(X1,X5,X3))=tc(X1,app(X2,X5,X3),X4))). % 0.20/0.43 cnf(i_0_67, plain, (nf(app(app(X1,X2,X3),X4,X5))=andb(nf(app(X1,X2,X3)),nf(X4)))). % 0.20/0.43 cnf(i_0_112, negated_conjecture, (eq4(notb(andb(nf(X1),tc(nil,X1,arr(a,arr(b,b))))),bfalse)!=btrue)). % 0.20/0.43 cnf(i_0_89, plain, (eq(arr(X1,X2),arr(X3,X4))=bfalse|eq(X1,X3)!=bfalse)). % 0.20/0.43 cnf(i_0_90, plain, (eq(arr(X1,X2),arr(X3,X4))=eq(X2,X4)|eq(X1,X3)!=btrue)). % 0.20/0.43 cnf(i_0_97, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=bfalse|eq3(X1,X4)!=bfalse)). % 0.20/0.43 cnf(i_0_98, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=bfalse|eq3(X1,X4)!=btrue|eq3(X2,X5)!=bfalse)). % 0.20/0.43 cnf(i_0_99, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=eq(X3,X6)|eq3(X2,X5)!=btrue|eq3(X1,X4)!=btrue)). % 0.20/0.43 cnf(i_0_126, plain, (X7=X7)). % 0.20/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.43 # Begin printing tableau % 0.20/0.43 # Found 6 steps % 0.20/0.43 cnf(i_0_60, plain, (notb(bfalse)=btrue), inference(start_rule)). % 0.20/0.43 cnf(i_0_146, plain, (notb(bfalse)=btrue), inference(extension_rule, [i_0_144])). % 0.20/0.43 cnf(i_0_267, plain, (notb(bfalse)!=btrue), inference(closure_rule, [i_0_60])). % 0.20/0.43 cnf(i_0_266, plain, (eq4(notb(bfalse),notb(bfalse))=eq4(btrue,btrue)), inference(extension_rule, [i_0_129])). % 0.20/0.43 cnf(i_0_290, plain, (eq4(btrue,btrue)!=btrue), inference(closure_rule, [i_0_111])). % 0.20/0.43 cnf(i_0_288, plain, (eq4(notb(bfalse),notb(bfalse))=btrue), inference(etableau_closure_rule, [i_0_288, ...])). % 0.20/0.43 # End printing tableau % 0.20/0.43 # SZS output end % 0.20/0.43 # Branches closed with saturation will be marked with an "s" % 0.20/0.43 # There were 1 total branch saturation attempts. % 0.20/0.43 # There were 0 of these attempts blocked. % 0.20/0.43 # There were 0 deferred branch saturation attempts. % 0.20/0.43 # There were 0 free duplicated saturations. % 0.20/0.43 # There were 1 total successful branch saturations. % 0.20/0.43 # There were 0 successful branch saturations in interreduction. % 0.20/0.43 # There were 0 successful branch saturations on the branch. % 0.20/0.43 # There were 1 successful branch saturations after the branch. % 0.20/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # Begin clausification derivation % 0.20/0.43 % 0.20/0.43 # End clausification derivation % 0.20/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.43 cnf(i_0_60, plain, (notb(bfalse)=btrue)). % 0.20/0.43 cnf(i_0_59, plain, (notb(btrue)=bfalse)). % 0.20/0.43 cnf(i_0_84, plain, (eq4(bfalse,btrue)=bfalse)). % 0.20/0.43 cnf(i_0_85, plain, (eq4(btrue,bfalse)=bfalse)). % 0.20/0.43 cnf(i_0_78, plain, (eq(a,b)=bfalse)). % 0.20/0.43 cnf(i_0_70, plain, (nf(var(X1))=btrue)). % 0.20/0.43 cnf(i_0_80, plain, (eq(b,a)=bfalse)). % 0.20/0.43 cnf(i_0_108, plain, (eq(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_111, plain, (eq4(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_110, plain, (eq3(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_64, plain, (andb(btrue,X1)=X1)). % 0.20/0.43 cnf(i_0_65, plain, (andb(bfalse,X1)=bfalse)). % 0.20/0.43 cnf(i_0_79, plain, (eq(a,c)=bfalse)). % 0.20/0.43 cnf(i_0_81, plain, (eq(b,c)=bfalse)). % 0.20/0.43 cnf(i_0_82, plain, (eq(c,a)=bfalse)). % 0.20/0.43 cnf(i_0_83, plain, (eq(c,b)=bfalse)). % 0.20/0.43 cnf(i_0_61, plain, (index(nil,X1)=nothing)). % 0.20/0.43 cnf(i_0_69, plain, (nf(lam(X1))=nf(X1))). % 0.20/0.43 cnf(i_0_57, plain, (aux(X1,X2,X3,nothing)=bfalse)). % 0.20/0.43 cnf(i_0_105, plain, (eq3(lam(X1),var(X2))=bfalse)). % 0.20/0.43 cnf(i_0_107, plain, (eq3(var(X1),lam(X2))=bfalse)). % 0.20/0.43 cnf(i_0_94, plain, (eq(a,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_95, plain, (eq(b,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_91, plain, (eq(arr(X1,X2),a)=bfalse)). % 0.20/0.43 cnf(i_0_92, plain, (eq(arr(X1,X2),b)=bfalse)). % 0.20/0.43 cnf(i_0_87, plain, (eq3(var(zero),var(suc(X1)))=bfalse)). % 0.20/0.43 cnf(i_0_73, plain, (tc(X1,lam(X2),a)=bfalse)). % 0.20/0.43 cnf(i_0_96, plain, (eq(c,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_93, plain, (eq(arr(X1,X2),c)=bfalse)). % 0.20/0.43 cnf(i_0_74, plain, (tc(X1,lam(X2),b)=bfalse)). % 0.20/0.43 cnf(i_0_75, plain, (tc(X1,lam(X2),c)=bfalse)). % 0.20/0.43 cnf(i_0_66, plain, (nf(app(lam(X1),X2,X3))=bfalse)). % 0.20/0.43 cnf(i_0_88, plain, (eq3(var(suc(X1)),var(zero))=bfalse)). % 0.20/0.43 cnf(i_0_62, plain, (index(cons(X1,X2),zero)=just(X1))). % 0.20/0.43 cnf(i_0_100, plain, (eq3(lam(X1),lam(X2))=eq3(X1,X2))). % 0.20/0.43 cnf(i_0_63, plain, (index(cons(X1,X2),suc(X3))=index(X2,X3))). % 0.20/0.43 cnf(i_0_104, plain, (eq3(lam(X1),app(X2,X3,X4))=bfalse)). % 0.20/0.43 cnf(i_0_58, plain, (aux(X1,X2,X3,just(X4))=eq(X4,X2))). % 0.20/0.43 cnf(i_0_106, plain, (eq3(var(X1),app(X2,X3,X4))=bfalse)). % 0.20/0.43 cnf(i_0_102, plain, (eq3(app(X1,X2,X3),lam(X4))=bfalse)). % 0.20/0.43 cnf(i_0_103, plain, (eq3(app(X1,X2,X3),var(X4))=bfalse)). % 0.20/0.43 cnf(i_0_72, plain, (tc(cons(X1,X2),X3,X4)=tc(X2,lam(X3),arr(X1,X4)))). % 0.20/0.43 cnf(i_0_68, plain, (nf(app(var(X1),X2,X3))=nf(X2))). % 0.20/0.43 cnf(i_0_76, plain, (aux(X1,X2,X3,index(X1,X3))=tc(X1,var(X3),X2))). % 0.20/0.43 cnf(i_0_86, plain, (eq3(var(suc(X1)),var(suc(X2)))=eq3(var(X1),var(X2)))). % 0.20/0.43 cnf(i_0_71, plain, (andb(tc(X1,X2,arr(X3,X4)),tc(X1,X5,X3))=tc(X1,app(X2,X5,X3),X4))). % 0.20/0.43 cnf(i_0_67, plain, (nf(app(app(X1,X2,X3),X4,X5))=andb(nf(app(X1,X2,X3)),nf(X4)))). % 0.20/0.43 cnf(i_0_112, negated_conjecture, (eq4(notb(andb(nf(X1),tc(nil,X1,arr(a,arr(b,b))))),bfalse)!=btrue)). % 0.20/0.43 cnf(i_0_89, plain, (eq(arr(X1,X2),arr(X3,X4))=bfalse|eq(X1,X3)!=bfalse)). % 0.20/0.43 cnf(i_0_90, plain, (eq(arr(X1,X2),arr(X3,X4))=eq(X2,X4)|eq(X1,X3)!=btrue)). % 0.20/0.43 cnf(i_0_97, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=bfalse|eq3(X1,X4)!=bfalse)). % 0.20/0.43 cnf(i_0_98, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=bfalse|eq3(X1,X4)!=btrue|eq3(X2,X5)!=bfalse)). % 0.20/0.43 cnf(i_0_99, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=eq(X3,X6)|eq3(X2,X5)!=btrue|eq3(X1,X4)!=btrue)). % 0.20/0.43 cnf(i_0_126, plain, (X7=X7)). % 0.20/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.43 # Begin printing tableau % 0.20/0.43 # Found 6 steps % 0.20/0.43 cnf(i_0_60, plain, (notb(bfalse)=btrue), inference(start_rule)). % 0.20/0.43 cnf(i_0_146, plain, (notb(bfalse)=btrue), inference(extension_rule, [i_0_143])). % 0.20/0.43 cnf(i_0_264, plain, (notb(bfalse)!=btrue), inference(closure_rule, [i_0_60])). % 0.20/0.43 cnf(i_0_263, plain, (arr(notb(bfalse),notb(bfalse))=arr(btrue,btrue)), inference(extension_rule, [i_0_129])). % 0.20/0.43 cnf(i_0_290, plain, (arr(btrue,btrue)!=andb(btrue,arr(btrue,btrue))), inference(closure_rule, [i_0_64])). % 0.20/0.43 cnf(i_0_288, plain, (arr(notb(bfalse),notb(bfalse))=andb(btrue,arr(btrue,btrue))), inference(etableau_closure_rule, [i_0_288, ...])). % 0.20/0.43 # End printing tableau % 0.20/0.43 # SZS output end % 0.20/0.43 # Branches closed with saturation will be marked with an "s" % 0.20/0.43 # There were 1 total branch saturation attempts. % 0.20/0.43 # There were 0 of these attempts blocked. % 0.20/0.43 # There were 0 deferred branch saturation attempts. % 0.20/0.43 # There were 0 free duplicated saturations. % 0.20/0.43 # There were 1 total successful branch saturations. % 0.20/0.43 # There were 0 successful branch saturations in interreduction. % 0.20/0.43 # There were 0 successful branch saturations on the branch. % 0.20/0.43 # There were 1 successful branch saturations after the branch. % 0.20/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # Begin clausification derivation % 0.20/0.43 % 0.20/0.43 # End clausification derivation % 0.20/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.43 cnf(i_0_60, plain, (notb(bfalse)=btrue)). % 0.20/0.43 cnf(i_0_59, plain, (notb(btrue)=bfalse)). % 0.20/0.43 cnf(i_0_84, plain, (eq4(bfalse,btrue)=bfalse)). % 0.20/0.43 cnf(i_0_85, plain, (eq4(btrue,bfalse)=bfalse)). % 0.20/0.43 cnf(i_0_78, plain, (eq(a,b)=bfalse)). % 0.20/0.43 cnf(i_0_70, plain, (nf(var(X1))=btrue)). % 0.20/0.43 cnf(i_0_80, plain, (eq(b,a)=bfalse)). % 0.20/0.43 cnf(i_0_108, plain, (eq(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_111, plain, (eq4(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_110, plain, (eq3(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_64, plain, (andb(btrue,X1)=X1)). % 0.20/0.43 cnf(i_0_65, plain, (andb(bfalse,X1)=bfalse)). % 0.20/0.43 cnf(i_0_79, plain, (eq(a,c)=bfalse)). % 0.20/0.43 cnf(i_0_81, plain, (eq(b,c)=bfalse)). % 0.20/0.43 cnf(i_0_82, plain, (eq(c,a)=bfalse)). % 0.20/0.43 cnf(i_0_83, plain, (eq(c,b)=bfalse)). % 0.20/0.43 cnf(i_0_61, plain, (index(nil,X1)=nothing)). % 0.20/0.43 cnf(i_0_69, plain, (nf(lam(X1))=nf(X1))). % 0.20/0.43 cnf(i_0_57, plain, (aux(X1,X2,X3,nothing)=bfalse)). % 0.20/0.43 cnf(i_0_105, plain, (eq3(lam(X1),var(X2))=bfalse)). % 0.20/0.43 cnf(i_0_107, plain, (eq3(var(X1),lam(X2))=bfalse)). % 0.20/0.43 cnf(i_0_94, plain, (eq(a,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_95, plain, (eq(b,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_91, plain, (eq(arr(X1,X2),a)=bfalse)). % 0.20/0.43 cnf(i_0_92, plain, (eq(arr(X1,X2),b)=bfalse)). % 0.20/0.43 cnf(i_0_87, plain, (eq3(var(zero),var(suc(X1)))=bfalse)). % 0.20/0.43 cnf(i_0_73, plain, (tc(X1,lam(X2),a)=bfalse)). % 0.20/0.43 cnf(i_0_96, plain, (eq(c,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_93, plain, (eq(arr(X1,X2),c)=bfalse)). % 0.20/0.43 cnf(i_0_74, plain, (tc(X1,lam(X2),b)=bfalse)). % 0.20/0.43 cnf(i_0_75, plain, (tc(X1,lam(X2),c)=bfalse)). % 0.20/0.43 cnf(i_0_66, plain, (nf(app(lam(X1),X2,X3))=bfalse)). % 0.20/0.43 cnf(i_0_88, plain, (eq3(var(suc(X1)),var(zero))=bfalse)). % 0.20/0.43 cnf(i_0_62, plain, (index(cons(X1,X2),zero)=just(X1))). % 0.20/0.43 cnf(i_0_100, plain, (eq3(lam(X1),lam(X2))=eq3(X1,X2))). % 0.20/0.43 cnf(i_0_63, plain, (index(cons(X1,X2),suc(X3))=index(X2,X3))). % 0.20/0.43 cnf(i_0_104, plain, (eq3(lam(X1),app(X2,X3,X4))=bfalse)). % 0.20/0.43 cnf(i_0_58, plain, (aux(X1,X2,X3,just(X4))=eq(X4,X2))). % 0.20/0.43 cnf(i_0_106, plain, (eq3(var(X1),app(X2,X3,X4))=bfalse)). % 0.20/0.43 cnf(i_0_102, plain, (eq3(app(X1,X2,X3),lam(X4))=bfalse)). % 0.20/0.43 cnf(i_0_103, plain, (eq3(app(X1,X2,X3),var(X4))=bfalse)). % 0.20/0.43 cnf(i_0_72, plain, (tc(cons(X1,X2),X3,X4)=tc(X2,lam(X3),arr(X1,X4)))). % 0.20/0.43 cnf(i_0_68, plain, (nf(app(var(X1),X2,X3))=nf(X2))). % 0.20/0.43 cnf(i_0_76, plain, (aux(X1,X2,X3,index(X1,X3))=tc(X1,var(X3),X2))). % 0.20/0.43 cnf(i_0_86, plain, (eq3(var(suc(X1)),var(suc(X2)))=eq3(var(X1),var(X2)))). % 0.20/0.43 cnf(i_0_71, plain, (andb(tc(X1,X2,arr(X3,X4)),tc(X1,X5,X3))=tc(X1,app(X2,X5,X3),X4))). % 0.20/0.43 cnf(i_0_67, plain, (nf(app(app(X1,X2,X3),X4,X5))=andb(nf(app(X1,X2,X3)),nf(X4)))). % 0.20/0.43 cnf(i_0_112, negated_conjecture, (eq4(notb(andb(nf(X1),tc(nil,X1,arr(a,arr(b,b))))),bfalse)!=btrue)). % 0.20/0.43 cnf(i_0_89, plain, (eq(arr(X1,X2),arr(X3,X4))=bfalse|eq(X1,X3)!=bfalse)). % 0.20/0.43 cnf(i_0_90, plain, (eq(arr(X1,X2),arr(X3,X4))=eq(X2,X4)|eq(X1,X3)!=btrue)). % 0.20/0.43 cnf(i_0_97, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=bfalse|eq3(X1,X4)!=bfalse)). % 0.20/0.43 cnf(i_0_98, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=bfalse|eq3(X1,X4)!=btrue|eq3(X2,X5)!=bfalse)). % 0.20/0.43 cnf(i_0_99, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=eq(X3,X6)|eq3(X2,X5)!=btrue|eq3(X1,X4)!=btrue)). % 0.20/0.43 cnf(i_0_126, plain, (X7=X7)). % 0.20/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.43 # Begin printing tableau % 0.20/0.43 # Found 6 steps % 0.20/0.43 cnf(i_0_60, plain, (notb(bfalse)=btrue), inference(start_rule)). % 0.20/0.43 cnf(i_0_146, plain, (notb(bfalse)=btrue), inference(extension_rule, [i_0_145])). % 0.20/0.43 cnf(i_0_271, plain, (notb(bfalse)!=btrue), inference(closure_rule, [i_0_60])). % 0.20/0.43 cnf(i_0_269, plain, (eq3(notb(bfalse),notb(bfalse))=eq3(btrue,btrue)), inference(extension_rule, [i_0_129])). % 0.20/0.43 cnf(i_0_290, plain, (eq3(btrue,btrue)!=btrue), inference(closure_rule, [i_0_110])). % 0.20/0.43 cnf(i_0_288, plain, (eq3(notb(bfalse),notb(bfalse))=btrue), inference(etableau_closure_rule, [i_0_288, ...])). % 0.20/0.43 # End printing tableau % 0.20/0.43 # SZS output end % 0.20/0.43 # Branches closed with saturation will be marked with an "s" % 0.20/0.43 # There were 1 total branch saturation attempts. % 0.20/0.43 # There were 0 of these attempts blocked. % 0.20/0.43 # There were 0 deferred branch saturation attempts. % 0.20/0.43 # There were 0 free duplicated saturations. % 0.20/0.43 # There were 1 total successful branch saturations. % 0.20/0.43 # There were 0 successful branch saturations in interreduction. % 0.20/0.43 # There were 0 successful branch saturations on the branch. % 0.20/0.43 # There were 1 successful branch saturations after the branch. % 0.20/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # Begin clausification derivation % 0.20/0.43 % 0.20/0.43 # End clausification derivation % 0.20/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.43 cnf(i_0_60, plain, (notb(bfalse)=btrue)). % 0.20/0.43 cnf(i_0_59, plain, (notb(btrue)=bfalse)). % 0.20/0.43 cnf(i_0_84, plain, (eq4(bfalse,btrue)=bfalse)). % 0.20/0.43 cnf(i_0_85, plain, (eq4(btrue,bfalse)=bfalse)). % 0.20/0.43 cnf(i_0_78, plain, (eq(a,b)=bfalse)). % 0.20/0.43 cnf(i_0_70, plain, (nf(var(X1))=btrue)). % 0.20/0.43 cnf(i_0_80, plain, (eq(b,a)=bfalse)). % 0.20/0.43 cnf(i_0_108, plain, (eq(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_111, plain, (eq4(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_110, plain, (eq3(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_64, plain, (andb(btrue,X1)=X1)). % 0.20/0.43 cnf(i_0_65, plain, (andb(bfalse,X1)=bfalse)). % 0.20/0.43 cnf(i_0_79, plain, (eq(a,c)=bfalse)). % 0.20/0.43 cnf(i_0_81, plain, (eq(b,c)=bfalse)). % 0.20/0.43 cnf(i_0_82, plain, (eq(c,a)=bfalse)). % 0.20/0.43 cnf(i_0_83, plain, (eq(c,b)=bfalse)). % 0.20/0.43 cnf(i_0_61, plain, (index(nil,X1)=nothing)). % 0.20/0.43 cnf(i_0_69, plain, (nf(lam(X1))=nf(X1))). % 0.20/0.43 cnf(i_0_57, plain, (aux(X1,X2,X3,nothing)=bfalse)). % 0.20/0.43 cnf(i_0_105, plain, (eq3(lam(X1),var(X2))=bfalse)). % 0.20/0.43 cnf(i_0_107, plain, (eq3(var(X1),lam(X2))=bfalse)). % 0.20/0.43 cnf(i_0_94, plain, (eq(a,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_95, plain, (eq(b,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_91, plain, (eq(arr(X1,X2),a)=bfalse)). % 0.20/0.43 cnf(i_0_92, plain, (eq(arr(X1,X2),b)=bfalse)). % 0.20/0.43 cnf(i_0_87, plain, (eq3(var(zero),var(suc(X1)))=bfalse)). % 0.20/0.43 cnf(i_0_73, plain, (tc(X1,lam(X2),a)=bfalse)). % 0.20/0.43 cnf(i_0_96, plain, (eq(c,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_93, plain, (eq(arr(X1,X2),c)=bfalse)). % 0.20/0.43 cnf(i_0_74, plain, (tc(X1,lam(X2),b)=bfalse)). % 0.20/0.43 cnf(i_0_75, plain, (tc(X1,lam(X2),c)=bfalse)). % 0.20/0.43 cnf(i_0_66, plain, (nf(app(lam(X1),X2,X3))=bfalse)). % 0.20/0.43 cnf(i_0_88, plain, (eq3(var(suc(X1)),var(zero))=bfalse)). % 0.20/0.43 cnf(i_0_62, plain, (index(cons(X1,X2),zero)=just(X1))). % 0.20/0.43 cnf(i_0_100, plain, (eq3(lam(X1),lam(X2))=eq3(X1,X2))). % 0.20/0.43 cnf(i_0_63, plain, (index(cons(X1,X2),suc(X3))=index(X2,X3))). % 0.20/0.43 cnf(i_0_104, plain, (eq3(lam(X1),app(X2,X3,X4))=bfalse)). % 0.20/0.43 cnf(i_0_58, plain, (aux(X1,X2,X3,just(X4))=eq(X4,X2))). % 0.20/0.43 cnf(i_0_106, plain, (eq3(var(X1),app(X2,X3,X4))=bfalse)). % 0.20/0.43 cnf(i_0_102, plain, (eq3(app(X1,X2,X3),lam(X4))=bfalse)). % 0.20/0.43 cnf(i_0_103, plain, (eq3(app(X1,X2,X3),var(X4))=bfalse)). % 0.20/0.43 cnf(i_0_72, plain, (tc(cons(X1,X2),X3,X4)=tc(X2,lam(X3),arr(X1,X4)))). % 0.20/0.43 cnf(i_0_68, plain, (nf(app(var(X1),X2,X3))=nf(X2))). % 0.20/0.43 cnf(i_0_76, plain, (aux(X1,X2,X3,index(X1,X3))=tc(X1,var(X3),X2))). % 0.20/0.43 cnf(i_0_86, plain, (eq3(var(suc(X1)),var(suc(X2)))=eq3(var(X1),var(X2)))). % 0.20/0.43 cnf(i_0_71, plain, (andb(tc(X1,X2,arr(X3,X4)),tc(X1,X5,X3))=tc(X1,app(X2,X5,X3),X4))). % 0.20/0.43 cnf(i_0_67, plain, (nf(app(app(X1,X2,X3),X4,X5))=andb(nf(app(X1,X2,X3)),nf(X4)))). % 0.20/0.43 cnf(i_0_112, negated_conjecture, (eq4(notb(andb(nf(X1),tc(nil,X1,arr(a,arr(b,b))))),bfalse)!=btrue)). % 0.20/0.43 cnf(i_0_89, plain, (eq(arr(X1,X2),arr(X3,X4))=bfalse|eq(X1,X3)!=bfalse)). % 0.20/0.43 cnf(i_0_90, plain, (eq(arr(X1,X2),arr(X3,X4))=eq(X2,X4)|eq(X1,X3)!=btrue)). % 0.20/0.43 cnf(i_0_97, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=bfalse|eq3(X1,X4)!=bfalse)). % 0.20/0.43 cnf(i_0_98, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=bfalse|eq3(X1,X4)!=btrue|eq3(X2,X5)!=bfalse)). % 0.20/0.43 cnf(i_0_99, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=eq(X3,X6)|eq3(X2,X5)!=btrue|eq3(X1,X4)!=btrue)). % 0.20/0.43 cnf(i_0_126, plain, (X7=X7)). % 0.20/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.43 # Begin printing tableau % 0.20/0.43 # Found 6 steps % 0.20/0.43 cnf(i_0_60, plain, (notb(bfalse)=btrue), inference(start_rule)). % 0.20/0.43 cnf(i_0_146, plain, (notb(bfalse)=btrue), inference(extension_rule, [i_0_144])). % 0.20/0.43 cnf(i_0_268, plain, (notb(bfalse)!=btrue), inference(closure_rule, [i_0_60])). % 0.20/0.43 cnf(i_0_266, plain, (eq4(notb(bfalse),notb(bfalse))=eq4(btrue,btrue)), inference(extension_rule, [i_0_129])). % 0.20/0.43 cnf(i_0_290, plain, (eq4(btrue,btrue)!=btrue), inference(closure_rule, [i_0_111])). % 0.20/0.43 cnf(i_0_288, plain, (eq4(notb(bfalse),notb(bfalse))=btrue), inference(etableau_closure_rule, [i_0_288, ...])). % 0.20/0.43 # End printing tableau % 0.20/0.43 # SZS output end % 0.20/0.43 # Branches closed with saturation will be marked with an "s" % 0.20/0.43 # There were 1 total branch saturation attempts. % 0.20/0.43 # There were 0 of these attempts blocked. % 0.20/0.43 # There were 0 deferred branch saturation attempts. % 0.20/0.43 # There were 0 free duplicated saturations. % 0.20/0.43 # There were 1 total successful branch saturations. % 0.20/0.43 # There were 0 successful branch saturations in interreduction. % 0.20/0.43 # There were 0 successful branch saturations on the branch. % 0.20/0.43 # There were 1 successful branch saturations after the branch. % 0.20/0.43 # There were 1 total branch saturation attempts. % 0.20/0.43 # There were 0 of these attempts blocked. % 0.20/0.43 # There were 0 deferred branch saturation attempts. % 0.20/0.43 # There were 0 free duplicated saturations. % 0.20/0.43 # There were 1 total successful branch saturations. % 0.20/0.43 # There were 0 successful branch saturations in interreduction. % 0.20/0.43 # There were 0 successful branch saturations on the branch. % 0.20/0.43 # There were 1 successful branch saturations after the branch. % 0.20/0.43 # There were 1 total branch saturation attempts. % 0.20/0.43 # There were 0 of these attempts blocked. % 0.20/0.43 # There were 0 deferred branch saturation attempts. % 0.20/0.43 # There were 0 free duplicated saturations. % 0.20/0.43 # There were 1 total successful branch saturations. % 0.20/0.43 # There were 0 successful branch saturations in interreduction. % 0.20/0.43 # There were 0 successful branch saturations on the branch. % 0.20/0.43 # There were 1 successful branch saturations after the branch. % 0.20/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # Begin clausification derivation % 0.20/0.43 % 0.20/0.43 # End clausification derivation % 0.20/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.43 cnf(i_0_60, plain, (notb(bfalse)=btrue)). % 0.20/0.43 cnf(i_0_59, plain, (notb(btrue)=bfalse)). % 0.20/0.43 cnf(i_0_84, plain, (eq4(bfalse,btrue)=bfalse)). % 0.20/0.43 cnf(i_0_85, plain, (eq4(btrue,bfalse)=bfalse)). % 0.20/0.43 cnf(i_0_78, plain, (eq(a,b)=bfalse)). % 0.20/0.43 cnf(i_0_70, plain, (nf(var(X1))=btrue)). % 0.20/0.43 cnf(i_0_80, plain, (eq(b,a)=bfalse)). % 0.20/0.43 cnf(i_0_108, plain, (eq(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_111, plain, (eq4(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_110, plain, (eq3(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_64, plain, (andb(btrue,X1)=X1)). % 0.20/0.43 cnf(i_0_65, plain, (andb(bfalse,X1)=bfalse)). % 0.20/0.43 cnf(i_0_79, plain, (eq(a,c)=bfalse)). % 0.20/0.43 cnf(i_0_81, plain, (eq(b,c)=bfalse)). % 0.20/0.43 cnf(i_0_82, plain, (eq(c,a)=bfalse)). % 0.20/0.43 cnf(i_0_83, plain, (eq(c,b)=bfalse)). % 0.20/0.43 cnf(i_0_61, plain, (index(nil,X1)=nothing)). % 0.20/0.43 cnf(i_0_69, plain, (nf(lam(X1))=nf(X1))). % 0.20/0.43 cnf(i_0_57, plain, (aux(X1,X2,X3,nothing)=bfalse)). % 0.20/0.43 cnf(i_0_105, plain, (eq3(lam(X1),var(X2))=bfalse)). % 0.20/0.43 cnf(i_0_107, plain, (eq3(var(X1),lam(X2))=bfalse)). % 0.20/0.43 cnf(i_0_94, plain, (eq(a,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_95, plain, (eq(b,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_91, plain, (eq(arr(X1,X2),a)=bfalse)). % 0.20/0.43 cnf(i_0_92, plain, (eq(arr(X1,X2),b)=bfalse)). % 0.20/0.43 cnf(i_0_87, plain, (eq3(var(zero),var(suc(X1)))=bfalse)). % 0.20/0.43 cnf(i_0_73, plain, (tc(X1,lam(X2),a)=bfalse)). % 0.20/0.43 cnf(i_0_96, plain, (eq(c,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_93, plain, (eq(arr(X1,X2),c)=bfalse)). % 0.20/0.43 cnf(i_0_74, plain, (tc(X1,lam(X2),b)=bfalse)). % 0.20/0.43 cnf(i_0_75, plain, (tc(X1,lam(X2),c)=bfalse)). % 0.20/0.43 cnf(i_0_66, plain, (nf(app(lam(X1),X2,X3))=bfalse)). % 0.20/0.43 cnf(i_0_88, plain, (eq3(var(suc(X1)),var(zero))=bfalse)). % 0.20/0.43 cnf(i_0_62, plain, (index(cons(X1,X2),zero)=just(X1))). % 0.20/0.43 cnf(i_0_100, plain, (eq3(lam(X1),lam(X2))=eq3(X1,X2))). % 0.20/0.43 cnf(i_0_63, plain, (index(cons(X1,X2),suc(X3))=index(X2,X3))). % 0.20/0.43 cnf(i_0_104, plain, (eq3(lam(X1),app(X2,X3,X4))=bfalse)). % 0.20/0.43 cnf(i_0_58, plain, (aux(X1,X2,X3,just(X4))=eq(X4,X2))). % 0.20/0.43 cnf(i_0_106, plain, (eq3(var(X1),app(X2,X3,X4))=bfalse)). % 0.20/0.43 cnf(i_0_102, plain, (eq3(app(X1,X2,X3),lam(X4))=bfalse)). % 0.20/0.43 cnf(i_0_103, plain, (eq3(app(X1,X2,X3),var(X4))=bfalse)). % 0.20/0.43 cnf(i_0_72, plain, (tc(cons(X1,X2),X3,X4)=tc(X2,lam(X3),arr(X1,X4)))). % 0.20/0.43 cnf(i_0_68, plain, (nf(app(var(X1),X2,X3))=nf(X2))). % 0.20/0.43 cnf(i_0_76, plain, (aux(X1,X2,X3,index(X1,X3))=tc(X1,var(X3),X2))). % 0.20/0.43 cnf(i_0_86, plain, (eq3(var(suc(X1)),var(suc(X2)))=eq3(var(X1),var(X2)))). % 0.20/0.43 cnf(i_0_71, plain, (andb(tc(X1,X2,arr(X3,X4)),tc(X1,X5,X3))=tc(X1,app(X2,X5,X3),X4))). % 0.20/0.43 cnf(i_0_67, plain, (nf(app(app(X1,X2,X3),X4,X5))=andb(nf(app(X1,X2,X3)),nf(X4)))). % 0.20/0.43 cnf(i_0_112, negated_conjecture, (eq4(notb(andb(nf(X1),tc(nil,X1,arr(a,arr(b,b))))),bfalse)!=btrue)). % 0.20/0.43 cnf(i_0_89, plain, (eq(arr(X1,X2),arr(X3,X4))=bfalse|eq(X1,X3)!=bfalse)). % 0.20/0.43 cnf(i_0_90, plain, (eq(arr(X1,X2),arr(X3,X4))=eq(X2,X4)|eq(X1,X3)!=btrue)). % 0.20/0.43 cnf(i_0_97, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=bfalse|eq3(X1,X4)!=bfalse)). % 0.20/0.43 cnf(i_0_98, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=bfalse|eq3(X1,X4)!=btrue|eq3(X2,X5)!=bfalse)). % 0.20/0.43 cnf(i_0_99, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=eq(X3,X6)|eq3(X2,X5)!=btrue|eq3(X1,X4)!=btrue)). % 0.20/0.43 cnf(i_0_126, plain, (X7=X7)). % 0.20/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.43 # Begin printing tableau % 0.20/0.43 # Found 7 steps % 0.20/0.43 cnf(i_0_60, plain, (notb(bfalse)=btrue), inference(start_rule)). % 0.20/0.43 cnf(i_0_146, plain, (notb(bfalse)=btrue), inference(extension_rule, [i_0_142])). % 0.20/0.43 cnf(i_0_260, plain, (notb(bfalse)!=btrue), inference(closure_rule, [i_0_60])). % 0.20/0.43 cnf(i_0_262, plain, (notb(bfalse)!=btrue), inference(closure_rule, [i_0_60])). % 0.20/0.43 cnf(i_0_259, plain, (tc(notb(bfalse),notb(bfalse),notb(bfalse))=tc(btrue,btrue,btrue)), inference(extension_rule, [i_0_129])). % 0.20/0.43 cnf(i_0_290, plain, (tc(btrue,btrue,btrue)!=andb(btrue,tc(btrue,btrue,btrue))), inference(closure_rule, [i_0_64])). % 0.20/0.43 cnf(i_0_288, plain, (tc(notb(bfalse),notb(bfalse),notb(bfalse))=andb(btrue,tc(btrue,btrue,btrue))), inference(etableau_closure_rule, [i_0_288, ...])). % 0.20/0.43 # End printing tableau % 0.20/0.43 # SZS output end % 0.20/0.43 # Branches closed with saturation will be marked with an "s" % 0.20/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # Begin clausification derivation % 0.20/0.43 % 0.20/0.43 # End clausification derivation % 0.20/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.43 cnf(i_0_60, plain, (notb(bfalse)=btrue)). % 0.20/0.43 cnf(i_0_59, plain, (notb(btrue)=bfalse)). % 0.20/0.43 cnf(i_0_84, plain, (eq4(bfalse,btrue)=bfalse)). % 0.20/0.43 cnf(i_0_85, plain, (eq4(btrue,bfalse)=bfalse)). % 0.20/0.43 cnf(i_0_78, plain, (eq(a,b)=bfalse)). % 0.20/0.43 cnf(i_0_70, plain, (nf(var(X1))=btrue)). % 0.20/0.43 cnf(i_0_80, plain, (eq(b,a)=bfalse)). % 0.20/0.43 cnf(i_0_108, plain, (eq(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_111, plain, (eq4(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_110, plain, (eq3(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_64, plain, (andb(btrue,X1)=X1)). % 0.20/0.43 cnf(i_0_65, plain, (andb(bfalse,X1)=bfalse)). % 0.20/0.43 cnf(i_0_79, plain, (eq(a,c)=bfalse)). % 0.20/0.43 cnf(i_0_81, plain, (eq(b,c)=bfalse)). % 0.20/0.43 cnf(i_0_82, plain, (eq(c,a)=bfalse)). % 0.20/0.43 cnf(i_0_83, plain, (eq(c,b)=bfalse)). % 0.20/0.43 cnf(i_0_61, plain, (index(nil,X1)=nothing)). % 0.20/0.43 cnf(i_0_69, plain, (nf(lam(X1))=nf(X1))). % 0.20/0.43 cnf(i_0_57, plain, (aux(X1,X2,X3,nothing)=bfalse)). % 0.20/0.43 cnf(i_0_105, plain, (eq3(lam(X1),var(X2))=bfalse)). % 0.20/0.43 cnf(i_0_107, plain, (eq3(var(X1),lam(X2))=bfalse)). % 0.20/0.43 cnf(i_0_94, plain, (eq(a,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_95, plain, (eq(b,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_91, plain, (eq(arr(X1,X2),a)=bfalse)). % 0.20/0.43 cnf(i_0_92, plain, (eq(arr(X1,X2),b)=bfalse)). % 0.20/0.43 cnf(i_0_87, plain, (eq3(var(zero),var(suc(X1)))=bfalse)). % 0.20/0.43 cnf(i_0_73, plain, (tc(X1,lam(X2),a)=bfalse)). % 0.20/0.43 cnf(i_0_96, plain, (eq(c,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_93, plain, (eq(arr(X1,X2),c)=bfalse)). % 0.20/0.43 cnf(i_0_74, plain, (tc(X1,lam(X2),b)=bfalse)). % 0.20/0.43 cnf(i_0_75, plain, (tc(X1,lam(X2),c)=bfalse)). % 0.20/0.43 cnf(i_0_66, plain, (nf(app(lam(X1),X2,X3))=bfalse)). % 0.20/0.43 cnf(i_0_88, plain, (eq3(var(suc(X1)),var(zero))=bfalse)). % 0.20/0.43 cnf(i_0_62, plain, (index(cons(X1,X2),zero)=just(X1))). % 0.20/0.43 cnf(i_0_100, plain, (eq3(lam(X1),lam(X2))=eq3(X1,X2))). % 0.20/0.43 cnf(i_0_63, plain, (index(cons(X1,X2),suc(X3))=index(X2,X3))). % 0.20/0.43 cnf(i_0_104, plain, (eq3(lam(X1),app(X2,X3,X4))=bfalse)). % 0.20/0.43 cnf(i_0_58, plain, (aux(X1,X2,X3,just(X4))=eq(X4,X2))). % 0.20/0.43 cnf(i_0_106, plain, (eq3(var(X1),app(X2,X3,X4))=bfalse)). % 0.20/0.43 cnf(i_0_102, plain, (eq3(app(X1,X2,X3),lam(X4))=bfalse)). % 0.20/0.43 cnf(i_0_103, plain, (eq3(app(X1,X2,X3),var(X4))=bfalse)). % 0.20/0.43 cnf(i_0_72, plain, (tc(cons(X1,X2),X3,X4)=tc(X2,lam(X3),arr(X1,X4)))). % 0.20/0.43 cnf(i_0_68, plain, (nf(app(var(X1),X2,X3))=nf(X2))). % 0.20/0.43 cnf(i_0_76, plain, (aux(X1,X2,X3,index(X1,X3))=tc(X1,var(X3),X2))). % 0.20/0.43 cnf(i_0_86, plain, (eq3(var(suc(X1)),var(suc(X2)))=eq3(var(X1),var(X2)))). % 0.20/0.43 cnf(i_0_71, plain, (andb(tc(X1,X2,arr(X3,X4)),tc(X1,X5,X3))=tc(X1,app(X2,X5,X3),X4))). % 0.20/0.43 cnf(i_0_67, plain, (nf(app(app(X1,X2,X3),X4,X5))=andb(nf(app(X1,X2,X3)),nf(X4)))). % 0.20/0.43 cnf(i_0_112, negated_conjecture, (eq4(notb(andb(nf(X1),tc(nil,X1,arr(a,arr(b,b))))),bfalse)!=btrue)). % 0.20/0.43 cnf(i_0_89, plain, (eq(arr(X1,X2),arr(X3,X4))=bfalse|eq(X1,X3)!=bfalse)). % 0.20/0.43 cnf(i_0_90, plain, (eq(arr(X1,X2),arr(X3,X4))=eq(X2,X4)|eq(X1,X3)!=btrue)). % 0.20/0.43 cnf(i_0_97, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=bfalse|eq3(X1,X4)!=bfalse)). % 0.20/0.43 cnf(i_0_98, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=bfalse|eq3(X1,X4)!=btrue|eq3(X2,X5)!=bfalse)). % 0.20/0.43 cnf(i_0_99, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=eq(X3,X6)|eq3(X2,X5)!=btrue|eq3(X1,X4)!=btrue)). % 0.20/0.43 cnf(i_0_126, plain, (X7=X7)). % 0.20/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.43 # Begin printing tableau % 0.20/0.43 # Found 6 steps % 0.20/0.43 cnf(i_0_60, plain, (notb(bfalse)=btrue), inference(start_rule)). % 0.20/0.43 cnf(i_0_146, plain, (notb(bfalse)=btrue), inference(extension_rule, [i_0_143])). % 0.20/0.43 cnf(i_0_265, plain, (notb(bfalse)!=btrue), inference(closure_rule, [i_0_60])). % 0.20/0.43 cnf(i_0_263, plain, (arr(notb(bfalse),notb(bfalse))=arr(btrue,btrue)), inference(extension_rule, [i_0_129])). % 0.20/0.43 cnf(i_0_290, plain, (arr(btrue,btrue)!=andb(btrue,arr(btrue,btrue))), inference(closure_rule, [i_0_64])). % 0.20/0.43 cnf(i_0_288, plain, (arr(notb(bfalse),notb(bfalse))=andb(btrue,arr(btrue,btrue))), inference(etableau_closure_rule, [i_0_288, ...])). % 0.20/0.43 # End printing tableau % 0.20/0.43 # SZS output end % 0.20/0.43 # Branches closed with saturation will be marked with an "s" % 0.20/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # Begin clausification derivation % 0.20/0.43 % 0.20/0.43 # End clausification derivation % 0.20/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.43 cnf(i_0_60, plain, (notb(bfalse)=btrue)). % 0.20/0.43 cnf(i_0_59, plain, (notb(btrue)=bfalse)). % 0.20/0.43 cnf(i_0_84, plain, (eq4(bfalse,btrue)=bfalse)). % 0.20/0.43 cnf(i_0_85, plain, (eq4(btrue,bfalse)=bfalse)). % 0.20/0.43 cnf(i_0_78, plain, (eq(a,b)=bfalse)). % 0.20/0.43 cnf(i_0_70, plain, (nf(var(X1))=btrue)). % 0.20/0.43 cnf(i_0_80, plain, (eq(b,a)=bfalse)). % 0.20/0.43 cnf(i_0_108, plain, (eq(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_111, plain, (eq4(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_110, plain, (eq3(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_64, plain, (andb(btrue,X1)=X1)). % 0.20/0.43 cnf(i_0_65, plain, (andb(bfalse,X1)=bfalse)). % 0.20/0.43 cnf(i_0_79, plain, (eq(a,c)=bfalse)). % 0.20/0.43 cnf(i_0_81, plain, (eq(b,c)=bfalse)). % 0.20/0.43 cnf(i_0_82, plain, (eq(c,a)=bfalse)). % 0.20/0.43 cnf(i_0_83, plain, (eq(c,b)=bfalse)). % 0.20/0.43 cnf(i_0_61, plain, (index(nil,X1)=nothing)). % 0.20/0.43 cnf(i_0_69, plain, (nf(lam(X1))=nf(X1))). % 0.20/0.43 cnf(i_0_57, plain, (aux(X1,X2,X3,nothing)=bfalse)). % 0.20/0.43 cnf(i_0_105, plain, (eq3(lam(X1),var(X2))=bfalse)). % 0.20/0.43 cnf(i_0_107, plain, (eq3(var(X1),lam(X2))=bfalse)). % 0.20/0.43 cnf(i_0_94, plain, (eq(a,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_95, plain, (eq(b,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_91, plain, (eq(arr(X1,X2),a)=bfalse)). % 0.20/0.43 cnf(i_0_92, plain, (eq(arr(X1,X2),b)=bfalse)). % 0.20/0.43 cnf(i_0_87, plain, (eq3(var(zero),var(suc(X1)))=bfalse)). % 0.20/0.43 cnf(i_0_73, plain, (tc(X1,lam(X2),a)=bfalse)). % 0.20/0.43 cnf(i_0_96, plain, (eq(c,arr(X1,X2))=bfalse)). % 0.20/0.43 cnf(i_0_93, plain, (eq(arr(X1,X2),c)=bfalse)). % 0.20/0.43 cnf(i_0_74, plain, (tc(X1,lam(X2),b)=bfalse)). % 0.20/0.43 cnf(i_0_75, plain, (tc(X1,lam(X2),c)=bfalse)). % 0.20/0.43 cnf(i_0_66, plain, (nf(app(lam(X1),X2,X3))=bfalse)). % 0.20/0.43 cnf(i_0_88, plain, (eq3(var(suc(X1)),var(zero))=bfalse)). % 0.20/0.43 cnf(i_0_62, plain, (index(cons(X1,X2),zero)=just(X1))). % 0.20/0.43 cnf(i_0_100, plain, (eq3(lam(X1),lam(X2))=eq3(X1,X2))). % 0.20/0.43 cnf(i_0_63, plain, (index(cons(X1,X2),suc(X3))=index(X2,X3))). % 0.20/0.43 cnf(i_0_104, plain, (eq3(lam(X1),app(X2,X3,X4))=bfalse)). % 0.20/0.43 cnf(i_0_58, plain, (aux(X1,X2,X3,just(X4))=eq(X4,X2))). % 0.20/0.43 cnf(i_0_106, plain, (eq3(var(X1),app(X2,X3,X4))=bfalse)). % 0.20/0.43 cnf(i_0_102, plain, (eq3(app(X1,X2,X3),lam(X4))=bfalse)). % 0.20/0.43 cnf(i_0_103, plain, (eq3(app(X1,X2,X3),var(X4))=bfalse)). % 0.20/0.43 cnf(i_0_72, plain, (tc(cons(X1,X2),X3,X4)=tc(X2,lam(X3),arr(X1,X4)))). % 0.20/0.43 cnf(i_0_68, plain, (nf(app(var(X1),X2,X3))=nf(X2))). % 0.20/0.43 cnf(i_0_76, plain, (aux(X1,X2,X3,index(X1,X3))=tc(X1,var(X3),X2))). % 0.20/0.43 cnf(i_0_86, plain, (eq3(var(suc(X1)),var(suc(X2)))=eq3(var(X1),var(X2)))). % 0.20/0.43 cnf(i_0_71, plain, (andb(tc(X1,X2,arr(X3,X4)),tc(X1,X5,X3))=tc(X1,app(X2,X5,X3),X4))). % 0.20/0.43 cnf(i_0_67, plain, (nf(app(app(X1,X2,X3),X4,X5))=andb(nf(app(X1,X2,X3)),nf(X4)))). % 0.20/0.43 cnf(i_0_112, negated_conjecture, (eq4(notb(andb(nf(X1),tc(nil,X1,arr(a,arr(b,b))))),bfalse)!=btrue)). % 0.20/0.43 cnf(i_0_89, plain, (eq(arr(X1,X2),arr(X3,X4))=bfalse|eq(X1,X3)!=bfalse)). % 0.20/0.43 cnf(i_0_90, plain, (eq(arr(X1,X2),arr(X3,X4))=eq(X2,X4)|eq(X1,X3)!=btrue)). % 0.20/0.43 cnf(i_0_97, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=bfalse|eq3(X1,X4)!=bfalse)). % 0.20/0.43 cnf(i_0_98, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=bfalse|eq3(X1,X4)!=btrue|eq3(X2,X5)!=bfalse)). % 0.20/0.43 cnf(i_0_99, plain, (eq3(app(X1,X2,X3),app(X4,X5,X6))=eq(X3,X6)|eq3(X2,X5)!=btrue|eq3(X1,X4)!=btrue)). % 0.20/0.43 cnf(i_0_126, plain, (X7=X7)). % 0.20/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.43 # Begin printing tableau % 0.20/0.43 # Found 7 steps % 0.20/0.43 cnf(i_0_60, plain, (notb(bfalse)=btrue), inference(start_rule)). % 0.20/0.43 cnf(i_0_146, plain, (notb(bfalse)=btrue), inference(extension_rule, [i_0_142])). % 0.20/0.43 cnf(i_0_260, plain, (notb(bfalse)!=btrue), inference(closure_rule, [i_0_60])). % 0.20/0.43 cnf(i_0_261, plain, (notb(bfalse)!=btrue), inference(closure_rule, [i_0_60])). % 0.20/0.43 cnf(i_0_259, plain, (tc(notb(bfalse),notb(bfalse),notb(bfalse))=tc(btrue,btrue,btrue)), inference(extension_rule, [i_0_129])). % 0.20/0.43 cnf(i_0_290, plain, (tc(btrue,btrue,btrue)!=andb(btrue,tc(btrue,btrue,btrue))), inference(closure_rule, [i_0_64])). % 0.20/0.43 cnf(i_0_288, plain, (tc(notb(bfalse),notb(bfalse),notb(bfalse))=andb(btrue,tc(btrue,btrue,btrue))), inference(etableau_closure_rule, [i_0_288, ...])). % 0.20/0.43 # End printing tableau % 0.20/0.43 # SZS output end % 0.20/0.43 # Branches closed with saturation will be marked with an "s" % 0.20/0.43 # Child (1980) has found a proof. % 0.20/0.43 % 0.20/0.43 # Proof search is over... % 0.20/0.43 # Freeing feature tree %------------------------------------------------------------------------------