%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM925+1 : TPTP v8.1.0. Released v5.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 : n029.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 : Mon Jul 18 09:46:46 EDT 2022 % Result : Theorem 0.10s 0.38s % Output : CNFRefutation 0.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : NUM925+1 : TPTP v8.1.0. Released v5.3.0. % 0.06/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.10/0.32 % Computer : n029.cluster.edu % 0.10/0.32 % Model : x86_64 x86_64 % 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.32 % Memory : 8042.1875MB % 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.32 % CPULimit : 300 % 0.10/0.32 % WCLimit : 600 % 0.10/0.32 % DateTime : Tue Jul 5 06:57:57 EDT 2022 % 0.10/0.32 % CPUTime : % 0.10/0.35 # No SInE strategy applied % 0.10/0.35 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN % 0.10/0.35 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.10/0.35 # % 0.10/0.35 # Presaturation interreduction done % 0.10/0.35 # Number of axioms: 141 Number of unprocessed: 86 % 0.10/0.35 # Tableaux proof search. % 0.10/0.35 # APR header successfully linked. % 0.10/0.35 # Hello from C++ % 0.10/0.36 # The folding up rule is enabled... % 0.10/0.36 # Local unification is enabled... % 0.10/0.36 # Any saturation attempts will use folding labels... % 0.10/0.36 # 86 beginning clauses after preprocessing and clausification % 0.10/0.36 # Creating start rules for all 1 conjectures. % 0.10/0.36 # There are 1 start rule candidates: % 0.10/0.36 # Found 38 unit axioms. % 0.10/0.36 # 1 start rule tableaux created. % 0.10/0.36 # 48 extension rule candidate clauses % 0.10/0.36 # 38 unit axiom clauses % 0.10/0.36 % 0.10/0.36 # Requested 8, 32 cores available to the main process. % 0.10/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.10/0.36 # Creating equality axioms % 0.10/0.36 # Ran out of tableaux, making start rules for all clauses % 0.10/0.36 # Returning from population with 103 new_tableaux and 0 remaining starting tableaux. % 0.10/0.36 # We now have 103 tableaux to operate on % 0.10/0.38 # There were 1 total branch saturation attempts. % 0.10/0.38 # There were 0 of these attempts blocked. % 0.10/0.38 # There were 0 deferred branch saturation attempts. % 0.10/0.38 # There were 0 free duplicated saturations. % 0.10/0.38 # There were 1 total successful branch saturations. % 0.10/0.38 # There were 0 successful branch saturations in interreduction. % 0.10/0.38 # There were 0 successful branch saturations on the branch. % 0.10/0.38 # There were 1 successful branch saturations after the branch. % 0.10/0.38 # There were 1 total branch saturation attempts. % 0.10/0.38 # There were 0 of these attempts blocked. % 0.10/0.38 # There were 0 deferred branch saturation attempts. % 0.10/0.38 # There were 0 free duplicated saturations. % 0.10/0.38 # There were 1 total successful branch saturations. % 0.10/0.38 # There were 0 successful branch saturations in interreduction. % 0.10/0.38 # There were 0 successful branch saturations on the branch. % 0.10/0.38 # There were 1 successful branch saturations after the branch. % 0.10/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.38 # Begin clausification derivation % 0.10/0.38 % 0.10/0.38 # End clausification derivation % 0.10/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.38 cnf(i_0_117, plain, (zero_zero_int=pls)). % 0.10/0.38 cnf(i_0_38, plain, (number_number_of_nat(pls)=zero_zero_nat)). % 0.10/0.38 cnf(i_0_31, plain, (number_number_of_int(pls)=pls)). % 0.10/0.38 cnf(i_0_36, plain, (semiri1621563631at_int(one_one_nat)=one_one_int)). % 0.10/0.38 cnf(i_0_41, plain, (semiri1621563631at_int(zero_zero_nat)=pls)). % 0.10/0.38 cnf(i_0_95, plain, (ord_less_int(pls,one_one_int))). % 0.10/0.38 cnf(i_0_2, plain, (ord_less_int(one_one_int,t))). % 0.10/0.38 cnf(i_0_123, plain, (plus_plus_int(X1,pls)=X1)). % 0.10/0.38 cnf(i_0_58, plain, (number_number_of_nat(one_one_int)=one_one_nat)). % 0.10/0.38 cnf(i_0_24, plain, (ord_less_nat(zero_zero_nat,n))). % 0.10/0.38 cnf(i_0_124, plain, (plus_plus_int(pls,X1)=X1)). % 0.10/0.38 cnf(i_0_22, plain, (number_number_of_int(one_one_int)=one_one_int)). % 0.10/0.38 cnf(i_0_145, plain, (number_number_of_int(semiri1621563631at_int(X1))=semiri1621563631at_int(X1))). % 0.10/0.38 cnf(i_0_1, plain, (ord_less_int(pls,plus_plus_int(one_one_int,semiri1621563631at_int(n))))). % 0.10/0.38 cnf(i_0_33, plain, (semiri1621563631at_int(power_power_nat(X1,X2))=power_power_int(semiri1621563631at_int(X1),X2))). % 0.10/0.38 cnf(i_0_16, plain, (number_number_of_nat(plus_plus_int(one_one_int,one_one_int))=plus_plus_nat(one_one_nat,one_one_nat))). % 0.10/0.38 cnf(i_0_6, plain, (power_power_int(one_one_int,plus_plus_nat(one_one_nat,one_one_nat))=one_one_int)). % 0.10/0.38 cnf(i_0_8, plain, (power_power_int(pls,plus_plus_nat(one_one_nat,one_one_nat))=pls)). % 0.10/0.38 cnf(i_0_152, negated_conjecture, (power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),plus_plus_nat(one_one_nat,one_one_nat))=pls)). % 0.10/0.38 cnf(i_0_35, plain, (plus_plus_int(semiri1621563631at_int(X1),semiri1621563631at_int(X2))=semiri1621563631at_int(plus_plus_nat(X1,X2)))). % 0.10/0.38 cnf(i_0_7, plain, (power_power_nat(one_one_nat,plus_plus_nat(one_one_nat,one_one_nat))=one_one_nat)). % 0.10/0.38 cnf(i_0_9, plain, (power_power_nat(zero_zero_nat,plus_plus_nat(one_one_nat,one_one_nat))=zero_zero_nat)). % 0.10/0.38 cnf(i_0_96, plain, (ord_less_int(X1,plus_plus_int(X1,one_one_int)))). % 0.10/0.38 cnf(i_0_71, plain, (plus_plus_int(plus_plus_int(X1,X2),X3)=plus_plus_int(X1,plus_plus_int(X2,X3)))). % 0.10/0.38 cnf(i_0_12, plain, (number_number_of_int(plus_plus_int(one_one_int,X1))=plus_plus_int(one_one_int,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_13, plain, (number_number_of_int(plus_plus_int(X1,one_one_int))=plus_plus_int(one_one_int,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_139, plain, (plus_plus_int(number_number_of_int(X1),number_number_of_int(X2))=number_number_of_int(plus_plus_int(X1,X2)))). % 0.10/0.38 cnf(i_0_17, plain, (power_power_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),plus_plus_nat(one_one_nat,one_one_nat))=power_power_int(X1,number_number_of_nat(plus_plus_int(one_one_int,plus_plus_int(one_one_int,plus_plus_int(one_one_int,one_one_int))))))). % 0.10/0.38 cnf(i_0_34, plain, (plus_plus_int(semiri1621563631at_int(X1),plus_plus_int(semiri1621563631at_int(X2),X3))=plus_plus_int(semiri1621563631at_int(plus_plus_nat(X1,X2)),X3))). % 0.10/0.38 cnf(i_0_137, plain, (plus_plus_int(number_number_of_int(X1),plus_plus_int(number_number_of_int(X2),X3))=plus_plus_int(number_number_of_int(plus_plus_int(X1,X2)),X3))). % 0.10/0.38 cnf(i_0_73, plain, (plus_plus_int(X1,X2)=plus_plus_int(X2,X1))). % 0.10/0.38 cnf(i_0_72, plain, (plus_plus_int(X1,plus_plus_int(X2,X3))=plus_plus_int(X2,plus_plus_int(X1,X3)))). % 0.10/0.38 cnf(i_0_118, plain, (one_one_int!=pls)). % 0.10/0.38 cnf(i_0_92, plain, (~ord_less_int(pls,pls))). % 0.10/0.38 cnf(i_0_99, plain, (~ord_less_int(semiri1621563631at_int(X1),pls))). % 0.10/0.38 cnf(i_0_109, plain, (plus_plus_int(X1,plus_plus_int(one_one_int,X1))!=pls)). % 0.10/0.38 cnf(i_0_110, plain, (plus_plus_int(X1,X1)!=plus_plus_int(X2,plus_plus_int(one_one_int,X2)))). % 0.10/0.38 cnf(i_0_148, plain, (~ord_less_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),pls))). % 0.10/0.38 cnf(i_0_40, plain, (X1=zero_zero_nat|semiri1621563631at_int(X1)!=pls)). % 0.10/0.38 cnf(i_0_132, plain, (power_power_int(X1,number_number_of_nat(X2))!=pls|number_number_of_nat(X2)!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_135, plain, (power_power_nat(X1,number_number_of_nat(X2))!=zero_zero_nat|number_number_of_nat(X2)!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_107, plain, (X1=pls|plus_plus_int(X1,X1)!=pls)). % 0.10/0.38 cnf(i_0_75, plain, (X1=X2|semiri1621563631at_int(X1)!=semiri1621563631at_int(X2))). % 0.10/0.38 cnf(i_0_60, plain, (X1=X2|number_number_of_int(X1)!=number_number_of_int(X2))). % 0.10/0.38 cnf(i_0_19, plain, (power_power_int(pls,number_number_of_nat(X1))=one_one_int|number_number_of_nat(X1)!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_133, plain, (X1=pls|power_power_int(X1,number_number_of_nat(X2))!=pls)). % 0.10/0.38 cnf(i_0_136, plain, (X1=zero_zero_nat|power_power_nat(X1,number_number_of_nat(X2))!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_77, plain, (ord_less_int(X1,pls)|~ord_less_int(number_number_of_int(X1),pls))). % 0.10/0.38 cnf(i_0_79, plain, (ord_less_int(pls,X1)|~ord_less_int(pls,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_18, plain, (power_power_int(pls,number_number_of_nat(X1))=pls|number_number_of_nat(X1)=zero_zero_nat)). % 0.10/0.38 cnf(i_0_20, plain, (power_power_nat(zero_zero_nat,number_number_of_nat(X1))=zero_zero_nat|number_number_of_nat(X1)=zero_zero_nat)). % 0.10/0.38 cnf(i_0_27, plain, (ord_less_int(X1,X2)|~ord_less_int(number_number_of_int(X1),number_number_of_int(X2)))). % 0.10/0.38 cnf(i_0_68, plain, (X1=X2|plus_plus_int(X1,X1)!=plus_plus_int(X2,X2))). % 0.10/0.38 cnf(i_0_70, plain, (ord_less_int(X1,pls)|~ord_less_int(plus_plus_int(X1,X1),pls))). % 0.10/0.38 cnf(i_0_21, plain, (power_power_nat(zero_zero_nat,number_number_of_nat(X1))=one_one_nat|number_number_of_nat(X1)!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_89, plain, (ord_less_int(pls,X1)|~ord_less_int(pls,plus_plus_int(X1,X1)))). % 0.10/0.38 cnf(i_0_49, plain, (ord_less_int(X1,X2)|~ord_less_int(plus_plus_int(X1,X1),plus_plus_int(X2,X2)))). % 0.10/0.38 cnf(i_0_78, plain, (ord_less_int(pls,number_number_of_int(X1))|~ord_less_int(pls,X1))). % 0.10/0.38 cnf(i_0_4, plain, (X1=pls|plus_plus_int(power_power_int(X2,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)))!=pls)). % 0.10/0.38 cnf(i_0_76, plain, (ord_less_int(number_number_of_int(X1),pls)|~ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_98, plain, (X1=X2|ord_less_int(X1,X2)|~ord_less_int(X1,plus_plus_int(X2,one_one_int)))). % 0.10/0.38 cnf(i_0_5, plain, (X1=pls|plus_plus_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(X2,plus_plus_nat(one_one_nat,one_one_nat)))!=pls)). % 0.10/0.38 cnf(i_0_66, plain, (X1=X2|plus_plus_int(X1,plus_plus_int(one_one_int,X1))!=plus_plus_int(X2,plus_plus_int(one_one_int,X2)))). % 0.10/0.38 cnf(i_0_25, plain, (X1=X2|ord_less_int(X1,X2)|ord_less_int(X2,X1))). % 0.10/0.38 cnf(i_0_88, plain, (ord_less_int(pls,plus_plus_int(X1,X1))|~ord_less_int(pls,X1))). % 0.10/0.38 cnf(i_0_91, plain, (ord_less_int(X1,pls)|~ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),pls))). % 0.10/0.38 cnf(i_0_26, plain, (ord_less_int(number_number_of_int(X1),number_number_of_int(X2))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_69, plain, (ord_less_int(plus_plus_int(X1,X1),pls)|~ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_102, plain, (ord_less_int(one_one_int,number_number_of_int(X1))|~ord_less_int(one_one_int,X1))). % 0.10/0.38 cnf(i_0_100, plain, (ord_less_int(number_number_of_int(X1),one_one_int)|~ord_less_int(X1,one_one_int))). % 0.10/0.38 cnf(i_0_146, plain, (X1=pls|ord_less_int(pls,power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat))))). % 0.10/0.38 cnf(i_0_101, plain, (ord_less_int(X1,one_one_int)|~ord_less_int(number_number_of_int(X1),one_one_int))). % 0.10/0.38 cnf(i_0_97, plain, (ord_less_int(X1,plus_plus_int(X2,one_one_int))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_83, plain, (ord_less_int(X1,X2)|~ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),plus_plus_int(X2,X2)))). % 0.10/0.38 cnf(i_0_103, plain, (ord_less_int(one_one_int,X1)|~ord_less_int(one_one_int,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_55, plain, (plus_plus_nat(number_number_of_nat(X1),number_number_of_nat(X2))=number_number_of_nat(X2)|~ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_44, plain, (ord_less_int(X1,X2)|~ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),plus_plus_int(X2,plus_plus_int(one_one_int,X2))))). % 0.10/0.38 cnf(i_0_52, plain, (ord_less_int(plus_plus_int(X1,X2),plus_plus_int(X3,X2))|~ord_less_int(X1,X3))). % 0.10/0.38 cnf(i_0_48, plain, (ord_less_int(plus_plus_int(X1,X1),plus_plus_int(X2,X2))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_90, plain, (ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),pls)|~ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_54, plain, (plus_plus_nat(number_number_of_nat(X1),number_number_of_nat(X2))=number_number_of_nat(X1)|ord_less_int(X1,pls)|~ord_less_int(X2,pls))). % 0.10/0.38 cnf(i_0_82, plain, (ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),plus_plus_int(X2,X2))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_149, plain, (X1=pls|ord_less_int(pls,plus_plus_int(power_power_int(X2,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)))))). % 0.10/0.38 cnf(i_0_150, plain, (X1=pls|ord_less_int(pls,plus_plus_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(X2,plus_plus_nat(one_one_nat,one_one_nat)))))). % 0.10/0.38 cnf(i_0_43, plain, (ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),plus_plus_int(X2,plus_plus_int(one_one_int,X2)))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_53, plain, (plus_plus_nat(number_number_of_nat(X1),number_number_of_nat(X2))=number_number_of_nat(plus_plus_int(X1,X2))|ord_less_int(X2,pls)|ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_267, plain, (X159=X159)). % 0.10/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.38 # Begin printing tableau % 0.10/0.38 # Found 6 steps % 0.10/0.38 cnf(i_0_117, plain, (zero_zero_int=pls), inference(start_rule)). % 0.10/0.38 cnf(i_0_280, plain, (zero_zero_int=pls), inference(extension_rule, [i_0_278])). % 0.10/0.38 cnf(i_0_546, plain, (zero_zero_int!=pls), inference(closure_rule, [i_0_117])). % 0.10/0.38 cnf(i_0_545, plain, (plus_plus_nat(zero_zero_int,zero_zero_int)=plus_plus_nat(pls,pls)), inference(extension_rule, [i_0_270])). % 0.10/0.38 cnf(i_0_658, plain, (plus_plus_nat(pls,pls)!=plus_plus_int(plus_plus_nat(pls,pls),pls)), inference(closure_rule, [i_0_123])). % 0.10/0.38 cnf(i_0_656, plain, (plus_plus_nat(zero_zero_int,zero_zero_int)=plus_plus_int(plus_plus_nat(pls,pls),pls)), inference(etableau_closure_rule, [i_0_656, ...])). % 0.10/0.38 # End printing tableau % 0.10/0.38 # SZS output end % 0.10/0.38 # Branches closed with saturation will be marked with an "s" % 0.10/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.38 # Begin clausification derivation % 0.10/0.38 % 0.10/0.38 # End clausification derivation % 0.10/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.38 cnf(i_0_117, plain, (zero_zero_int=pls)). % 0.10/0.38 cnf(i_0_38, plain, (number_number_of_nat(pls)=zero_zero_nat)). % 0.10/0.38 cnf(i_0_31, plain, (number_number_of_int(pls)=pls)). % 0.10/0.38 cnf(i_0_36, plain, (semiri1621563631at_int(one_one_nat)=one_one_int)). % 0.10/0.38 cnf(i_0_41, plain, (semiri1621563631at_int(zero_zero_nat)=pls)). % 0.10/0.38 cnf(i_0_95, plain, (ord_less_int(pls,one_one_int))). % 0.10/0.38 cnf(i_0_2, plain, (ord_less_int(one_one_int,t))). % 0.10/0.38 cnf(i_0_123, plain, (plus_plus_int(X1,pls)=X1)). % 0.10/0.38 cnf(i_0_58, plain, (number_number_of_nat(one_one_int)=one_one_nat)). % 0.10/0.38 cnf(i_0_24, plain, (ord_less_nat(zero_zero_nat,n))). % 0.10/0.38 cnf(i_0_124, plain, (plus_plus_int(pls,X1)=X1)). % 0.10/0.38 cnf(i_0_22, plain, (number_number_of_int(one_one_int)=one_one_int)). % 0.10/0.38 cnf(i_0_145, plain, (number_number_of_int(semiri1621563631at_int(X1))=semiri1621563631at_int(X1))). % 0.10/0.38 cnf(i_0_1, plain, (ord_less_int(pls,plus_plus_int(one_one_int,semiri1621563631at_int(n))))). % 0.10/0.38 cnf(i_0_33, plain, (semiri1621563631at_int(power_power_nat(X1,X2))=power_power_int(semiri1621563631at_int(X1),X2))). % 0.10/0.38 cnf(i_0_16, plain, (number_number_of_nat(plus_plus_int(one_one_int,one_one_int))=plus_plus_nat(one_one_nat,one_one_nat))). % 0.10/0.38 cnf(i_0_6, plain, (power_power_int(one_one_int,plus_plus_nat(one_one_nat,one_one_nat))=one_one_int)). % 0.10/0.38 cnf(i_0_8, plain, (power_power_int(pls,plus_plus_nat(one_one_nat,one_one_nat))=pls)). % 0.10/0.38 cnf(i_0_152, negated_conjecture, (power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),plus_plus_nat(one_one_nat,one_one_nat))=pls)). % 0.10/0.38 cnf(i_0_35, plain, (plus_plus_int(semiri1621563631at_int(X1),semiri1621563631at_int(X2))=semiri1621563631at_int(plus_plus_nat(X1,X2)))). % 0.10/0.38 cnf(i_0_7, plain, (power_power_nat(one_one_nat,plus_plus_nat(one_one_nat,one_one_nat))=one_one_nat)). % 0.10/0.38 cnf(i_0_9, plain, (power_power_nat(zero_zero_nat,plus_plus_nat(one_one_nat,one_one_nat))=zero_zero_nat)). % 0.10/0.38 cnf(i_0_96, plain, (ord_less_int(X1,plus_plus_int(X1,one_one_int)))). % 0.10/0.38 cnf(i_0_71, plain, (plus_plus_int(plus_plus_int(X1,X2),X3)=plus_plus_int(X1,plus_plus_int(X2,X3)))). % 0.10/0.38 cnf(i_0_12, plain, (number_number_of_int(plus_plus_int(one_one_int,X1))=plus_plus_int(one_one_int,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_13, plain, (number_number_of_int(plus_plus_int(X1,one_one_int))=plus_plus_int(one_one_int,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_139, plain, (plus_plus_int(number_number_of_int(X1),number_number_of_int(X2))=number_number_of_int(plus_plus_int(X1,X2)))). % 0.10/0.38 cnf(i_0_17, plain, (power_power_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),plus_plus_nat(one_one_nat,one_one_nat))=power_power_int(X1,number_number_of_nat(plus_plus_int(one_one_int,plus_plus_int(one_one_int,plus_plus_int(one_one_int,one_one_int))))))). % 0.10/0.38 cnf(i_0_34, plain, (plus_plus_int(semiri1621563631at_int(X1),plus_plus_int(semiri1621563631at_int(X2),X3))=plus_plus_int(semiri1621563631at_int(plus_plus_nat(X1,X2)),X3))). % 0.10/0.38 cnf(i_0_137, plain, (plus_plus_int(number_number_of_int(X1),plus_plus_int(number_number_of_int(X2),X3))=plus_plus_int(number_number_of_int(plus_plus_int(X1,X2)),X3))). % 0.10/0.38 cnf(i_0_73, plain, (plus_plus_int(X1,X2)=plus_plus_int(X2,X1))). % 0.10/0.38 cnf(i_0_72, plain, (plus_plus_int(X1,plus_plus_int(X2,X3))=plus_plus_int(X2,plus_plus_int(X1,X3)))). % 0.10/0.38 cnf(i_0_118, plain, (one_one_int!=pls)). % 0.10/0.38 cnf(i_0_92, plain, (~ord_less_int(pls,pls))). % 0.10/0.38 cnf(i_0_99, plain, (~ord_less_int(semiri1621563631at_int(X1),pls))). % 0.10/0.38 cnf(i_0_109, plain, (plus_plus_int(X1,plus_plus_int(one_one_int,X1))!=pls)). % 0.10/0.38 cnf(i_0_110, plain, (plus_plus_int(X1,X1)!=plus_plus_int(X2,plus_plus_int(one_one_int,X2)))). % 0.10/0.38 cnf(i_0_148, plain, (~ord_less_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),pls))). % 0.10/0.38 cnf(i_0_40, plain, (X1=zero_zero_nat|semiri1621563631at_int(X1)!=pls)). % 0.10/0.38 cnf(i_0_132, plain, (power_power_int(X1,number_number_of_nat(X2))!=pls|number_number_of_nat(X2)!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_135, plain, (power_power_nat(X1,number_number_of_nat(X2))!=zero_zero_nat|number_number_of_nat(X2)!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_107, plain, (X1=pls|plus_plus_int(X1,X1)!=pls)). % 0.10/0.38 cnf(i_0_75, plain, (X1=X2|semiri1621563631at_int(X1)!=semiri1621563631at_int(X2))). % 0.10/0.38 cnf(i_0_60, plain, (X1=X2|number_number_of_int(X1)!=number_number_of_int(X2))). % 0.10/0.38 cnf(i_0_19, plain, (power_power_int(pls,number_number_of_nat(X1))=one_one_int|number_number_of_nat(X1)!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_133, plain, (X1=pls|power_power_int(X1,number_number_of_nat(X2))!=pls)). % 0.10/0.38 cnf(i_0_136, plain, (X1=zero_zero_nat|power_power_nat(X1,number_number_of_nat(X2))!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_77, plain, (ord_less_int(X1,pls)|~ord_less_int(number_number_of_int(X1),pls))). % 0.10/0.38 cnf(i_0_79, plain, (ord_less_int(pls,X1)|~ord_less_int(pls,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_18, plain, (power_power_int(pls,number_number_of_nat(X1))=pls|number_number_of_nat(X1)=zero_zero_nat)). % 0.10/0.38 cnf(i_0_20, plain, (power_power_nat(zero_zero_nat,number_number_of_nat(X1))=zero_zero_nat|number_number_of_nat(X1)=zero_zero_nat)). % 0.10/0.38 cnf(i_0_27, plain, (ord_less_int(X1,X2)|~ord_less_int(number_number_of_int(X1),number_number_of_int(X2)))). % 0.10/0.38 cnf(i_0_68, plain, (X1=X2|plus_plus_int(X1,X1)!=plus_plus_int(X2,X2))). % 0.10/0.38 cnf(i_0_70, plain, (ord_less_int(X1,pls)|~ord_less_int(plus_plus_int(X1,X1),pls))). % 0.10/0.38 cnf(i_0_21, plain, (power_power_nat(zero_zero_nat,number_number_of_nat(X1))=one_one_nat|number_number_of_nat(X1)!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_89, plain, (ord_less_int(pls,X1)|~ord_less_int(pls,plus_plus_int(X1,X1)))). % 0.10/0.38 cnf(i_0_49, plain, (ord_less_int(X1,X2)|~ord_less_int(plus_plus_int(X1,X1),plus_plus_int(X2,X2)))). % 0.10/0.38 cnf(i_0_78, plain, (ord_less_int(pls,number_number_of_int(X1))|~ord_less_int(pls,X1))). % 0.10/0.38 cnf(i_0_4, plain, (X1=pls|plus_plus_int(power_power_int(X2,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)))!=pls)). % 0.10/0.38 cnf(i_0_76, plain, (ord_less_int(number_number_of_int(X1),pls)|~ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_98, plain, (X1=X2|ord_less_int(X1,X2)|~ord_less_int(X1,plus_plus_int(X2,one_one_int)))). % 0.10/0.38 cnf(i_0_5, plain, (X1=pls|plus_plus_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(X2,plus_plus_nat(one_one_nat,one_one_nat)))!=pls)). % 0.10/0.38 cnf(i_0_66, plain, (X1=X2|plus_plus_int(X1,plus_plus_int(one_one_int,X1))!=plus_plus_int(X2,plus_plus_int(one_one_int,X2)))). % 0.10/0.38 cnf(i_0_25, plain, (X1=X2|ord_less_int(X1,X2)|ord_less_int(X2,X1))). % 0.10/0.38 cnf(i_0_88, plain, (ord_less_int(pls,plus_plus_int(X1,X1))|~ord_less_int(pls,X1))). % 0.10/0.38 cnf(i_0_91, plain, (ord_less_int(X1,pls)|~ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),pls))). % 0.10/0.38 cnf(i_0_26, plain, (ord_less_int(number_number_of_int(X1),number_number_of_int(X2))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_69, plain, (ord_less_int(plus_plus_int(X1,X1),pls)|~ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_102, plain, (ord_less_int(one_one_int,number_number_of_int(X1))|~ord_less_int(one_one_int,X1))). % 0.10/0.38 cnf(i_0_100, plain, (ord_less_int(number_number_of_int(X1),one_one_int)|~ord_less_int(X1,one_one_int))). % 0.10/0.38 cnf(i_0_146, plain, (X1=pls|ord_less_int(pls,power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat))))). % 0.10/0.38 cnf(i_0_101, plain, (ord_less_int(X1,one_one_int)|~ord_less_int(number_number_of_int(X1),one_one_int))). % 0.10/0.38 cnf(i_0_97, plain, (ord_less_int(X1,plus_plus_int(X2,one_one_int))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_83, plain, (ord_less_int(X1,X2)|~ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),plus_plus_int(X2,X2)))). % 0.10/0.38 cnf(i_0_103, plain, (ord_less_int(one_one_int,X1)|~ord_less_int(one_one_int,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_55, plain, (plus_plus_nat(number_number_of_nat(X1),number_number_of_nat(X2))=number_number_of_nat(X2)|~ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_44, plain, (ord_less_int(X1,X2)|~ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),plus_plus_int(X2,plus_plus_int(one_one_int,X2))))). % 0.10/0.38 cnf(i_0_52, plain, (ord_less_int(plus_plus_int(X1,X2),plus_plus_int(X3,X2))|~ord_less_int(X1,X3))). % 0.10/0.38 cnf(i_0_48, plain, (ord_less_int(plus_plus_int(X1,X1),plus_plus_int(X2,X2))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_90, plain, (ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),pl# There were 1 total branch saturation attempts. % 0.10/0.38 # There were 0 of these attempts blocked. % 0.10/0.38 # There were 0 deferred branch saturation attempts. % 0.10/0.38 # There were 0 free duplicated saturations. % 0.10/0.38 # There were 1 total successful branch saturations. % 0.10/0.38 # There were 0 successful branch saturations in interreduction. % 0.10/0.38 # There were 0 successful branch saturations on the branch. % 0.10/0.38 # There were 1 successful branch saturations after the branch. % 0.10/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.38 # Begin clausification derivation % 0.10/0.38 % 0.10/0.38 # End clausification derivation % 0.10/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.38 cnf(i_0_117, plain, (zero_zero_int=pls)). % 0.10/0.38 cnf(i_0_38, plain, (number_number_of_nat(pls)=zero_zero_nat)). % 0.10/0.38 cnf(i_0_31, plain, (number_number_of_int(pls)=pls)). % 0.10/0.38 cnf(i_0_36, plain, (semiri1621563631at_int(one_one_nat)=one_one_int)). % 0.10/0.38 cnf(i_0_41, plain, (semiri1621563631at_int(zero_zero_nat)=pls)). % 0.10/0.38 cnf(i_0_95, plain, (ord_less_int(pls,one_one_int))). % 0.10/0.38 cnf(i_0_2, plain, (ord_less_int(one_one_int,t))). % 0.10/0.38 cnf(i_0_123, plain, (plus_plus_int(X1,pls)=X1)). % 0.10/0.38 cnf(i_0_58, plain, (number_number_of_nat(one_one_int)=one_one_nat)). % 0.10/0.38 cnf(i_0_24, plain, (ord_less_nat(zero_zero_nat,n))). % 0.10/0.38 cnf(i_0_124, plain, (plus_plus_int(pls,X1)=X1)). % 0.10/0.38 cnf(i_0_22, plain, (number_number_of_int(one_one_int)=one_one_int)). % 0.10/0.38 cnf(i_0_145, plain, (number_number_of_int(semiri1621563631at_int(X1))=semiri1621563631at_int(X1))). % 0.10/0.38 cnf(i_0_1, plain, (ord_less_int(pls,plus_plus_int(one_one_int,semiri1621563631at_int(n))))). % 0.10/0.38 cnf(i_0_33, plain, (semiri1621563631at_int(power_power_nat(X1,X2))=power_power_int(semiri1621563631at_int(X1),X2))). % 0.10/0.38 cnf(i_0_16, plain, (number_number_of_nat(plus_plus_int(one_one_int,one_one_int))=plus_plus_nat(one_one_nat,one_one_nat))). % 0.10/0.38 cnf(i_0_6, plain, (power_power_int(one_one_int,plus_plus_nat(one_one_nat,one_one_nat))=one_one_int)). % 0.10/0.38 cnf(i_0_8, plain, (power_power_int(pls,plus_plus_nat(one_one_nat,one_one_nat))=pls)). % 0.10/0.38 cnf(i_0_152, negated_conjecture, (power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),plus_plus_nat(one_one_nat,one_one_nat))=pls)). % 0.10/0.38 cnf(i_0_35, plain, (plus_plus_int(semiri1621563631at_int(X1),semiri1621563631at_int(X2))=semiri1621563631at_int(plus_plus_nat(X1,X2)))). % 0.10/0.38 cnf(i_0_7, plain, (power_power_nat(one_one_nat,plus_plus_nat(one_one_nat,one_one_nat))=one_one_nat)). % 0.10/0.38 cnf(i_0_9, plain, (power_power_nat(zero_zero_nat,plus_plus_nat(one_one_nat,one_one_nat))=zero_zero_nat)). % 0.10/0.38 cnf(i_0_96, plain, (ord_less_int(X1,plus_plus_int(X1,one_one_int)))). % 0.10/0.38 cnf(i_0_71, plain, (plus_plus_int(plus_plus_int(X1,X2),X3)=plus_plus_int(X1,plus_plus_int(X2,X3)))). % 0.10/0.38 cnf(i_0_12, plain, (number_number_of_int(plus_plus_int(one_one_int,X1))=plus_plus_int(one_one_int,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_13, plain, (number_number_of_int(plus_plus_int(X1,one_one_int))=plus_plus_int(one_one_int,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_139, plain, (plus_plus_int(number_number_of_int(X1),number_number_of_int(X2))=number_number_of_int(plus_plus_int(X1,X2)))). % 0.10/0.38 cnf(i_0_17, plain, (power_power_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),plus_plus_nat(one_one_nat,one_one_nat))=power_power_int(X1,number_number_of_nat(plus_plus_int(one_one_int,plus_plus_int(one_one_int,plus_plus_int(one_one_int,one_one_int))))))). % 0.10/0.38 cnf(i_0_34, plain, (plus_plus_int(semiri1621563631at_int(X1),plus_plus_int(semiri1621563631at_int(X2),X3))=plus_plus_int(semiri1621563631at_int(plus_plus_nat(X1,X2)),X3))). % 0.10/0.38 cnf(i_0_137, plain, (plus_plus_int(number_number_of_int(X1),plus_plus_int(number_number_of_int(X2),X3))=plus_plus_int(number_number_of_int(plus_plus_int(X1,X2)),X3))). % 0.10/0.38 cnf(i_0_73, plain, (plus_plus_int(X1,X2)=plus_plus_int(X2,X1))). % 0.10/0.38 cnf(i_0_72, plain, (plus_plus_int(X1,plus_plus_int(X2,X3))=plus_plus_int(X2,plus_plus_int(X1,X3)))). % 0.10/0.38 cnf(i_0_118, plain, (one_one_int!=pls)). % 0.10/0.38 cnf(i_0_92, plain, (~ord_less_int(pls,pls))). % 0.10/0.38 cnf(i_0_99, plain, (~ord_less_int(semiri1621563631at_int(X1),pls))). % 0.10/0.38 cnf(i_0_109, plain, (plus_plus_int(X1,plus_plus_int(one_one_int,X1))!=pls)). % 0.10/0.38 cnf(i_0_110, plain, (plus_plus_int(X1,X1)!=plus_plus_int(X2,plus_plus_int(one_one_int,X2)))). % 0.10/0.38 cnf(i_0_148, plain, (~ord_less_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),pls))). % 0.10/0.38 cnf(i_0_40, plain, (X1=zero_zero_nat|semiri1621563631at_int(X1)!=pls)). % 0.10/0.38 cnf(i_0_132, plain, (power_power_int(X1,number_number_of_nat(X2))!=pls|number_number_of_nat(X2)!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_135, plain, (power_power_nat(X1,number_number_of_ns)|~ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_54, plain, (plus_plus_nat(number_number_of_nat(X1),number_number_of_nat(X2))=number_number_of_nat(X1)|ord_less_int(X1,pls)|~ord_less_int(X2,pls))). % 0.10/0.38 cnf(i_0_82, plain, (ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),plus_plus_int(X2,X2))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_149, plain, (X1=pls|ord_less_int(pls,plus_plus_int(power_power_int(X2,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)))))). % 0.10/0.38 cnf(i_0_150, plain, (X1=pls|ord_less_int(pls,plus_plus_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(X2,plus_plus_nat(one_one_nat,one_one_nat)))))). % 0.10/0.38 cnf(i_0_43, plain, (ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),plus_plus_int(X2,plus_plus_int(one_one_int,X2)))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_53, plain, (plus_plus_nat(number_number_of_nat(X1),number_number_of_nat(X2))=number_number_of_nat(plus_plus_int(X1,X2))|ord_less_int(X2,pls)|ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_267, plain, (X159=X159)). % 0.10/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.38 # Begin printing tableau % 0.10/0.38 # Found 6 steps % 0.10/0.38 cnf(i_0_117, plain, (zero_zero_int=pls), inference(start_rule)). % 0.10/0.38 cnf(i_0_280, plain, (zero_zero_int=pls), inference(extension_rule, [i_0_278])). % 0.10/0.38 cnf(i_0_547, plain, (zero_zero_int!=pls), inference(closure_rule, [i_0_117])). % 0.10/0.38 cnf(i_0_545, plain, (plus_plus_nat(zero_zero_int,zero_zero_int)=plus_plus_nat(pls,pls)), inference(extension_rule, [i_0_270])). % 0.10/0.38 cnf(i_0_658, plain, (plus_plus_nat(pls,pls)!=plus_plus_int(plus_plus_nat(pls,pls),pls)), inference(closure_rule, [i_0_123])). % 0.10/0.38 cnf(i_0_656, plain, (plus_plus_nat(zero_zero_int,zero_zero_int)=plus_plus_int(plus_plus_nat(pls,pls),pls)), inference(etableau_closure_rule, [i_0_656, ...])). % 0.10/0.38 # End printing tableau % 0.10/0.38 # SZS output end % 0.10/0.38 # Branches closed with saturation will be marked with an "s" % 0.10/0.38 # There were 1 total branch saturation attempts. % 0.10/0.38 # There were 0 of these attempts blocked. % 0.10/0.38 # There were 0 deferred branch saturation attempts. % 0.10/0.38 # There were 0 free duplicated saturations. % 0.10/0.38 # There were 1 total successful branch saturations. % 0.10/0.38 # There were 0 successful branch saturations in interreduction. % 0.10/0.38 # There were 0 successful branch saturations on the branch. % 0.10/0.38 # There were 1 successful branch saturations after the branch. % 0.10/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.38 # Begin clausification derivation % 0.10/0.38 % 0.10/0.38 # End clausification derivation % 0.10/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.38 cnf(i_0_117, plain, (zero_zero_int=pls)). % 0.10/0.38 cnf(i_0_38, plain, (number_number_of_nat(pls)=zero_zero_nat)). % 0.10/0.38 cnf(i_0_31, plain, (number_number_of_int(pls)=pls)). % 0.10/0.38 cnf(i_0_36, plain, (semiri1621563631at_int(one_one_nat)=one_one_int)). % 0.10/0.38 cnf(i_0_41, plain, (semiri1621563631at_int(zero_zero_nat)=pls)). % 0.10/0.38 cnf(i_0_95, plain, (ord_less_int(pls,one_one_int))). % 0.10/0.38 cnf(i_0_2, plain, (ord_less_int(one_one_int,t))). % 0.10/0.38 cnf(i_0_123, plain, (plus_plus_int(X1,pls)=X1)). % 0.10/0.38 cnf(i_0_58, plain, (number_number_of_nat(one_one_int)=one_one_nat)). % 0.10/0.38 cnf(i_0_24, plain, (ord_less_nat(zero_zero_nat,n))). % 0.10/0.38 cnf(i_0_124, plain, (plus_plus_int(pls,X1)=X1)). % 0.10/0.38 cnf(i_0_22, plain, (number_number_of_int(one_one_int)=one_one_int)). % 0.10/0.38 cnf(i_0_145, plain, (number_number_of_int(semiri1621563631at_int(X1))=semiri1621563631at_int(X1))). % 0.10/0.38 cnf(i_0_1, plain, (ord_less_int(pls,plus_plus_int(one_one_int,semiri1621563631at_int(n))))). % 0.10/0.38 cnf(i_0_33, plain, (semiri1621563631at_int(power_power_nat(X1,X2))=power_power_int(semiri1621563631at_int(X1),X2))). % 0.10/0.38 cnf(i_0_16, plain, (number_number_of_nat(plus_plus_int(one_one_int,one_one_int))=plus_plus_nat(one_one_nat,one_one_nat))). % 0.10/0.38 cnf(i_0_6, plain, (power_power_int(one_one_int,plus_plus_nat(one_one_nat,one_one_nat))=one_one_int)). % 0.10/0.38 cnf(i_0_8, plain, (power_power_int(pls,plus_plus_nat(one_one_nat,one_one_nat))=pls)). % 0.10/0.38 cnf(i_0_152, negated_conjecture, (power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),plus_plus_nat(one_one_nat,one_one_nat))=pls)). % 0.10/0.38 cnf(i_0_35, plain, (plus_plus_int(semiri1621563631at_int(X1),semiri1621563631at_int(X2))=semiri1621563631at_int(plus_plus_nat(X1,X2)))). % 0.10/0.38 cnf(i_0_7, plain, (power_power_nat(one_one_nat,plus_plus_nat(one_one_nat,one_one_nat))=one_one_nat)). % 0.10/0.38 cnf(i_0_9, plain, (power_power_nat(zero_zero_nat,plus_plus_nat(one_one_nat,one_one_nat))=zero_zero_nat)). % 0.10/0.38 cnf(i_0_96, plain, (ord_less_int(X1,plus_plus_int(X1,one_one_int)))). % 0.10/0.38 cnf(i_0_71, plain, (plus_plus_int(plus_plus_int(X1,X2),X3)=plus_plus_int(X1,plus_plus_int(X2,X3)))). % 0.10/0.38 cnf(i_0_12, plain, (number_number_of_int(plus_plus_int(one_one_int,X1))=plus_plus_int(one_one_int,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_13, plain, (number_number_of_int(plus_plus_int(X1,one_one_int))=plus_plus_int(one_one_int,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_139, plain, (plus_plus_int(number_number_of_int(X1),number_number_of_int(X2))=number_number_of_int(plus_plus_int(X1,X2)))). % 0.10/0.38 cnf(i_0_17, plain, (power_power_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),plus_plus_nat(one_one_nat,one_one_nat))=power_power_int(X1,number_number_of_nat(plus_plus_int(one_one_int,plus_plus_int(one_one_int,plus_plus_int(one_one_int,one_one_int))))))). % 0.10/0.38 cnf(i_0_34, plain, (plus_plus_int(semiri1621563631at_int(X1),plus_plus_int(semiri1621563631at_int(X2),X3))=plus_plus_int(semiri1621563631at_int(plus_plus_nat(X1,X2)),X3))). % 0.10/0.38 cnf(i_0_137, plain, (plus_plus_int(number_number_of_int(X1),plus_plus_int(number_number_of_int(X2),X3))=plus_plus_int(number_number_of_int(plus_plus_int(X1,X2)),X3))). % 0.10/0.38 cnf(i_0_73, plain, (plus_plus_int(X1,X2)=plus_plus_int(X2,X1))). % 0.10/0.38 cnf(i_0_72, plain, (plus_plus_int(X1,plus_plus_int(X2,X3))=plus_plus_int(X2,plus_plus_int(X1,X3)))). % 0.10/0.38 cnf(i_0_118, plain, (one_one_int!=pls)). % 0.10/0.38 cnf(i_0_92, plain, (~ord_less_int(pls,pls))). % 0.10/0.38 cnf(i_0_99, plain, (~ord_less_int(semiri1621563631at_int(X1),pls))). % 0.10/0.38 cnf(i_0_109, plain, (plus_plus_int(X1,plus_plus_int(one_one_int,X1))!=pls)). % 0.10/0.38 cnf(i_0_110, plain, (plus_plus_int(X1,X1)!=plus_plus_int(X2,plus_plus_int(one_one_int,X2)))). % 0.10/0.38 cnf(i_0_148, plain, (~ord_less_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),pls))). % 0.10/0.38 cnf(i_0_40, plain, (X1=zero_zero_nat|semiri1621563631at_int(X1)!=pls)). % 0.10/0.38 cnf(i_0_132, plain, (power_power_int(X1,number_number_of_nat(X2))!=pls|number_number_of_nat(X2)!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_135, plain, (power_power_nat(X1,number_number_of_nat(X2))!=zero_zero_nat|number_number_of_nat(X2)!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_107, plain, (X1=pls|plus_plus_int(X1,X1)!=pls)). % 0.10/0.38 cnf(i_0_75, plain, (X1=X2|semiri1621563631at_int(X1)!=semiri1621563631at_int(X2))). % 0.10/0.38 cnf(i_0_60, plain, (X1=X2|number_number_of_int(X1)!=number_number_of_int(X2))). % 0.10/0.38 cnf(i_0_19, plain, (power_power_int(pls,number_number_of_nat(X1))=one_one_int|number_number_of_nat(X1)!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_133, plain, (X1=pls|power_power_int(X1,number_number_of_nat(X2))!=pls)). % 0.10/0.38 cnf(i_0_136, plain, (X1=zero_zero_nat|power_power_nat(X1,number_number_of_nat(X2))!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_77, plain, (ord_less_int(X1,pls)|~ord_less_int(number_number_of_int(X1),pls))). % 0.10/0.38 cnf(i_0_79, plain, (ord_less_int(pls,X1)|~ord_less_int(pls,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_18, plain, (power_power_int(pls,number_number_of_nat(X1))=pls|number_number_of_nat(X1)=zero_zero_nat)). % 0.10/0.38 cnf(i_0_20, plain, (power_power_nat(zero_zero_nat,number_number_of_nat(X1))=zero_zero_nat|number_number_of_nat(X1)=zero_zero_nat)). % 0.10/0.38 cnf(i_0_27, plain, (ord_less_int(X1,X2)|~ord_less_int(number_number_of_int(X1),number_number_of_int(X2)))). % 0.10/0.38 cnf(i_0_68, plain, (X1=X2|plus_plus_int(X1,X1)!=plus_plus_int(X2,X2))). % 0.10/0.38 cnf(i_0_70, plain, (ord_less_int(X1,pls)|~ord_less_int(plus_plus_int(X1,X1),pls))). % 0.10/0.38 cnf(i_0_21, plain, (power_power_nat(zero_zero_nat,number_number_of_nat(X1))=one_one_nat|number_number_of_nat(X1)!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_89, plain, (ord_less_int(pls,X1)|~ord_less_int(pls,plus_plus_int(X1,X1)))). % 0.10/0.38 cnf(i_0_49, plain, (ord_less_int(X1,X2)|~ord_less_int(plus_plus_int(X1,X1),plus_plus_int(X2,X2)))). % 0.10/0.38 cnf(i_0_78, plain, (ord_less_int(pls,number_number_of_int(X1))|~ord_less_int(pls,X1))). % 0.10/0.38 cnf(i_0_4, plain, (X1=pls|plus_plus_int(power_power_int(X2,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)))!=pls)). % 0.10/0.38 cnf(i_0_76, plain, (ord_less_int(number_number_of_int(X1),pls)|~ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_98, plain, (X1=X2|ord_less_int(X1,X2)|~ord_less_int(X1,plus_plus_int(X2,one_one_int)))). % 0.10/0.38 cnf(i_0_5, plain, (X1=pls|plus_plus_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(X2,plus_plus_nat(one_one_nat,one_one_nat)))!=pls)). % 0.10/0.38 cnf(i_0_66, plain, (X1=X2|plus_plus_int(X1,plus_plus_int(one_one_int,X1))!=plus_plus_int(X2,plus_plus_int(one_one_int,X2)))). % 0.10/0.38 cnf(i_0_25, plain, (X1=X2|ord_less_int(X1,X2)|ord_less_int(X2,X1))). % 0.10/0.38 cnf(i_0_88, plain, (ord_less_int(pls,plus_plus_int(X1,X1))|~ord_less_int(pls,X1))). % 0.10/0.38 cnf(i_0_91, plain, (ord_less_int(X1,pls)|~ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),pls))). % 0.10/0.38 cnf(i_0_26, plain, (ord_less_int(number_number_of_int(X1),number_number_of_int(X2))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_69, plain, (ord_less_int(plus_plus_int(X1,X1),pls)|~ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_102, plain, (ord_less_int(one_one_int,number_number_of_int(X1))|~ord_less_int(one_one_int,X1))). % 0.10/0.38 cnf(i_0_100, plain, (ord_less_int(number_number_of_int(X1),one_one_int)|~ord_less_int(X1,one_one_int))). % 0.10/0.38 cnf(i_0_146, plain, (X1=pls|ord_less_int(pls,power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat))))). % 0.10/0.38 cnf(i_0_101, plain, (ord_less_int(X1,one_one_int)|~ord_less_int(number_number_of_int(X1),one_one_int))). % 0.10/0.38 cnf(i_0_97, plain, (ord_less_int(X1,plus_plus_int(X2,one_one_int))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_83, plain, (ord_less_int(X1,X2)|~ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),plus_plus_int(X2,X2)))). % 0.10/0.38 cnf(i_0_103, plain, (ord_less_int(one_one_int,X1)|~ord_less_int(one_one_int,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_55, plain, (plus_plus_nat(number_number_of_nat(X1),number_number_of_nat(X2))=number_number_of_nat(X2)|~ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_44, plain, (ord_less_int(X1,X2)|~ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),plus_plus_int(X2,plus_plus_int(one_one_int,X2))))). % 0.10/0.38 cnf(i_0_52, plain, (ord_less_int(plus_plus_int(X1,X2),plus_plus_int(X3,X2))|~ord_less_int(X1,X3))). % 0.10/0.38 cnf(i_0_48, plain, (ord_less_int(plus_plus_int(X1,X1),plus_plus_int(X2,X2))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_90, plain, (ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),pl# There were 1 total branch saturation attempts. % 0.10/0.38 # There were 0 of these attempts blocked. % 0.10/0.38 # There were 0 deferred branch saturation attempts. % 0.10/0.38 # There were 0 free duplicated saturations. % 0.10/0.38 # There were 1 total successful branch saturations. % 0.10/0.38 # There were 0 successful branch saturations in interreduction. % 0.10/0.38 # There were 0 successful branch saturations on the branch. % 0.10/0.38 # There were 1 successful branch saturations after the branch. % 0.10/0.38 s)|~ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_54, plain, (plus_plus_nat(number_number_of_nat(X1),number_number_of_nat(X2))=number_number_of_nat(X1)|ord_less_int(X1,pls)|~ord_less_int(X2,pls))). % 0.10/0.38 cnf(i_0_82, plain, (ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),plus_plus_int(X2,X2))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_149, plain, (X1=pls|ord_less_int(pls,plus_plus_int(power_power_int(X2,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)))))). % 0.10/0.38 cnf(i_0_150, plain, (X1=pls|ord_less_int(pls,plus_plus_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(X2,plus_plus_nat(one_one_nat,one_one_nat)))))). % 0.10/0.38 cnf(i_0_43, plain, (ord_less_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1)),plus_plus_int(X2,plus_plus_int(one_one_int,X2)))|~ord_less_int(X1,X2))). % 0.10/0.38 cnf(i_0_53, plain, (plus_plus_nat(number_number_of_nat(X1),number_number_of_nat(X2))=number_number_of_nat(plus_plus_int(X1,X2))|ord_less_int(X2,pls)|ord_less_int(X1,pls))). % 0.10/0.38 cnf(i_0_267, plain, (X159=X159)). % 0.10/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.38 # Begin printing tableau % 0.10/0.38 # Found 6 steps % 0.10/0.38 cnf(i_0_117, plain, (zero_zero_int=pls), inference(start_rule)). % 0.10/0.38 cnf(i_0_280, plain, (zero_zero_int=pls), inference(extension_rule, [i_0_276])). % 0.10/0.38 cnf(i_0_541, plain, (zero_zero_int!=pls), inference(closure_rule, [i_0_117])). % 0.10/0.38 cnf(i_0_540, plain, (power_power_nat(zero_zero_int,zero_zero_int)=power_power_nat(pls,pls)), inference(extension_rule, [i_0_270])). % 0.10/0.38 cnf(i_0_658, plain, (power_power_nat(pls,pls)!=plus_plus_int(power_power_nat(pls,pls),pls)), inference(closure_rule, [i_0_123])). % 0.10/0.38 cnf(i_0_656, plain, (power_power_nat(zero_zero_int,zero_zero_int)=plus_plus_int(power_power_nat(pls,pls),pls)), inference(etableau_closure_rule, [i_0_656, ...])). % 0.10/0.38 # End printing tableau % 0.10/0.38 # SZS output end % 0.10/0.38 # Branches closed with saturation will be marked with an "s" % 0.10/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.38 # Begin clausification derivation % 0.10/0.38 % 0.10/0.38 # End clausification derivation % 0.10/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.38 cnf(i_0_117, plain, (zero_zero_int=pls)). % 0.10/0.38 cnf(i_0_38, plain, (number_number_of_nat(pls)=zero_zero_nat)). % 0.10/0.38 cnf(i_0_31, plain, (number_number_of_int(pls)=pls)). % 0.10/0.38 cnf(i_0_36, plain, (semiri1621563631at_int(one_one_nat)=one_one_int)). % 0.10/0.38 cnf(i_0_41, plain, (semiri1621563631at_int(zero_zero_nat)=pls)). % 0.10/0.38 cnf(i_0_95, plain, (ord_less_int(pls,one_one_int))). % 0.10/0.38 cnf(i_0_2, plain, (ord_less_int(one_one_int,t))). % 0.10/0.38 cnf(i_0_123, plain, (plus_plus_int(X1,pls)=X1)). % 0.10/0.38 cnf(i_0_58, plain, (number_number_of_nat(one_one_int)=one_one_nat)). % 0.10/0.38 cnf(i_0_24, plain, (ord_less_nat(zero_zero_nat,n))). % 0.10/0.38 cnf(i_0_124, plain, (plus_plus_int(pls,X1)=X1)). % 0.10/0.38 cnf(i_0_22, plain, (number_number_of_int(one_one_int)=one_one_int)). % 0.10/0.38 cnf(i_0_145, plain, (number_number_of_int(semiri1621563631at_int(X1))=semiri1621563631at_int(X1))). % 0.10/0.38 cnf(i_0_1, plain, (ord_less_int(pls,plus_plus_int(one_one_int,semiri1621563631at_int(n))))). % 0.10/0.38 cnf(i_0_33, plain, (semiri1621563631at_int(power_power_nat(X1,X2))=power_power_int(semiri1621563631at_int(X1),X2))). % 0.10/0.38 cnf(i_0_16, plain, (number_number_of_nat(plus_plus_int(one_one_int,one_one_int))=plus_plus_nat(one_one_nat,one_one_nat))). % 0.10/0.38 cnf(i_0_6, plain, (power_power_int(one_one_int,plus_plus_nat(one_one_nat,one_one_nat))=one_one_int)). % 0.10/0.38 cnf(i_0_8, plain, (power_power_int(pls,plus_plus_nat(one_one_nat,one_one_nat))=pls)). % 0.10/0.38 cnf(i_0_152, negated_conjecture, (power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),plus_plus_nat(one_one_nat,one_one_nat))=pls)). % 0.10/0.38 cnf(i_0_35, plain, (plus_plus_int(semiri1621563631at_int(X1),semiri1621563631at_int(X2))=semiri1621563631at_int(plus_plus_nat(X1,X2)))). % 0.10/0.38 cnf(i_0_7, plain, (power_power_nat(one_one_nat,plus_plus_nat(one_one_nat,one_one_nat))=one_one_nat)). % 0.10/0.38 cnf(i_0_9, plain, (power_power_nat(zero_zero_nat,plus_plus_nat(one_one_nat,one_one_nat))=zero_zero_nat)). % 0.10/0.38 cnf(i_0_96, plain, (ord_less_int(X1,plus_plus_int(X1,one_one_int)))). % 0.10/0.38 cnf(i_0_71, plain, (plus_plus_int(plus_plus_int(X1,X2),X3)=plus_plus_int(X1,plus_plus_int(X2,X3)))). % 0.10/0.38 cnf(i_0_12, plain, (number_number_of_int(plus_plus_int(one_one_int,X1))=plus_plus_int(one_one_int,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_13, plain, (number_number_of_int(plus_plus_int(X1,one_one_int))=plus_plus_int(one_one_int,number_number_of_int(X1)))). % 0.10/0.38 cnf(i_0_139, plain, (plus_plus_int(number_number_of_int(X1),number_number_of_int(X2))=number_number_of_int(plus_plus_int(X1,X2)))). % 0.10/0.38 cnf(i_0_17, plain, (power_power_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),plus_plus_nat(one_one_nat,one_one_nat))=power_power_int(X1,number_number_of_nat(plus_plus_int(one_one_int,plus_plus_int(one_one_int,plus_plus_int(one_one_int,one_one_int))))))). % 0.10/0.38 cnf(i_0_34, plain, (plus_plus_int(semiri1621563631at_int(X1),plus_plus_int(semiri1621563631at_int(X2),X3))=plus_plus_int(semiri1621563631at_int(plus_plus_nat(X1,X2)),X3))). % 0.10/0.38 cnf(i_0_137, plain, (plus_plus_int(number_number_of_int(X1),plus_plus_int(number_number_of_int(X2),X3))=plus_plus_int(number_number_of_int(plus_plus_int(X1,X2)),X3))). % 0.10/0.38 cnf(i_0_73, plain, (plus_plus_int(X1,X2)=plus_plus_int(X2,X1))). % 0.10/0.38 cnf(i_0_72, plain, (plus_plus_int(X1,plus_plus_int(X2,X3))=plus_plus_int(X2,plus_plus_int(X1,X3)))). % 0.10/0.38 cnf(i_0_118, plain, (one_one_int!=pls)). % 0.10/0.38 cnf(i_0_92, plain, (~ord_less_int(pls,pls))). % 0.10/0.38 cnf(i_0_99, plain, (~ord_less_int(semiri1621563631at_int(X1),pls))). % 0.10/0.38 cnf(i_0_109, plain, (plus_plus_int(X1,plus_plus_int(one_one_int,X1))!=pls)). % 0.10/0.38 cnf(i_0_110, plain, (plus_plus_int(X1,X1)!=plus_plus_int(X2,plus_plus_int(one_one_int,X2)))). % 0.10/0.38 cnf(i_0_148, plain, (~ord_less_int(power_power_int(X1,plus_plus_nat(one_one_nat,one_one_nat)),pls))). % 0.10/0.38 cnf(i_0_40, plain, (X1=zero_zero_nat|semiri1621563631at_int(X1)!=pls)). % 0.10/0.38 cnf(i_0_132, plain, (power_power_int(X1,number_number_of_nat(X2))!=pls|number_number_of_nat(X2)!=zero_zero_nat)). % 0.10/0.38 cnf(i_0_135, plain, (power_power_nat(X1,number_number_of_n# Child (22484) has found a proof. % 0.10/0.38 % 0.10/0.38 # Proof search is over... % 0.10/0.38 # Freeing feature tree %------------------------------------------------------------------------------