%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX207-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 : n018.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:44 PM UTC 2026 % Result : Unsatisfiable 0.20s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX207-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.17/0.34 % Computer : n018.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Tue May 5 11:35:46 EDT 2026 % 0.17/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_S4d % 0.20/0.37 # and selection function SelectCQIPrecWNTNp. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 48 Number of unprocessed: 48 % 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.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 48 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 1 conjectures. % 0.20/0.37 # There are 1 start rule candidates: % 0.20/0.37 # Found 44 unit axioms. % 0.20/0.37 # 1 start rule tableaux created. % 0.20/0.37 # 4 extension rule candidate clauses % 0.20/0.37 # 44 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.37 # Creating equality axioms % 0.20/0.37 # Ran out of tableaux, making start rules for all clauses % 0.20/0.37 # Returning from population with 72 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 72 tableaux to operate on % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_70, plain, (eq5(btrue,bfalse)=bfalse)). % 0.20/0.38 cnf(i_0_69, plain, (eq5(bfalse,btrue)=bfalse)). % 0.20/0.38 cnf(i_0_51, plain, (impl(bfalse,X1)=btrue)). % 0.20/0.38 cnf(i_0_50, plain, (impl(btrue,X1)=X1)). % 0.20/0.38 cnf(i_0_89, plain, (eq(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_58, plain, (linP(pE)=nil)). % 0.20/0.38 cnf(i_0_92, plain, (eq4(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_90, plain, (eq2(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_91, plain, (eq3(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_93, plain, (eq5(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_52, plain, (append(nil,X1)=X1)). % 0.20/0.38 cnf(i_0_61, plain, (eq2(a,b)=bfalse)). % 0.20/0.38 cnf(i_0_62, plain, (eq2(b,a)=bfalse)). % 0.20/0.38 cnf(i_0_63, plain, (eq3(pA,pB)=bfalse)). % 0.20/0.38 cnf(i_0_64, plain, (eq3(pA,pE)=bfalse)). % 0.20/0.38 cnf(i_0_65, plain, (eq3(pB,pA)=bfalse)). % 0.20/0.38 cnf(i_0_66, plain, (eq3(pB,pE)=bfalse)). % 0.20/0.38 cnf(i_0_67, plain, (eq3(pE,pA)=bfalse)). % 0.20/0.38 cnf(i_0_68, plain, (eq3(pE,pB)=bfalse)). % 0.20/0.38 cnf(i_0_56, plain, (linP(pA)=cons(a,nil))). % 0.20/0.38 cnf(i_0_57, plain, (linP(pB)=cons(b,nil))). % 0.20/0.38 cnf(i_0_81, plain, (eq3(pA,aP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_82, plain, (eq3(pA,bP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_83, plain, (eq3(pB,aP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_84, plain, (eq3(pB,bP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_85, plain, (eq3(pE,aP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_86, plain, (eq3(pE,bP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_74, plain, (eq3(aP(X1),pA)=bfalse)). % 0.20/0.38 cnf(i_0_75, plain, (eq3(aP(X1),pB)=bfalse)). % 0.20/0.38 cnf(i_0_76, plain, (eq3(aP(X1),pE)=bfalse)). % 0.20/0.38 cnf(i_0_78, plain, (eq3(bP(X1),pA)=bfalse)). % 0.20/0.38 cnf(i_0_79, plain, (eq3(bP(X1),pB)=bfalse)). % 0.20/0.38 cnf(i_0_80, plain, (eq3(bP(X1),pE)=bfalse)). % 0.20/0.38 cnf(i_0_96, plain, (eq(nil,cons(X1,X2))=bfalse)). % 0.20/0.38 cnf(i_0_97, plain, (eq(cons(X1,X2),nil)=bfalse)). % 0.20/0.38 cnf(i_0_73, plain, (eq3(aP(X1),bP(X2))=bfalse)). % 0.20/0.38 cnf(i_0_77, plain, (eq3(bP(X1),aP(X2))=bfalse)). % 0.20/0.38 cnf(i_0_71, plain, (eq3(aP(X1),aP(X2))=eq3(X1,X2))). % 0.20/0.38 cnf(i_0_59, plain, (linC(c2(X1,X2))=append(linP(X1),linP(X2)))). % 0.20/0.38 cnf(i_0_72, plain, (eq3(bP(X1),bP(X2))=eq3(X1,X2))). % 0.20/0.38 cnf(i_0_53, plain, (append(cons(X1,X2),X3)=cons(X1,append(X2,X3)))). % 0.20/0.38 cnf(i_0_54, plain, (cons(a,append(linP(X1),cons(a,nil)))=linP(aP(X1)))). % 0.20/0.38 cnf(i_0_55, plain, (cons(b,append(linP(X1),cons(b,nil)))=linP(bP(X1)))). % 0.20/0.38 cnf(i_0_98, negated_conjecture, (eq5(impl(eq(linC(X1),linC(X2)),eq4(X1,X2)),bfalse)!=btrue)). % 0.20/0.38 cnf(i_0_94, plain, (eq(cons(X1,X2),cons(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.38 cnf(i_0_87, plain, (eq4(c2(X1,X2),c2(X3,X4))=bfalse|eq3(X1,X3)!=bfalse)). % 0.20/0.38 cnf(i_0_95, plain, (eq(cons(X1,X2),cons(X3,X4))=eq(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.38 cnf(i_0_88, plain, (eq4(c2(X1,X2),c2(X3,X4))=eq3(X2,X4)|eq3(X1,X3)!=btrue)). % 0.20/0.38 cnf(i_0_108, plain, (X5=X5)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 6 steps % 0.20/0.38 cnf(i_0_70, plain, (eq5(btrue,bfalse)=bfalse), inference(start_rule)). % 0.20/0.38 cnf(i_0_125, plain, (eq5(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_124])). % 0.20/0.38 cnf(i_0_226, plain, (eq5(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_70])). % 0.20/0.38 cnf(i_0_225, plain, (eq5(eq5(btrue,bfalse),eq5(btrue,bfalse))=eq5(bfalse,bfalse)), inference(extension_rule, [i_0_111])). % 0.20/0.38 cnf(i_0_242, plain, (eq5(bfalse,bfalse)!=impl(btrue,eq5(bfalse,bfalse))), inference(closure_rule, [i_0_50])). % 0.20/0.38 cnf(i_0_240, plain, (eq5(eq5(btrue,bfalse),eq5(btrue,bfalse))=impl(btrue,eq5(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_240, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_70, plain, (eq5(btrue,bfalse)=bfalse)). % 0.20/0.38 cnf(i_0_69, plain, (eq5(bfalse,btrue)=bfalse)). % 0.20/0.38 cnf(i_0_51, plain, (impl(bfalse,X1)=btrue)). % 0.20/0.38 cnf(i_0_50, plain, (impl(btrue,X1)=X1)). % 0.20/0.38 cnf(i_0_89, plain, (eq(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_58, plain, (linP(pE)=nil)). % 0.20/0.38 cnf(i_0_92, plain, (eq4(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_90, plain, (eq2(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_91, plain, (eq3(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_93, plain, (eq5(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_52, plain, (append(nil,X1)=X1)). % 0.20/0.38 cnf(i_0_61, plain, (eq2(a,b)=bfalse)). % 0.20/0.38 cnf(i_0_62, plain, (eq2(b,a)=bfalse)). % 0.20/0.38 cnf(i_0_63, plain, (eq3(pA,pB)=bfalse)). % 0.20/0.38 cnf(i_0_64, plain, (eq3(pA,pE)=bfalse)). % 0.20/0.38 cnf(i_0_65, plain, (eq3(pB,pA)=bfalse)). % 0.20/0.38 cnf(i_0_66, plain, (eq3(pB,pE)=bfalse)). % 0.20/0.38 cnf(i_0_67, plain, (eq3(pE,pA)=bfalse)). % 0.20/0.38 cnf(i_0_68, plain, (eq3(pE,pB)=bfalse)). % 0.20/0.38 cnf(i_0_56, plain, (linP(pA)=cons(a,nil))). % 0.20/0.38 cnf(i_0_57, plain, (linP(pB)=cons(b,nil))). % 0.20/0.38 cnf(i_0_81, plain, (eq3(pA,aP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_82, plain, (eq3(pA,bP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_83, plain, (eq3(pB,aP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_84, plain, (eq3(pB,bP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_85, plain, (eq3(pE,aP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_86, plain, (eq3(pE,bP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_74, plain, (eq3(aP(X1),pA)=bfalse)). % 0.20/0.38 cnf(i_0_75, plain, (eq3(aP(X1),pB)=bfalse)). % 0.20/0.38 cnf(i_0_76, plain, (eq3(aP(X1),pE)=bfalse)). % 0.20/0.38 cnf(i_0_78, plain, (eq3(bP(X1),pA)=bfalse)). % 0.20/0.38 cnf(i_0_79, plain, (eq3(bP(X1),pB)=bfalse)). % 0.20/0.38 cnf(i_0_80, plain, (eq3(bP(X1),pE)=bfalse)). % 0.20/0.38 cnf(i_0_96, plain, (eq(nil,cons(X1,X2))=bfalse)). % 0.20/0.38 cnf(i_0_97, plain, (eq(cons(X1,X2),nil)=bfalse)). % 0.20/0.38 cnf(i_0_73, plain, (eq3(aP(X1),bP(X2))=bfalse)). % 0.20/0.38 cnf(i_0_77, plain, (eq3(bP(X1),aP(X2))=bfalse)). % 0.20/0.38 cnf(i_0_71, plain, (eq3(aP(X1),aP(X2))=eq3(X1,X2))). % 0.20/0.38 cnf(i_0_59, plain, (linC(c2(X1,X2))=append(linP(X1),linP(X2)))). % 0.20/0.38 cnf(i_0_72, plain, (eq3(bP(X1),bP(X2))=eq3(X1,X2))). % 0.20/0.38 cnf(i_0_53, plain, (append(cons(X1,X2),X3)=cons(X1,append(X2,X3)))). % 0.20/0.38 cnf(i_0_54, plain, (cons(a,append(linP(X1),cons(a,nil)))=linP(aP(X1)))). % 0.20/0.38 cnf(i_0_55, plain, (cons(b,append(linP(X1),cons(b,nil)))=linP(bP(X1)))). % 0.20/0.38 cnf(i_0_98, negated_conjecture, (eq5(impl(eq(linC(X1),linC(X2)),eq4(X1,X2)),bfalse)!=btrue)). % 0.20/0.38 cnf(i_0_94, plain, (eq(cons(X1,X2),cons(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.38 cnf(i_0_87, plain, (eq4(c2(X1,X2),c2(X3,X4))=bfalse|eq3(X1,X3)!=bfalse)). % 0.20/0.38 cnf(i_0_95, plain, (eq(cons(X1,X2),cons(X3,X4))=eq(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.38 cnf(i_0_88, plain, (eq4(c2(X1,X2),c2(X3,X4))=eq3(X2,X4)|eq3(X1,X3)!=btrue)). % 0.20/0.38 cnf(i_0_108, plain, (X5=X5)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 6 steps % 0.20/0.38 cnf(i_0_70, plain, (eq5(btrue,bfalse)=bfalse), inference(start_rule)). % 0.20/0.38 cnf(i_0_125, plain, (eq5(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_123])). % 0.20/0.38 cnf(i_0_223, plain, (eq5(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_70])). % 0.20/0.38 cnf(i_0_222, plain, (eq3(eq5(btrue,bfalse),eq5(btrue,bfalse))=eq3(bfalse,bfalse)), inference(extension_rule, [i_0_111])). % 0.20/0.38 cnf(i_0_242, plain, (eq3(bfalse,bfalse)!=impl(btrue,eq3(bfalse,bfalse))), inference(closure_rule, [i_0_50])). % 0.20/0.38 cnf(i_0_240, plain, (eq3(eq5(btrue,bfalse),eq5(btrue,bfalse))=impl(btrue,eq3(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_240, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_70, plain, (eq5(btrue,bfalse)=bfalse)). % 0.20/0.38 cnf(i_0_69, plain, (eq5(bfalse,btrue)=bfalse)). % 0.20/0.38 cnf(i_0_51, plain, (impl(bfalse,X1)=btrue)). % 0.20/0.38 cnf(i_0_50, plain, (impl(btrue,X1)=X1)). % 0.20/0.38 cnf(i_0_89, plain, (eq(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_58, plain, (linP(pE)=nil)). % 0.20/0.38 cnf(i_0_92, plain, (eq4(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_90, plain, (eq2(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_91, plain, (eq3(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_93, plain, (eq5(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_52, plain, (append(nil,X1)=X1)). % 0.20/0.38 cnf(i_0_61, plain, (eq2(a,b)=bfalse)). % 0.20/0.38 cnf(i_0_62, plain, (eq2(b,a)=bfalse)). % 0.20/0.38 cnf(i_0_63, plain, (eq3(pA,pB)=bfalse)). % 0.20/0.38 cnf(i_0_64, plain, (eq3(pA,pE)=bfalse)). % 0.20/0.38 cnf(i_0_65, plain, (eq3(pB,pA)=bfalse)). % 0.20/0.38 cnf(i_0_66, plain, (eq3(pB,pE)=bfalse)). % 0.20/0.38 cnf(i_0_67, plain, (eq3(pE,pA)=bfalse)). % 0.20/0.38 cnf(i_0_68, plain, (eq3(pE,pB)=bfalse)). % 0.20/0.38 cnf(i_0_56, plain, (linP(pA)=cons(a,nil))). % 0.20/0.38 cnf(i_0_57, plain, (linP(pB)=cons(b,nil))). % 0.20/0.38 cnf(i_0_81, plain, (eq3(pA,aP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_82, plain, (eq3(pA,bP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_83, plain, (eq3(pB,aP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_84, plain, (eq3(pB,bP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_85, plain, (eq3(pE,aP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_86, plain, (eq3(pE,bP(X1))=bfalse)). % 0.20/0.38 cnf(i_0_74, plain, (eq3(aP(X1),pA)=bfalse)). % 0.20/0.38 cnf(i_0_75, plain, (eq3(aP(X1),pB)=bfalse)). % 0.20/0.38 cnf(i_0_76, plain, (eq3(aP(X1),pE)=bfalse)). % 0.20/0.38 cnf(i_0_78, plain, (eq3(bP(X1),pA)=bfalse)). % 0.20/0.38 cnf(i_0_79, plain, (eq3(bP(X1),pB)=bfalse)). % 0.20/0.38 cnf(i_0_80, plain, (eq3(bP(X1),pE)=bfalse)). % 0.20/0.38 cnf(i_0_96, plain, (eq(nil,cons(X1,X2))=bfalse)). % 0.20/0.38 cnf(i_0_97, plain, (eq(cons(X1,X2),nil)=bfalse)). % 0.20/0.38 cnf(i_0_73, plain, (eq3(aP(X1),bP(X2))=bfalse)). % 0.20/0.38 cnf(i_0_77, plain, (eq3(bP(X1),aP(X2))=bfalse)). % 0.20/0.38 cnf(i_0_71, plain, (eq3(aP(X1),aP(X2))=eq3(X1,X2))). % 0.20/0.38 cnf(i_0_59, plain, (linC(c2(X1,X2))=append(linP(X1),linP(X2)))). % 0.20/0.38 cnf(i_0_72, plain, (eq3(bP(X1),bP(X2))=eq3(X1,X2))). % 0.20/0.38 cnf(i_0_53, plain, (append(cons(X1,X2),X3)=cons(X1,append(X2,X3)))). % 0.20/0.38 cnf(i_0_54, plain, (cons(a,append(linP(X1),cons(a,nil)))=linP(aP(X1)))). % 0.20/0.38 cnf(i_0_55, plain, (cons(b,append(linP(X1),cons(b,nil)))=linP(bP(X1)))). % 0.20/0.38 cnf(i_0_98, negated_conjecture, (eq5(impl(eq(linC(X1),linC(X2)),eq4(X1,X2)),bfalse)!=btrue)). % 0.20/0.38 cnf(i_0_94, plain, (eq(cons(X1,X2),cons(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.38 cnf(i_0_87, plain, (eq4(c2(X1,X2),c2(X3,X4))=bfalse|eq3(X1,X3)!=bfalse)). % 0.20/0.38 cnf(i_0_95, plain, (eq(cons(X1,X2),cons(X3,X4))=eq(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.38 cnf(i_0_88, plain, (eq4(c2(X1,X2),c2(X3,X4))=eq3(X2,X4)|eq3(X1,X3)!=btrue)). % 0.20/0.38 cnf(i_0_108, plain, (X5=X5)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 6 steps % 0.20/0.38 cnf(i_0_70, plain, (eq5(btrue,bfalse)=bfalse), inference(start_rule)). % 0.20/0.38 cnf(i_0_125, plain, (eq5(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_123])). % 0.20/0.38 cnf(i_0_224, plain, (eq5(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_70])). % 0.20/0.38 cnf(i_0_222, plain, (eq3(eq5(btrue,bfalse),eq5(btrue,bfalse))=eq3(bfalse,bfalse)), inference(extension_rule, [i_0_111])). % 0.20/0.38 cnf(i_0_242, plain, (eq3(bfalse,bfalse)!=impl(btrue,eq3(bfalse,bfalse))), inference(closure_rule, [i_0_50])). % 0.20/0.38 cnf(i_0_240, plain, (eq3(eq5(btrue,bfalse),eq5(btrue,bfalse))=impl(btrue,eq3(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_240, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_70, plain, (eq5(btrue,bfalse)=bfalse)). % 0.20/0.38 cnf(i_0_69, plain, (eq5(bfalse,btrue)=bfalse)). % 0.20/0.38 cnf(i_0_51, plain, (impl(bfalse,X1)=btrue)). % 0.20/0.38 cnf(i_0_50, plain, (impl(btrue,X1)=X1)). % 0.20/0.38 cnf(i_0_89, plain, (eq(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_58, plain, (linP(pE)=nil)). % 0.20/0.38 cnf(i_0_92, plain, (eq4(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_90, plain, (eq2(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_91, plain, (eq3(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_93, plain, (eq5(X1,X1)=btrue)). % 0.20/0.38 cnf(i_0_52, plain, (append(nil,X1)=X1)). % 0.20/0.38 cnf(i_0_61, plain, (eq2(a,b)=bfalse)). % 0.20/0.38 cnf(i_0_62, plain, (eq2(b,a)=bfalse)). % 0.20/0.38 cnf(i_0_63, plain, (eq3(pA,pB)=bfalse)). % 0.20/0.38 cnf(i_0_64, plain, (eq3(pA,pE)=bfalse)). % 0.20/0.39 cnf(i_0_65, plain, (eq3(pB,pA)=bfalse)). % 0.20/0.39 cnf(i_0_66, plain, (eq3(pB,pE)=bfalse)). % 0.20/0.39 cnf(i_0_67, plain, (eq3(pE,pA)=bfalse)). % 0.20/0.39 cnf(i_0_68, plain, (eq3(pE,pB)=bfalse)). % 0.20/0.39 cnf(i_0_56, plain, (linP(pA)=cons(a,nil))). % 0.20/0.39 cnf(i_0_57, plain, (linP(pB)=cons(b,nil))). % 0.20/0.39 cnf(i_0_81, plain, (eq3(pA,aP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_82, plain, (eq3(pA,bP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_83, plain, (eq3(pB,aP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_84, plain, (eq3(pB,bP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_85, plain, (eq3(pE,aP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_86, plain, (eq3(pE,bP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_74, plain, (eq3(aP(X1),pA)=bfalse)). % 0.20/0.39 cnf(i_0_75, plain, (eq3(aP(X1),pB)=bfalse)). % 0.20/0.39 cnf(i_0_76, plain, (eq3(aP(X1),pE)=bfalse)). % 0.20/0.39 cnf(i_0_78, plain, (eq3(bP(X1),pA)=bfalse)). % 0.20/0.39 cnf(i_0_79, plain, (eq3(bP(X1),pB)=bfalse)). % 0.20/0.39 cnf(i_0_80, plain, (eq3(bP(X1),pE)=bfalse)). % 0.20/0.39 cnf(i_0_96, plain, (eq(nil,cons(X1,X2))=bfalse)). % 0.20/0.39 cnf(i_0_97, plain, (eq(cons(X1,X2),nil)=bfalse)). % 0.20/0.39 cnf(i_0_73, plain, (eq3(aP(X1),bP(X2))=bfalse)). % 0.20/0.39 cnf(i_0_77, plain, (eq3(bP(X1),aP(X2))=bfalse)). % 0.20/0.39 cnf(i_0_71, plain, (eq3(aP(X1),aP(X2))=eq3(X1,X2))). % 0.20/0.39 cnf(i_0_59, plain, (linC(c2(X1,X2))=append(linP(X1),linP(X2)))). % 0.20/0.39 cnf(i_0_72, plain, (eq3(bP(X1),bP(X2))=eq3(X1,X2))). % 0.20/0.39 cnf(i_0_53, plain, (append(cons(X1,X2),X3)=cons(X1,append(X2,X3)))). % 0.20/0.39 cnf(i_0_54, plain, (cons(a,append(linP(X1),cons(a,nil)))=linP(aP(X1)))). % 0.20/0.39 cnf(i_0_55, plain, (cons(b,append(linP(X1),cons(b,nil)))=linP(bP(X1)))). % 0.20/0.39 cnf(i_0_98, negated_conjecture, (eq5(impl(eq(linC(X1),linC(X2)),eq4(X1,X2)),bfalse)!=btrue)). % 0.20/0.39 cnf(i_0_94, plain, (eq(cons(X1,X2),cons(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.39 cnf(i_0_87, plain, (eq4(c2(X1,X2),c2(X3,X4))=bfalse|eq3(X1,X3)!=bfalse)). % 0.20/0.39 cnf(i_0_95, plain, (eq(cons(X1,X2),cons(X3,X4))=eq(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.39 cnf(i_0_88, plain, (eq4(c2(X1,X2),c2(X3,X4))=eq3(X2,X4)|eq3(X1,X3)!=btrue)). % 0.20/0.39 cnf(i_0_108, plain, (X5=X5)). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 6 steps % 0.20/0.39 cnf(i_0_70, plain, (eq5(btrue,bfalse)=bfalse), inference(start_rule)). % 0.20/0.39 cnf(i_0_125, plain, (eq5(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_122])). % 0.20/0.39 cnf(i_0_220, plain, (eq5(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_70])). % 0.20/0.39 cnf(i_0_219, plain, (eq2(eq5(btrue,bfalse),eq5(btrue,bfalse))=eq2(bfalse,bfalse)), inference(extension_rule, [i_0_111])). % 0.20/0.39 cnf(i_0_242, plain, (eq2(bfalse,bfalse)!=impl(btrue,eq2(bfalse,bfalse))), inference(closure_rule, [i_0_50])). % 0.20/0.39 cnf(i_0_240, plain, (eq2(eq5(btrue,bfalse),eq5(btrue,bfalse))=impl(btrue,eq2(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_240, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_70, plain, (eq5(btrue,bfalse)=bfalse)). % 0.20/0.39 cnf(i_0_69, plain, (eq5(bfalse,btrue)=bfalse)). % 0.20/0.39 cnf(i_0_51, plain, (impl(bfalse,X1)=btrue)). % 0.20/0.39 cnf(i_0_50, plain, (impl(btrue,X1)=X1)). % 0.20/0.39 cnf(i_0_89, plain, (eq(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_58, plain, (linP(pE)=nil)). % 0.20/0.39 cnf(i_0_92, plain, (eq4(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_90, plain, (eq2(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_91, plain, (eq3(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_93, plain, (eq5(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_52, plain, (append(nil,X1)=X1)). % 0.20/0.39 cnf(i_0_61, plain, (eq2(a,b)=bfalse)). % 0.20/0.39 cnf(i_0_62, plain, (eq2(b,a)=bfalse)). % 0.20/0.39 cnf(i_0_63, plain, (eq3(pA,pB)=bfalse)). % 0.20/0.39 cnf(i_0_64, plain, (eq3(pA,pE)=bfalse)). % 0.20/0.39 cnf(i_0_65, plain, (eq3(pB,pA)=bfalse)). % 0.20/0.39 cnf(i_0_66, plain, (eq3(pB,pE)=bfalse)). % 0.20/0.39 cnf(i_0_67, plain, (eq3(pE,pA)=bfalse)). % 0.20/0.39 cnf(i_0_68, plain, (eq3(pE,pB)=bfalse)). % 0.20/0.39 cnf(i_0_56, plain, (linP(pA)=cons(a,nil))). % 0.20/0.39 cnf(i_0_57, plain, (linP(pB)=cons(b,nil))). % 0.20/0.39 cnf(i_0_81, plain, (eq3(pA,aP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_82, plain, (eq3(pA,bP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_83, plain, (eq3(pB,aP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_84, plain, (eq3(pB,bP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_85, plain, (eq3(pE,aP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_86, plain, (eq3(pE,bP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_74, plain, (eq3(aP(X1),pA)=bfalse)). % 0.20/0.39 cnf(i_0_75, plain, (eq3(aP(X1),pB)=bfalse)). % 0.20/0.39 cnf(i_0_76, plain, (eq3(aP(X1),pE)=bfalse)). % 0.20/0.39 cnf(i_0_78, plain, (eq3(bP(X1),pA)=bfalse)). % 0.20/0.39 cnf(i_0_79, plain, (eq3(bP(X1),pB)=bfalse)). % 0.20/0.39 cnf(i_0_80, plain, (eq3(bP(X1),pE)=bfalse)). % 0.20/0.39 cnf(i_0_96, plain, (eq(nil,cons(X1,X2))=bfalse)). % 0.20/0.39 cnf(i_0_97, plain, (eq(cons(X1,X2),nil)=bfalse)). % 0.20/0.39 cnf(i_0_73, plain, (eq3(aP(X1),bP(X2))=bfalse)). % 0.20/0.39 cnf(i_0_77, plain, (eq3(bP(X1),aP(X2))=bfalse)). % 0.20/0.39 cnf(i_0_71, plain, (eq3(aP(X1),aP(X2))=eq3(X1,X2))). % 0.20/0.39 cnf(i_0_59, plain, (linC(c2(X1,X2))=append(linP(X1),linP(X2)))). % 0.20/0.39 cnf(i_0_72, plain, (eq3(bP(X1),bP(X2))=eq3(X1,X2))). % 0.20/0.39 cnf(i_0_53, plain, (append(cons(X1,X2),X3)=cons(X1,append(X2,X3)))). % 0.20/0.39 cnf(i_0_54, plain, (cons(a,append(linP(X1),cons(a,nil)))=linP(aP(X1)))). % 0.20/0.39 cnf(i_0_55, plain, (cons(b,append(linP(X1),cons(b,nil)))=linP(bP(X1)))). % 0.20/0.39 cnf(i_0_98, negated_conjecture, (eq5(impl(eq(linC(X1),linC(X2)),eq4(X1,X2)),bfalse)!=btrue)). % 0.20/0.39 cnf(i_0_94, plain, (eq(cons(X1,X2),cons(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.39 cnf(i_0_87, plain, (eq4(c2(X1,X2),c2(X3,X4))=bfalse|eq3(X1,X3)!=bfalse)). % 0.20/0.39 cnf(i_0_95, plain, (eq(cons(X1,X2),cons(X3,X4))=eq(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.39 cnf(i_0_88, plain, (eq4(c2(X1,X2),c2(X3,X4))=eq3(X2,X4)|eq3(X1,X3)!=btrue)). % 0.20/0.39 cnf(i_0_108, plain, (X5=X5)). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 6 steps % 0.20/0.39 cnf(i_0_70, plain, (eq5(btrue,bfalse)=bfalse), inference(start_rule)). % 0.20/0.39 cnf(i_0_125, plain, (eq5(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_122])). % 0.20/0.39 cnf(i_0_221, plain, (eq5(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_70])). % 0.20/0.39 cnf(i_0_219, plain, (eq2(eq5(btrue,bfalse),eq5(btrue,bfalse))=eq2(bfalse,bfalse)), inference(extension_rule, [i_0_111])). % 0.20/0.39 cnf(i_0_242, plain, (eq2(bfalse,bfalse)!=impl(btrue,eq2(bfalse,bfalse))), inference(closure_rule, [i_0_50])). % 0.20/0.39 cnf(i_0_240, plain, (eq2(eq5(btrue,bfalse),eq5(btrue,bfalse))=impl(btrue,eq2(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_240, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 1 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_70, plain, (eq5(btrue,bfalse)=bfalse)). % 0.20/0.39 cnf(i_0_69, plain, (eq5(bfalse,btrue)=bfalse)). % 0.20/0.39 cnf(i_0_51, plain, (impl(bfalse,X1)=btrue)). % 0.20/0.39 cnf(i_0_50, plain, (impl(btrue,X1)=X1)). % 0.20/0.39 cnf(i_0_89, plain, (eq(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_58, plain, (linP(pE)=nil)). % 0.20/0.39 cnf(i_0_92, plain, (eq4(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_90, plain, (eq2(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_91, plain, (eq3(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_93, plain, (eq5(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_52, plain, (append(nil,X1)=X1)). % 0.20/0.39 cnf(i_0_61, plain, (eq2(a,b)=bfalse)). % 0.20/0.39 cnf(i_0_62, plain, (eq2(b,a)=bfalse)). % 0.20/0.39 cnf(i_0_63, plain, (eq3(pA,pB)=bfalse)). % 0.20/0.39 cnf(i_0_64, plain, (eq3(pA,pE)=bfalse)). % 0.20/0.39 cnf(i_0_65, plain, (eq3(pB,pA)=bfalse)). % 0.20/0.39 cnf(i_0_66, plain, (eq3(pB,pE)=bfalse)). % 0.20/0.39 cnf(i_0_67, plain, (eq3(pE,pA)=bfalse)). % 0.20/0.39 cnf(i_0_68, plain, (eq3(pE,pB)=bfalse)). % 0.20/0.39 cnf(i_0_56, plain, (linP(pA)=cons(a,nil))). % 0.20/0.39 cnf(i_0_57, plain, (linP(pB)=cons(b,nil))). % 0.20/0.39 cnf(i_0_81, plain, (eq3(pA,aP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_82, plain, (eq3(pA,bP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_83, plain, (eq3(pB,aP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_84, plain, (eq3(pB,bP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_85, plain, (eq3(pE,aP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_86, plain, (eq3(pE,bP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_74, plain, (eq3(aP(X1),pA)=bfalse)). % 0.20/0.39 cnf(i_0_75, plain, (eq3(aP(X1),pB)=bfalse)). % 0.20/0.39 cnf(i_0_76, plain, (eq3(aP(X1),pE)=bfalse)). % 0.20/0.39 cnf(i_0_78, plain, (eq3(bP(X1),pA)=bfalse)). % 0.20/0.39 cnf(i_0_79, plain, (eq3(bP(X1),pB)=bfalse)). % 0.20/0.39 cnf(i_0_80, plain, (eq3(bP(X1),pE)=bfalse)). % 0.20/0.39 cnf(i_0_96, plain, (eq(nil,cons(X1,X2))=bfalse)). % 0.20/0.39 cnf(i_0_97, plain, (eq(cons(X1,X2),nil)=bfalse)). % 0.20/0.39 cnf(i_0_73, plain, (eq3(aP(X1),bP(X2))=bfalse)). % 0.20/0.39 cnf(i_0_77, plain, (eq3(bP(X1),aP(X2))=bfalse)). % 0.20/0.39 cnf(i_0_71, plain, (eq3(aP(X1),aP(X2))=eq3(X1,X2))). % 0.20/0.39 cnf(i_0_59, plain, (linC(c2(X1,X2))=append(linP(X1),linP(X2)))). % 0.20/0.39 cnf(i_0_72, plain, (eq3(bP(X1),bP(X2))=eq3(X1,X2))). % 0.20/0.39 cnf(i_0_53, plain, (append(cons(X1,X2),X3)=cons(X1,append(X2,X3)))). % 0.20/0.39 cnf(i_0_54, plain, (cons(a,append(linP(X1),cons(a,nil)))=linP(aP(X1)))). % 0.20/0.39 cnf(i_0_55, plain, (cons(b,append(linP(X1),cons(b,nil)))=linP(bP(X1)))). % 0.20/0.39 cnf(i_0_98, negated_conjecture, (eq5(impl(eq(linC(X1),linC(X2)),eq4(X1,X2)),bfalse)!=btrue)). % 0.20/0.39 cnf(i_0_94, plain, (eq(cons(X1,X2),cons(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.39 cnf(i_0_87, plain, (eq4(c2(X1,X2),c2(X3,X4))=bfalse|eq3(X1,X3)!=bfalse)). % 0.20/0.39 cnf(i_0_95, plain, (eq(cons(X1,X2),cons(X3,X4))=eq(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.39 cnf(i_0_88, plain, (eq4(c2(X1,X2),c2(X3,X4))=eq3(X2,X4)|eq3(X1,X3)!=btrue)). % 0.20/0.39 cnf(i_0_108, plain, (X5=X5)). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 6 steps % 0.20/0.39 cnf(i_0_70, plain, (eq5(btrue,bfalse)=bfalse), inference(start_rule)). % 0.20/0.39 cnf(i_0_125, plain, (eq5(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_121])). % 0.20/0.39 cnf(i_0_217, plain, (eq5(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_70])). % 0.20/0.39 cnf(i_0_216, plain, (eq4(eq5(btrue,bfalse),eq5(btrue,bfalse))=eq4(bfalse,bfalse)), inference(extension_rule, [i_0_111])). % 0.20/0.39 cnf(i_0_242, plain, (eq4(bfalse,bfalse)!=impl(btrue,eq4(bfalse,bfalse))), inference(closure_rule, [i_0_50])). % 0.20/0.39 cnf(i_0_240, plain, (eq4(eq5(btrue,bfalse),eq5(btrue,bfalse))=impl(btrue,eq4(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_240, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 1 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_70, plain, (eq5(btrue,bfalse)=bfalse)). % 0.20/0.39 cnf(i_0_69, plain, (eq5(bfalse,btrue)=bfalse)). % 0.20/0.39 cnf(i_0_51, plain, (impl(bfalse,X1)=btrue)). % 0.20/0.39 cnf(i_0_50, plain, (impl(btrue,X1)=X1)). % 0.20/0.39 cnf(i_0_89, plain, (eq(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_58, plain, (linP(pE)=nil)). % 0.20/0.39 cnf(i_0_92, plain, (eq4(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_90, plain, (eq2(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_91, plain, (eq3(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_93, plain, (eq5(X1,X1)=btrue)). % 0.20/0.39 cnf(i_0_52, plain, (append(nil,X1)=X1)). % 0.20/0.39 cnf(i_0_61, plain, (eq2(a,b)=bfalse)). % 0.20/0.39 cnf(i_0_62, plain, (eq2(b,a)=bfalse)). % 0.20/0.39 cnf(i_0_63, plain, (eq3(pA,pB)=bfalse)). % 0.20/0.39 cnf(i_0_64, plain, (eq3(pA,pE)=bfalse)). % 0.20/0.39 cnf(i_0_65, plain, (eq3(pB,pA)=bfalse)). % 0.20/0.39 cnf(i_0_66, plain, (eq3(pB,pE)=bfalse)). % 0.20/0.39 cnf(i_0_67, plain, (eq3(pE,pA)=bfalse)). % 0.20/0.39 cnf(i_0_68, plain, (eq3(pE,pB)=bfalse)). % 0.20/0.39 cnf(i_0_56, plain, (linP(pA)=cons(a,nil))). % 0.20/0.39 cnf(i_0_57, plain, (linP(pB)=cons(b,nil))). % 0.20/0.39 cnf(i_0_81, plain, (eq3(pA,aP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_82, plain, (eq3(pA,bP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_83, plain, (eq3(pB,aP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_84, plain, (eq3(pB,bP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_85, plain, (eq3(pE,aP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_86, plain, (eq3(pE,bP(X1))=bfalse)). % 0.20/0.39 cnf(i_0_74, plain, (eq3(aP(X1),pA)=bfalse)). % 0.20/0.39 cnf(i_0_75, plain, (eq3(aP(X1),pB)=bfalse)). % 0.20/0.39 cnf(i_0_76, plain, (eq3(aP(X1),pE)=bfalse)). % 0.20/0.39 cnf(i_0_78, plain, (eq3(bP(X1),pA)=bfalse)). % 0.20/0.39 cnf(i_0_79, plain, (eq3(bP(X1),pB)=bfalse)). % 0.20/0.39 cnf(i_0_80, plain, (eq3(bP(X1),pE)=bfalse)). % 0.20/0.39 cnf(i_0_96, plain, (eq(nil,cons(X1,X2))=bfalse)). % 0.20/0.39 cnf(i_0_97, plain, (eq(cons(X1,X2),nil)=bfalse)). % 0.20/0.39 cnf(i_0_73, plain, (eq3(aP(X1),bP(X2))=bfalse)). % 0.20/0.39 cnf(i_0_77, plain, (eq3(bP(X1),aP(X2))=bfalse)). % 0.20/0.39 cnf(i_0_71, plain, (eq3(aP(X1),aP(X2))=eq3(X1,X2))). % 0.20/0.39 cnf(i_0_59, plain, (linC(c2(X1,X2))=append(linP(X1),linP(X2)))). % 0.20/0.39 cnf(i_0_72, plain, (eq3(bP(X1),bP(X2))=eq3(X1,X2))). % 0.20/0.39 cnf(i_0_53, plain, (append(cons(X1,X2),X3)=cons(X1,append(X2,X3)))). % 0.20/0.39 cnf(i_0_54, plain, (cons(a,append(linP(X1),cons(a,nil)))=linP(aP(X1)))). % 0.20/0.39 cnf(i_0_55, plain, (cons(b,append(linP(X1),cons(b,nil)))=linP(bP(X1)))). % 0.20/0.39 cnf(i_0_98, negated_conjecture, (eq5(impl(eq(linC(X1),linC(X2)),eq4(X1,X2)),bfalse)!=btrue)). % 0.20/0.39 cnf(i_0_94, plain, (eq(cons(X1,X2),cons(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.39 cnf(i_0_87, plain, (eq4(c2(X1,X2),c2(X3,X4))=bfalse|eq3(X1,X3)!=bfalse)). % 0.20/0.39 cnf(i_0_95, plain, (eq(cons(X1,X2),cons(X3,X4))=eq(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.39 cnf(i_0_88, plain, (eq4(c2(X1,X2),c2(X3,X4))=eq3(X2,X4)|eq3(X1,X3)!=btrue)). % 0.20/0.39 cnf(i_0_108, plain, (X5=X5)). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 6 steps % 0.20/0.39 cnf(i_0_70, plain, (eq5(btrue,bfalse)=bfalse), inference(start_rule)). % 0.20/0.39 cnf(i_0_125, plain, (eq5(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_121])). % 0.20/0.39 cnf(i_0_218, plain, (eq5(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_70])). % 0.20/0.39 cnf(i_0_216, plain, (eq4(eq5(btrue,bfalse),eq5(btrue,bfalse))=eq4(bfalse,bfalse)), inference(extension_rule, [i_0_111])). % 0.20/0.39 cnf(i_0_242, plain, (eq4(bfalse,bfalse)!=impl(btrue,eq4(bfalse,bfalse))), inference(closure_rule, [i_0_50])). % 0.20/0.39 cnf(i_0_240, plain, (eq4(eq5(btrue,bfalse),eq5(btrue,bfalse))=impl(btrue,eq4(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_240, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Child (7529) has found a proof. % 0.20/0.39 % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------