%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MSC014-10 : TPTP v8.1.0. Released v7.5.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 : n010.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 : Sun Jul 17 22:43:17 EDT 2022 % Result : Satisfiable 0.19s 0.42s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : MSC014-10 : TPTP v8.1.0. Released v7.5.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n010.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Fri Jul 1 15:58:03 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 12 Number of unprocessed: 12 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 12 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 12 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 0 extension rule candidate clauses % 0.12/0.36 # 12 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.36 # Creating equality axioms % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 33 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 33 tableaux to operate on % 0.19/0.42 # 29590 Satisfiable branch % 0.19/0.42 # 29592 Satisfiable branch % 0.19/0.42 # 29593 Satisfiable branch % 0.19/0.42 # 29591 Satisfiable branch % 0.19/0.42 # 29594 Satisfiable branch % 0.19/0.42 # Satisfiable branch found. % 0.19/0.42 # 29595 Satisfiable 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 0 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 0 successful branch saturations after the branch. % 0.19/0.42 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox/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_15, plain, (equalish(n0,n0)=true)). % 0.19/0.42 cnf(i_0_16, plain, (equalish(n1,n1)=true)). % 0.19/0.42 cnf(i_0_22, plain, (ifeq(equalish(n0,n1),true,a,b)=b)). % 0.19/0.42 cnf(i_0_23, plain, (ifeq(equalish(n1,n0),true,a,b)=b)). % 0.19/0.42 cnf(i_0_13, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_14, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_18, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X9,X4),true),true)=true)). % 0.19/0.42 cnf(i_0_19, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X8,X3),true),true)=true)). % 0.19/0.42 cnf(i_0_20, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X7,X2),true),true)=true)). % 0.19/0.42 cnf(i_0_21, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X6,X1),true),true)=true)). % 0.19/0.42 cnf(i_0_17, plain, (ifeq2(equalish(X1,X1),true,ifeq2(equalish(X2,X2),true,ifeq2(equalish(X3,X3),true,ifeq2(equalish(X4,X4),true,f(X4,X3,X2,X1,sK1_exists_f_Z(X4,X3,X2,X1)),true),true),true),true)=true)). % 0.19/0.42 cnf(i_0_24, negated_conjecture, (a!=b)). % 0.19/0.42 cnf(i_0_26, plain, (X10=X10)). % 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 10 steps % 0.19/0.42 cnf(i_0_15, plain, (equalish(n0,n0)=true), inference(start_rule)). % 0.19/0.42 cnf(i_0_35, plain, (equalish(n0,n0)=true), inference(extension_rule, [i_0_34])). % 0.19/0.42 cnf(i_0_74, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_75, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_76, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_77, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_73, plain, (f(equalish(n0,n0),equalish(n0,n0),equalish(n0,n0),equalish(n0,n0),equalish(n0,n0))=f(true,true,true,true,true)), inference(extension_rule, [i_0_30])). % 0.19/0.42 cnf(i_0_201, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_202, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_203, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 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 # Satisfiable branch found. % 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 0 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 0 successful branch saturations after the branch. % 0.19/0.42 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox/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_15, plain, (equalish(n0,n0)=true)). % 0.19/0.42 cnf(i_0_16, plain, (equalish(n1,n1)=true)). % 0.19/0.42 cnf(i_0_22, plain, (ifeq(equalish(n0,n1),true,a,b)=b)). % 0.19/0.42 cnf(i_0_23, plain, (ifeq(equalish(n1,n0),true,a,b)=b)). % 0.19/0.42 cnf(i_0_13, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_14, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_18, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X9,X4),true),true)=true)). % 0.19/0.42 cnf(i_0_19, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X8,X3),true),true)=true)). % 0.19/0.42 cnf(i_0_20, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X7,X2),true),true)=true)). % 0.19/0.42 cnf(i_0_21, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X6,X1),true),true)=true)). % 0.19/0.42 cnf(i_0_17, plain, (ifeq2(equalish(X1,X1),true,ifeq2(equalish(X2,X2),true,ifeq2(equalish(X3,X3),true,ifeq2(equalish(X4,X4),true,f(X4,X3,X2,X1,sK1_exists_f_Z(X4,X3,X2,X1)),true),true),true),true)=true)). % 0.19/0.42 cnf(i_0_24, negated_conjecture, (a!=b)). % 0.19/0.42 cnf(i_0_26, plain, (X10=X10)). % 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 10 steps % 0.19/0.42 cnf(i_0_15, plain, (equalish(n0,n0)=true), inference(start_rule)). % 0.19/0.42 cnf(i_0_35, plain, (equalish(n0,n0)=true), inference(extension_rule, [i_0_34])). % 0.19/0.42 cnf(i_0_74, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_75, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_77, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_78, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_73, plain, (f(equalish(n0,n0),equalish(n0,n0),equalish(n0,n0),equalish(n0,n0),equalish(n0,n0))=f(true,true,true,true,true)), inference(extension_rule, [i_0_30])). % 0.19/0.42 cnf(i_0_201, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_202, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_203, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 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 # Satisfiable branch found. % 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 0 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 0 successful branch saturations after the branch. % 0.19/0.42 # Satisfiable branch found. % 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 0 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 0 successful branch saturations after the branch. % 0.19/0.42 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox/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_15, plain, (equalish(n0,n0)=true)). % 0.19/0.42 cnf(i_0_16, plain, (equalish(n1,n1)=true)). % 0.19/0.42 cnf(i_0_22, plain, (ifeq(equalish(n0,n1),true,a,b)=b)). % 0.19/0.42 cnf(i_0_23, plain, (ifeq(equalish(n1,n0),true,a,b)=b)). % 0.19/0.42 cnf(i_0_13, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_14, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_18, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X9,X4),true),true)=true)). % 0.19/0.42 cnf(i_0_19, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X8,X3),true),true)=true)). % 0.19/0.42 cnf(i_0_20, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X7,X2),true),true)=true)). % 0.19/0.42 cnf(i_0_21, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X6,X1),true),true)=true)). % 0.19/0.42 cnf(i_0_17, plain, (ifeq2(equalish(X1,X1),true,ifeq2(equalish(X2,X2),true,ifeq2(equalish(X3,X3),true,ifeq2(equalish(X4,X4),true,f(X4,X3,X2,X1,sK1_exists_f_Z(X4,X3,X2,X1)),true),true),true),true)=true)). % 0.19/0.42 cnf(i_0_24, negated_conjecture, (a!=b)). % 0.19/0.42 cnf(i_0_26, plain, (X10=X10)). % 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 10 steps % 0.19/0.42 cnf(i_0_15, plain, (equalish(n0,n0)=true), inference(start_rule)). % 0.19/0.42 cnf(i_0_35, plain, (equalish(n0,n0)=true), inference(extension_rule, [i_0_34])). % 0.19/0.42 cnf(i_0_74, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_75, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_76, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_78, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_73, plain, (f(equalish(n0,n0),equalish(n0,n0),equalish(n0,n0),equalish(n0,n0),equalish(n0,n0))=f(true,true,true,true,true)), inference(extension_rule, [i_0_30])). % 0.19/0.42 cnf(i_0_201, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_202, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_203, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 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 Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox/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_15, plain, (equalish(n0,n0)=true)). % 0.19/0.42 cnf(i_0_16, plain, (equalish(n1,n1)=true)). % 0.19/0.42 cnf(i_0_22, plain, (ifeq(equalish(n0,n1),true,a,b)=b)). % 0.19/0.42 cnf(i_0_23, plain, (ifeq(equalish(n1,n0),true,a,b)=b)). % 0.19/0.42 cnf(i_0_13, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_14, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_18, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X9,X4),true),true)=true)). % 0.19/0.42 cnf(i_0_19, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X8,X3),true),true)=true)). % 0.19/0.42 cnf(i_0_20, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X7,X2),true),true)=true)). % 0.19/0.42 cnf(i_0_21, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X6,X1),true),true)=true)). % 0.19/0.42 cnf(i_0_17, plain, (ifeq2(equalish(X1,X1),true,ifeq2(equalish(X2,X2),true,ifeq2(equalish(X3,X3),true,ifeq2(equalish(X4,X4),true,f(X4,X3,X2,X1,sK1_exists_f_Z(X4,X3,X2,X1)),true),true),true),true)=true)). % 0.19/0.42 cnf(i_0_24, negated_conjecture, (a!=b)). % 0.19/0.42 cnf(i_0_26, plain, (X10=X10)). % 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 10 steps % 0.19/0.42 cnf(i_0_15, plain, (equalish(n0,n0)=true), inference(start_rule)). % 0.19/0.42 cnf(i_0_35, plain, (equalish(n0,n0)=true), inference(extension_rule, [i_0_34])). % 0.19/0.42 cnf(i_0_74, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_76, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_77, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_78, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_73, plain, (f(equalish(n0,n0),equalish(n0,n0),equalish(n0,n0),equalish(n0,n0),equalish(n0,n0))=f(true,true,true,true,true)), inference(extension_rule, [i_0_30])). % 0.19/0.42 cnf(i_0_201, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_202, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_203, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 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 # 29597 Satisfiable branch % 0.19/0.42 # Satisfiable branch found. % 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 0 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 0 successful branch saturations after the branch. % 0.19/0.42 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox/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_15, plain, (equalish(n0,n0)=true)). % 0.19/0.42 cnf(i_0_16, plain, (equalish(n1,n1)=true)). % 0.19/0.42 cnf(i_0_22, plain, (ifeq(equalish(n0,n1),true,a,b)=b)). % 0.19/0.42 cnf(i_0_23, plain, (ifeq(equalish(n1,n0),true,a,b)=b)). % 0.19/0.42 cnf(i_0_13, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_14, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.19/0.42 cnf(i_0_18, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X9,X4),true),true)=true)). % 0.19/0.42 cnf(i_0_19, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X8,X3),true),true)=true)). % 0.19/0.42 cnf(i_0_20, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X7,X2),true),true)=true)). % 0.19/0.42 cnf(i_0_21, plain, (ifeq2(f(X1,X2,X3,X4,X5),true,ifeq2(f(X6,X7,X8,X9,X5),true,equalish(X6,X1),true),true)=true)). % 0.19/0.42 cnf(i_0_17, plain, (ifeq2(equalish(X1,X1),true,ifeq2(equalish(X2,X2),true,ifeq2(equalish(X3,X3),true,ifeq2(equalish(X4,X4),true,f(X4,X3,X2,X1,sK1_exists_f_Z(X4,X3,X2,X1)),true),true),true),true)=true)). % 0.19/0.42 cnf(i_0_24, negated_conjecture, (a!=b)). % 0.19/0.42 cnf(i_0_26, plain, (X10=X10)). % 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 10 steps % 0.19/0.42 cnf(i_0_15, plain, (equalish(n0,n0)=true), inference(start_rule)). % 0.19/0.42 cnf(i_0_35, plain, (equalish(n0,n0)=true), inference(extension_rule, [i_0_34])). % 0.19/0.42 cnf(i_0_75, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_76, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_77, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_78, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_73, plain, (f(equalish(n0,n0),equalish(n0,n0),equalish(n0,n0),equalish(n0,n0),equalish(n0,n0))=f(true,true,true,true,true)), inference(extension_rule, [i_0_30])). % 0.19/0.42 cnf(i_0_201, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_202, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_203, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_15])). % 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 # 29596 Satisfiable branch % 0.19/0.42 # Child (29590) has found a proof. % 0.19/0.42 % 0.19/0.42 # Proof search is over... % 0.19/0.42 # Freeing feature tree %------------------------------------------------------------------------------