%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ALG069-10 : TPTP v8.1.0. Released v7.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 : n027.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Thu Jul 14 16:51:25 EDT 2022 % Result : Unsatisfiable 0.19s 0.41s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : ALG069-10 : TPTP v8.1.0. Released v7.3.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n027.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Wed Jun 8 08:23:11 EDT 2022 % 0.13/0.33 % CPUTime : % 0.19/0.38 # No SInE strategy applied % 0.19/0.38 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.19/0.38 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.19/0.38 # % 0.19/0.38 # Number of axioms: 14 Number of unprocessed: 14 % 0.19/0.38 # Tableaux proof search. % 0.19/0.38 # APR header successfully linked. % 0.19/0.38 # Hello from C++ % 0.19/0.38 # The folding up rule is enabled... % 0.19/0.38 # Local unification is enabled... % 0.19/0.38 # Any saturation attempts will use folding labels... % 0.19/0.38 # 14 beginning clauses after preprocessing and clausification % 0.19/0.38 # Creating start rules for all 6 conjectures. % 0.19/0.38 # There are 6 start rule candidates: % 0.19/0.38 # Found 14 unit axioms. % 0.19/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.38 # 6 start rule tableaux created. % 0.19/0.38 # 0 extension rule candidate clauses % 0.19/0.38 # 14 unit axiom clauses % 0.19/0.38 % 0.19/0.38 # Requested 8, 32 cores available to the main process. % 0.19/0.38 # There are not enough tableaux to fork, creating more from the initial 6 % 0.19/0.38 # Creating equality axioms % 0.19/0.38 # Ran out of tableaux, making start rules for all clauses % 0.19/0.38 # Returning from population with 35 new_tableaux and 0 remaining starting tableaux. % 0.19/0.38 # We now have 35 tableaux to operate on % 0.19/0.41 # There were 1 total branch saturation attempts. % 0.19/0.41 # There were 0 of these attempts blocked. % 0.19/0.41 # There were 0 deferred branch saturation attempts. % 0.19/0.41 # There were 0 free duplicated saturations. % 0.19/0.41 # There were 1 total successful branch saturations. % 0.19/0.41 # There were 0 successful branch saturations in interreduction. % 0.19/0.41 # There were 0 successful branch saturations on the branch. % 0.19/0.41 # There were 1 successful branch saturations after the branch. % 0.19/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.41 # Begin clausification derivation % 0.19/0.41 % 0.19/0.41 # End clausification derivation % 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.41 cnf(i_0_22, plain, (sorti2(sK1_ax4_U)=true)). % 0.19/0.41 cnf(i_0_21, plain, (tuple(op2(X1,X1),sorti2(X1))!=tuple(sK1_ax4_U,true))). % 0.19/0.41 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.19/0.41 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.19/0.41 cnf(i_0_19, plain, (ifeq(sorti1(X1),true,sorti1(sK2_ax3_V(X1)),true)=true)). % 0.19/0.41 cnf(i_0_23, negated_conjecture, (ifeq(sorti1(X1),true,sorti2(h(X1)),true)=true)). % 0.19/0.41 cnf(i_0_26, negated_conjecture, (ifeq(sorti2(X1),true,sorti1(j(X1)),true)=true)). % 0.19/0.41 cnf(i_0_25, negated_conjecture, (ifeq2(sorti1(X1),true,j(h(X1)),X1)=X1)). % 0.19/0.41 cnf(i_0_28, negated_conjecture, (ifeq2(sorti2(X1),true,h(j(X1)),X1)=X1)). % 0.19/0.41 cnf(i_0_20, plain, (ifeq2(sorti1(X1),true,op1(sK2_ax3_V(X1),sK2_ax3_V(X1)),X1)=X1)). % 0.19/0.41 cnf(i_0_17, plain, (ifeq(sorti1(X1),true,ifeq(sorti1(X2),true,sorti1(op1(X2,X1)),true),true)=true)). % 0.19/0.41 cnf(i_0_18, plain, (ifeq(sorti2(X1),true,ifeq(sorti2(X2),true,sorti2(op2(X2,X1)),true),true)=true)). % 0.19/0.41 cnf(i_0_24, negated_conjecture, (ifeq2(sorti1(X1),true,ifeq2(sorti1(X2),true,op2(h(X2),h(X1)),h(op1(X2,X1))),h(op1(X2,X1)))=h(op1(X2,X1)))). % 0.19/0.41 cnf(i_0_27, negated_conjecture, (ifeq2(sorti2(X1),true,ifeq2(sorti2(X2),true,op1(j(X2),j(X1)),j(op2(X2,X1))),j(op2(X2,X1)))=j(op2(X2,X1)))). % 0.19/0.41 cnf(i_0_35, plain, (X4=X4)). % 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.41 # Begin printing tableau % 0.19/0.41 # Found 6 steps % 0.19/0.41 cnf(i_0_22, plain, (sorti2(sK1_ax4_U)=true), inference(start_rule)). % 0.19/0.41 cnf(i_0_49, plain, (sorti2(sK1_ax4_U)=true), inference(extension_rule, [i_0_46])). % 0.19/0.41 cnf(i_0_94, plain, (sorti2(sK1_ax4_U)!=true), inference(closure_rule, [i_0_22])). % 0.19/0.41 cnf(i_0_93, plain, (tuple(sorti2(sK1_ax4_U),sorti2(sK1_ax4_U))=tuple(true,true)), inference(extension_rule, [i_0_38])). % 0.19/0.41 cnf(i_0_106, plain, (tuple(true,true)!=ifeq2(sorti1(tuple(true,true)),true,j(h(tuple(true,true))),tuple(true,true))), inference(closure_rule, [i_0_25])). % 0.19/0.41 cnf(i_0_104, plain, (tuple(sorti2(sK1_ax4_U),sorti2(sK1_ax4_U))=ifeq2(sorti1(tuple(true,true)),true,j(h(tuple(true,true))),tuple(true,true))), inference(etableau_closure_rule, [i_0_104, ...])). % 0.19/0.41 # End printing tableau % 0.19/0.41 # SZS output end % 0.19/0.41 # Branches closed with saturation will be marked with an "s" % 0.19/0.42 # There were 1 total branch saturation attempts. % 0.19/0.42 # There were 0 of these attempts blocked. % 0.19/0.42 # There were 0 deferred branch saturation attempts. % 0.19/0.42 # There were 0 free duplicated saturations. % 0.19/0.42 # There were 1 total successful branch saturations. % 0.19/0.42 # There were 0 successful branch saturations in interreduction. % 0.19/0.42 # There were 0 successful branch saturations on the branch. % 0.19/0.42 # There were 1 successful branch saturations after the branch. % 0.19/0.42 # There were 1 total branch saturation attempts. % 0.19/0.42 # There were 0 of these attempts blocked. % 0.19/0.42 # There were 0 deferred branch saturation attempts. % 0.19/0.42 # There were 0 free duplicated saturations. % 0.19/0.42 # There were 1 total successful branch saturations. % 0.19/0.42 # There were 0 successful branch saturations in interreduction. % 0.19/0.42 # There were 0 successful branch saturations on the branch. % 0.19/0.42 # There were 1 successful branch saturations after the branch. % 0.19/0.42 # There were 1 total branch saturation attempts. % 0.19/0.42 # There were 0 of these attempts blocked. % 0.19/0.42 # There were 0 deferred branch saturation attempts. % 0.19/0.42 # There were 0 free duplicated saturations. % 0.19/0.42 # There were 1 total successful branch saturations. % 0.19/0.42 # There were 0 successful branch saturations in interreduction. % 0.19/0.42 # There were 0 successful branch saturations on the branch. % 0.19/0.42 # There were 1 successful branch saturations after the branch. % 0.19/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # Begin clausification derivation % 0.19/0.42 % 0.19/0.42 # End clausification derivation % 0.19/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.42 cnf(i_0_22, plain, (sorti2(sK1_ax4_U)=true)). % 0.19/0.42 cnf(i_0_21, plain, (tuple(op2(X1,X1),sorti2(X1))!=tuple(sK1_ax4_U,true))). % 0.19/0.42 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_19, plain, (ifeq(sorti1(X1),true,sorti1(sK2_ax3_V(X1)),true)=true)). % 0.19/0.42 cnf(i_0_23, negated_conjecture, (ifeq(sorti1(X1),true,sorti2(h(X1)),true)=true)). % 0.19/0.42 cnf(i_0_26, negated_conjecture, (ifeq(sorti2(X1),true,sorti1(j(X1)),true)=true)). % 0.19/0.42 cnf(i_0_25, negated_conjecture, (ifeq2(sorti1(X1),true,j(h(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_28, negated_conjecture, (ifeq2(sorti2(X1),true,h(j(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_20, plain, (ifeq2(sorti1(X1),true,op1(sK2_ax3_V(X1),sK2_ax3_V(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_17, plain, (ifeq(sorti1(X1),true,ifeq(sorti1(X2),true,sorti1(op1(X2,X1)),true),true)=true)). % 0.19/0.42 cnf(i_0_18, plain, (ifeq(sorti2(X1),true,ifeq(sorti2(X2),true,sorti2(op2(X2,X1)),true),true)=true)). % 0.19/0.42 cnf(i_0_24, negated_conjecture, (ifeq2(sorti1(X1),true,ifeq2(sorti1(X2),true,op2(h(X2),h(X1)),h(op1(X2,X1))),h(op1(X2,X1)))=h(op1(X2,X1)))). % 0.19/0.42 cnf(i_0_27, negated_conjecture, (ifeq2(sorti2(X1),true,ifeq2(sorti2(X2),true,op1(j(X2),j(X1)),j(op2(X2,X1))),j(op2(X2,X1)))=j(op2(X2,X1)))). % 0.19/0.42 cnf(i_0_35, plain, (X4=X4)). % 0.19/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.42 # Begin printing tableau % 0.19/0.42 # Found 6 steps % 0.19/0.42 cnf(i_0_22, plain, (sorti2(sK1_ax4_U)=true), inference(start_rule)). % 0.19/0.42 cnf(i_0_49, plain, (sorti2(sK1_ax4_U)=true), inference(extension_rule, [i_0_44])). % 0.19/0.42 cnf(i_0_90, plain, (sorti2(sK1_ax4_U)!=true), inference(closure_rule, [i_0_22])). % 0.19/0.42 cnf(i_0_88, plain, (op2(sorti2(sK1_ax4_U),sorti2(sK1_ax4_U))=op2(true,true)), inference(extension_rule, [i_0_38])). % 0.19/0.42 cnf(i_0_106, plain, (op2(true,true)!=ifeq2(sorti1(op2(true,true)),true,j(h(op2(true,true))),op2(true,true))), inference(closure_rule, [i_0_25])). % 0.19/0.42 cnf(i_0_104, plain, (op2(sorti2(sK1_ax4_U),sorti2(sK1_ax4_U))=ifeq2(sorti1(op2(true,true)),true,j(h(op2(true,true))),op2(true,true))), inference(etableau_closure_rule, [i_0_104, ...])). % 0.19/0.42 # End printing tableau % 0.19/0.42 # SZS output end % 0.19/0.42 # Branches closed with saturation will be marked with an "s" % 0.19/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # Begin clausification derivation % 0.19/0.42 % 0.19/0.42 # End clausification derivation % 0.19/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.42 cnf(i_0_22, plain, (sorti2(sK1_ax4_U)=true)). % 0.19/0.42 cnf(i_0_21, plain, (tuple(op2(X1,X1),sorti2(X1))!=tuple(sK1_ax4_U,true))). % 0.19/0.42 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_19, plain, (ifeq(sorti1(X1),true,sorti1(sK2_ax3_V(X1)),true)=true)). % 0.19/0.42 cnf(i_0_23, negated_conjecture, (ifeq(sorti1(X1),true,sorti2(h(X1)),true)=true)). % 0.19/0.42 cnf(i_0_26, negated_conjecture, (ifeq(sorti2(X1),true,sorti1(j(X1)),true)=true)). % 0.19/0.42 cnf(i_0_25, negated_conjecture, (ifeq2(sorti1(X1),true,j(h(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_28, negated_conjecture, (ifeq2(sorti2(X1),true,h(j(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_20, plain, (ifeq2(sorti1(X1),true,op1(sK2_ax3_V(X1),sK2_ax3_V(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_17, plain, (ifeq(sorti1(X1),true,ifeq(sorti1(X2),true,sorti1(op1(X2,X1)),true),true)=true)). % 0.19/0.42 cnf(i_0_18, plain, (ifeq(sorti2(X1),true,ifeq(sorti2(X2),true,sorti2(op2(X2,X1)),true),true)=true)). % 0.19/0.42 cnf(i_0_24, negated_conjecture, (ifeq2(sorti1(X1),true,ifeq2(sorti1(X2),true,op2(h(X2),h(X1)),h(op1(X2,X1))),h(op1(X2,X1)))=h(op1(X2,X1)))). % 0.19/0.42 cnf(i_0_27, negated_conjecture, (ifeq2(sorti2(X1),true,ifeq2(sorti2(X2),true,op1(j(X2),j(X1)),j(op2(X2,X1))),j(op2(X2,X1)))=j(op2(X2,X1)))). % 0.19/0.42 cnf(i_0_35, plain, (X4=X4)). % 0.19/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.42 # Begin printing tableau % 0.19/0.42 # Found 5 steps % 0.19/0.42 cnf(i_0_22, plain, (sorti2(sK1_ax4_U)=true), inference(start_rule)). % 0.19/0.42 cnf(i_0_49, plain, (sorti2(sK1_ax4_U)=true), inference(extension_rule, [i_0_47])). % 0.19/0.42 cnf(i_0_96, plain, (h(sorti2(sK1_ax4_U))=h(true)), inference(extension_rule, [i_0_38])). % 0.19/0.42 cnf(i_0_106, plain, (h(true)!=ifeq2(sorti1(h(true)),true,j(h(h(true))),h(true))), inference(closure_rule, [i_0_25])). % 0.19/0.42 cnf(i_0_104, plain, (h(sorti2(sK1_ax4_U))=ifeq2(sorti1(h(true)),true,j(h(h(true))),h(true))), inference(etableau_closure_rule, [i_0_104, ...])). % 0.19/0.42 # End printing tableau % 0.19/0.42 # SZS output end % 0.19/0.42 # Branches closed with saturation will be marked with an "s" % 0.19/0.42 # There were 1 total branch saturation attempts. % 0.19/0.42 # There were 0 of these attempts blocked. % 0.19/0.42 # There were 0 deferred branch saturation attempts. % 0.19/0.42 # There were 0 free duplicated saturations. % 0.19/0.42 # There were 1 total successful branch saturations. % 0.19/0.42 # There were 0 successful branch saturations in interreduction. % 0.19/0.42 # There were 0 successful branch saturations on the branch. % 0.19/0.42 # There were 1 successful branch saturations after the branch. % 0.19/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # Begin clausification derivation % 0.19/0.42 % 0.19/0.42 # End clausification derivation % 0.19/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.42 cnf(i_0_22, plain, (sorti2(sK1_ax4_U)=true)). % 0.19/0.42 cnf(i_0_21, plain, (tuple(op2(X1,X1),sorti2(X1))!=tuple(sK1_ax4_U,true))). % 0.19/0.42 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_19, plain, (ifeq(sorti1(X1),true,sorti1(sK2_ax3_V(X1)),true)=true)). % 0.19/0.42 cnf(i_0_23, negated_conjecture, (ifeq(sorti1(X1),true,sorti2(h(X1)),true)=true)). % 0.19/0.42 cnf(i_0_26, negated_conjecture, (ifeq(sorti2(X1),true,sorti1(j(X1)),true)=true)). % 0.19/0.42 cnf(i_0_25, negated_conjecture, (ifeq2(sorti1(X1),true,j(h(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_28, negated_conjecture, (ifeq2(sorti2(X1),true,h(j(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_20, plain, (ifeq2(sorti1(X1),true,op1(sK2_ax3_V(X1),sK2_ax3_V(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_17, plain, (ifeq(sorti1(X1),true,ifeq(sorti1(X2),true,sorti1(op1(X2,X1)),true),true)=true)). % 0.19/0.42 cnf(i_0_18, plain, (ifeq(sorti2(X1),true,ifeq(sorti2(X2),true,sorti2(op2(X2,X1)),true),true)=true)). % 0.19/0.42 cnf(i_0_24, negated_conjecture, (ifeq2(sorti1(X1),true,ifeq2(sorti1(X2),true,op2(h(X2),h(X1)),h(op1(X2,X1))),h(op1(X2,X1)))=h(op1(X2,X1)))). % 0.19/0.42 cnf(i_0_27, negated_conjecture, (ifeq2(sorti2(X1),true,ifeq2(sorti2(X2),true,op1(j(X2),j(X1)),j(op2(X2,X1))),j(op2(X2,X1)))=j(op2(X2,X1)))). % 0.19/0.42 cnf(i_0_35, plain, (X4=X4)). % 0.19/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.42 # Begin printing tableau % 0.19/0.42 # Found 6 steps % 0.19/0.42 cnf(i_0_22, plain, (sorti2(sK1_ax4_U)=true), inference(start_rule)). % 0.19/0.42 cnf(i_0_49, plain, (sorti2(sK1_ax4_U)=true), inference(extension_rule, [i_0_44])). % 0.19/0.42 cnf(i_0_89, plain, (sorti2(sK1_ax4_U)!=true), inference(closure_rule, [i_0_22])). % 0.19/0.42 cnf(i_0_88, plain, (op2(sorti2(sK1_ax4_U),sorti2(sK1_ax4_U))=op2(true,true)), inference(extension_rule, [i_0_38])). % 0.19/0.42 cnf(i_0_106, plain, (op2(true,true)!=ifeq2(sorti1(op2(true,true)),true,j(h(op2(true,true))),op2(true,true))), inference(closure_rule, [i_0_25])). % 0.19/0.42 cnf(i_0_104, plain, (op2(sorti2(sK1_ax4_U),sorti2(sK1_ax4_U))=ifeq2(sorti1(op2(true,true)),true,j(h(op2(true,true))),op2(true,true))), inference(etableau_closure_rule, [i_0_104, ...])). % 0.19/0.42 # End printing tableau % 0.19/0.42 # SZS output end % 0.19/0.42 # Branches closed with saturation will be marked with an "s" % 0.19/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # Begin clausification derivation % 0.19/0.42 % 0.19/0.42 # End clausification derivation % 0.19/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.42 cnf(i_0_22, plain, (sorti2(sK1_ax4_U)=true)). % 0.19/0.42 cnf(i_0_21, plain, (tuple(op2(X1,X1),sorti2(X1))!=tuple(sK1_ax4_U,true))). % 0.19/0.42 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_19, plain, (ifeq(sorti1(X1),true,sorti1(sK2_ax3_V(X1)),true)=true)). % 0.19/0.42 cnf(i_0_23, negated_conjecture, (ifeq(sorti1(X1),true,sorti2(h(X1)),true)=true)). % 0.19/0.42 cnf(i_0_26, negated_conjecture, (ifeq(sorti2(X1),true,sorti1(j(X1)),true)=true)). % 0.19/0.42 cnf(i_0_25, negated_conjecture, (ifeq2(sorti1(X1),true,j(h(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_28, negated_conjecture, (ifeq2(sorti2(X1),true,h(j(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_20, plain, (ifeq2(sorti1(X1),true,op1(sK2_ax3_V(X1),sK2_ax3_V(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_17, plain, (ifeq(sorti1(X1),true,ifeq(sorti1(X2),true,sorti1(op1(X2,X1)),true),true)=true)). % 0.19/0.42 cnf(i_0_18, plain, (ifeq(sorti2(X1),true,ifeq(sorti2(X2),true,sorti2(op2(X2,X1)),true),true)=true)). % 0.19/0.42 cnf(i_0_24, negated_conjecture, (ifeq2(sorti1(X1),true,ifeq2(sorti1(X2),true,op2(h(X2),h(X1)),h(op1(X2,X1))),h(op1(X2,X1)))=h(op1(X2,X1)))). % 0.19/0.42 cnf(i_0_27, negated_conjecture, (ifeq2(sorti2(X1),true,ifeq2(sorti2(X2),true,op1(j(X2),j(X1)),j(op2(X2,X1))),j(op2(X2,X1)))=j(op2(X2,X1)))). % 0.19/0.42 cnf(i_0_35, plain, (X4=X4)). % 0.19/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.42 # Begin printing tableau % 0.19/0.42 # Found 5 steps % 0.19/0.42 cnf(i_0_22, plain, (sorti2(sK1_ax4_U)=true), inference(start_rule)). % 0.19/0.42 cnf(i_0_49, plain, (sorti2(sK1_ax4_U)=true), inference(extension_rule, [i_0_45])). % 0.19/0.42 cnf(i_0_91, plain, (sK2_ax3_V(sorti2(sK1_ax4_U))=sK2_ax3_V(true)), inference(extension_rule, [i_0_38])). % 0.19/0.42 cnf(i_0_106, plain, (sK2_ax3_V(true)!=ifeq2(sorti1(sK2_ax3_V(true)),true,j(h(sK2_ax3_V(true))),sK2_ax3_V(true))), inference(closure_rule, [i_0_25])). % 0.19/0.42 cnf(i_0_104, plain, (sK2_ax3_V(sorti2(sK1_ax4_U))=ifeq2(sorti1(sK2_ax3_V(true)),true,j(h(sK2_ax3_V(true))),sK2_ax3_V(true))), inference(etableau_closure_rule, [i_0_104, ...])). % 0.19/0.42 # End printing tableau % 0.19/0.42 # SZS output end % 0.19/0.42 # Branches closed with saturation will be marked with an "s" % 0.19/0.42 # There were 1 total branch saturation attempts. % 0.19/0.42 # There were 0 of these attempts blocked. % 0.19/0.42 # There were 0 deferred branch saturation attempts. % 0.19/0.42 # There were 0 free duplicated saturations. % 0.19/0.42 # There were 1 total successful branch saturations. % 0.19/0.42 # There were 0 successful branch saturations in interreduction. % 0.19/0.42 # There were 0 successful branch saturations on the branch. % 0.19/0.42 # There were 1 successful branch saturations after the branch. % 0.19/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # Begin clausification derivation % 0.19/0.42 % 0.19/0.42 # End clausification derivation % 0.19/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.42 cnf(i_0_22, plain, (sorti2(sK1_ax4_U)=true)). % 0.19/0.42 cnf(i_0_21, plain, (tuple(op2(X1,X1),sorti2(X1))!=tuple(sK1_ax4_U,true))). % 0.19/0.42 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_19, plain, (ifeq(sorti1(X1),true,sorti1(sK2_ax3_V(X1)),true)=true)). % 0.19/0.42 cnf(i_0_23, negated_conjecture, (ifeq(sorti1(X1),true,sorti2(h(X1)),true)=true)). % 0.19/0.42 cnf(i_0_26, negated_conjecture, (ifeq(sorti2(X1),true,sorti1(j(X1)),true)=true)). % 0.19/0.42 cnf(i_0_25, negated_conjecture, (ifeq2(sorti1(X1),true,j(h(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_28, negated_conjecture, (ifeq2(sorti2(X1),true,h(j(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_20, plain, (ifeq2(sorti1(X1),true,op1(sK2_ax3_V(X1),sK2_ax3_V(X1)),X1)=X1)). % 0.19/0.42 cnf(i_0_17, plain, (ifeq(sorti1(X1),true,ifeq(sorti1(X2),true,sorti1(op1(X2,X1)),true),true)=true)). % 0.19/0.42 cnf(i_0_18, plain, (ifeq(sorti2(X1),true,ifeq(sorti2(X2),true,sorti2(op2(X2,X1)),true),true)=true)). % 0.19/0.42 cnf(i_0_24, negated_conjecture, (ifeq2(sorti1(X1),true,ifeq2(sorti1(X2),true,op2(h(X2),h(X1)),h(op1(X2,X1))),h(op1(X2,X1)))=h(op1(X2,X1)))). % 0.19/0.42 cnf(i_0_27, negated_conjecture, (ifeq2(sorti2(X1),true,ifeq2(sorti2(X2),true,op1(j(X2),j(X1)),j(op2(X2,X1))),j(op2(X2,X1)))=j(op2(X2,X1)))). % 0.19/0.42 cnf(i_0_35, plain, (X4=X4)). % 0.19/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.42 # Begin printing tableau % 0.19/0.42 # Found 5 steps % 0.19/0.42 cnf(i_0_22, plain, (sorti2(sK1_ax4_U)=true), inference(start_rule)). % 0.19/0.42 cnf(i_0_49, plain, (sorti2(sK1_ax4_U)=true), inference(extension_rule, [i_0_48])). % 0.19/0.42 cnf(i_0_98, plain, (j(sorti2(sK1_ax4_U))=j(true)), inference(extension_rule, [i_0_38])). % 0.19/0.42 cnf(i_0_106, plain, (j(true)!=ifeq2(sorti1(j(true)),true,j(h(j(true))),j(true))), inference(closure_rule, [i_0_25])). % 0.19/0.42 cnf(i_0_104, plain, (j(sorti2(sK1_ax4_U))=ifeq2(sorti1(j(true)),true,j(h(j(true))),j(true))), inference(etableau_closure_rule, [i_0_104, ...])). % 0.19/0.42 # End printing tableau % 0.19/0.42 # SZS output end % 0.19/0.42 # Branches closed with saturation will be marked with an "s" % 0.19/0.42 # Child (2218) has found a proof. % 0.19/0.42 % 0.19/0.42 # Proof search is over... % 0.19/0.42 # Freeing feature tree %------------------------------------------------------------------------------