%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV565-1.010 : TPTP v8.1.0. Released v4.0.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 : Wed Jul 20 18:22:38 EDT 2022 % Result : Unsatisfiable 9.97s 1.69s % Output : CNFRefutation 9.97s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SWV565-1.010 : TPTP v8.1.0. Released v4.0.0. % 0.10/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n029.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Wed Jun 15 18:13:27 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C02____F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 48 Number of unprocessed: 48 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 48 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 47 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 1 extension rule candidate clauses % 0.13/0.37 # 47 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # Creating equality axioms % 0.13/0.37 # Ran out of tableaux, making start rules for all clauses % 0.13/0.37 # Returning from population with 57 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 57 tableaux to operate on % 9.97/1.69 # There were 1 total branch saturation attempts. % 9.97/1.69 # There were 0 of these attempts blocked. % 9.97/1.69 # There were 0 deferred branch saturation attempts. % 9.97/1.69 # There were 0 free duplicated saturations. % 9.97/1.69 # There were 1 total successful branch saturations. % 9.97/1.69 # There were 0 successful branch saturations in interreduction. % 9.97/1.69 # There were 0 successful branch saturations on the branch. % 9.97/1.69 # There were 1 successful branch saturations after the branch. % 9.97/1.69 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.97/1.69 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.97/1.69 # Begin clausification derivation % 9.97/1.69 % 9.97/1.69 # End clausification derivation % 9.97/1.69 # Begin listing active clauses obtained from FOF to CNF conversion % 9.97/1.69 cnf(i_0_95, hypothesis, (a_82=a_80)). % 9.97/1.69 cnf(i_0_92, hypothesis, (select(a1,i_83)=e_84)). % 9.97/1.69 cnf(i_0_93, hypothesis, (select(a2,i_83)=e_85)). % 9.97/1.69 cnf(i_0_72, hypothesis, (select(a2,i1)=e_43)). % 9.97/1.69 cnf(i_0_73, hypothesis, (select(a1,i1)=e_45)). % 9.97/1.69 cnf(i_0_74, hypothesis, (select(a_46,i2)=e_47)). % 9.97/1.69 cnf(i_0_75, hypothesis, (select(a_44,i2)=e_49)). % 9.97/1.69 cnf(i_0_76, hypothesis, (select(a_50,i3)=e_51)). % 9.97/1.69 cnf(i_0_77, hypothesis, (select(a_48,i3)=e_53)). % 9.97/1.69 cnf(i_0_78, hypothesis, (select(a_54,i4)=e_55)). % 9.97/1.69 cnf(i_0_79, hypothesis, (select(a_52,i4)=e_57)). % 9.97/1.69 cnf(i_0_80, hypothesis, (select(a_58,i5)=e_59)). % 9.97/1.69 cnf(i_0_81, hypothesis, (select(a_56,i5)=e_61)). % 9.97/1.69 cnf(i_0_82, hypothesis, (select(a_62,i6)=e_63)). % 9.97/1.69 cnf(i_0_83, hypothesis, (select(a_60,i6)=e_65)). % 9.97/1.69 cnf(i_0_84, hypothesis, (select(a_66,i7)=e_67)). % 9.97/1.69 cnf(i_0_85, hypothesis, (select(a_64,i7)=e_69)). % 9.97/1.69 cnf(i_0_86, hypothesis, (select(a_70,i8)=e_71)). % 9.97/1.69 cnf(i_0_87, hypothesis, (select(a_68,i8)=e_73)). % 9.97/1.69 cnf(i_0_88, hypothesis, (select(a_74,i9)=e_75)). % 9.97/1.69 cnf(i_0_89, hypothesis, (select(a_72,i9)=e_77)). % 9.97/1.69 cnf(i_0_90, hypothesis, (select(a_78,i10)=e_79)). % 9.97/1.69 cnf(i_0_91, hypothesis, (select(a_76,i10)=e_81)). % 9.97/1.69 cnf(i_0_94, hypothesis, (sk(a1,a2)=i_83)). % 9.97/1.69 cnf(i_0_52, hypothesis, (store(a1,i1,e_43)=a_44)). % 9.97/1.69 cnf(i_0_53, hypothesis, (store(a2,i1,e_45)=a_46)). % 9.97/1.69 cnf(i_0_54, hypothesis, (store(a_44,i2,e_47)=a_48)). % 9.97/1.69 cnf(i_0_55, hypothesis, (store(a_46,i2,e_49)=a_50)). % 9.97/1.69 cnf(i_0_56, hypothesis, (store(a_48,i3,e_51)=a_52)). % 9.97/1.69 cnf(i_0_57, hypothesis, (store(a_50,i3,e_53)=a_54)). % 9.97/1.69 cnf(i_0_58, hypothesis, (store(a_52,i4,e_55)=a_56)). % 9.97/1.69 cnf(i_0_59, hypothesis, (store(a_54,i4,e_57)=a_58)). % 9.97/1.69 cnf(i_0_60, hypothesis, (store(a_56,i5,e_59)=a_60)). % 9.97/1.69 cnf(i_0_61, hypothesis, (store(a_58,i5,e_61)=a_62)). % 9.97/1.69 cnf(i_0_62, hypothesis, (store(a_60,i6,e_63)=a_64)). % 9.97/1.69 cnf(i_0_63, hypothesis, (store(a_62,i6,e_65)=a_66)). % 9.97/1.69 cnf(i_0_64, hypothesis, (store(a_64,i7,e_67)=a_68)). % 9.97/1.69 cnf(i_0_65, hypothesis, (store(a_66,i7,e_69)=a_70)). % 9.97/1.69 cnf(i_0_66, hypothesis, (store(a_68,i8,e_71)=a_72)). % 9.97/1.69 cnf(i_0_67, hypothesis, (store(a_70,i8,e_73)=a_74)). % 9.97/1.69 cnf(i_0_68, hypothesis, (store(a_72,i9,e_75)=a_76)). % 9.97/1.69 cnf(i_0_69, hypothesis, (store(a_74,i9,e_77)=a_78)). % 9.97/1.69 cnf(i_0_70, hypothesis, (store(a_76,i10,e_79)=a_80)). % 9.97/1.69 cnf(i_0_71, hypothesis, (store(a_78,i10,e_81)=a_80)). % 9.97/1.69 cnf(i_0_49, plain, (select(store(X1,X2,X3),X2)=X3)). % 9.97/1.69 cnf(i_0_51, plain, (store(store(X1,X2,select(X1,X3)),X3,select(X1,X2))=store(store(X1,X3,select(X1,X2)),X2,select(X1,X3)))). % 9.97/1.69 cnf(i_0_96, negated_conjecture, (e_85!=e_84)). % 9.97/1.69 cnf(i_0_50, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 9.97/1.69 cnf(i_0_102, plain, (X5=X5)). % 9.97/1.69 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 9.97/1.69 # Begin printing tableau % 9.97/1.69 # Found 7 steps % 9.97/1.69 cnf(i_0_95, hypothesis, (a_82=a_80), inference(start_rule)). % 9.97/1.69 cnf(i_0_109, plain, (a_82=a_80), inference(extension_rule, [i_0_107])). % 9.97/1.69 cnf(i_0_174, plain, (a_82!=a_80), inference(closure_rule, [i_0_95])). % 9.97/1.69 cnf(i_0_172, plain, (select(a_82,a_82)=select(a_80,a_80)), inference(extension_rule, [i_0_106])). % 9.97/1.69 cnf(i_0_235, plain, (a_82!=a_80), inference(closure_rule, [i_0_95])). % 9.97/1.69 cnf(i_0_236, plain, (a_82!=a_80), inference(closure_rule, [i_0_95])). % 9.97/1.69 cnf(i_0_233, plain, (store(select(a_82,a_82),a_82,a_82)=store(select(a_80,a_80),a_80,a_80)), inference(etableau_closure_rule, [i_0_233, ...])). % 9.97/1.69 # End printing tableau % 9.97/1.69 # SZS output end % 9.97/1.69 # Branches closed with saturation will be marked with an "s" % 9.97/1.69 # Child (11281) has found a proof. % 9.97/1.69 % 9.97/1.69 # Proof search is over... % 9.97/1.69 # Freeing feature tree %------------------------------------------------------------------------------