%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV565-1.007 : 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 : n003.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 1.43s 0.56s % Output : CNFRefutation 1.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV565-1.007 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n003.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Thu Jun 16 04:16:26 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C02____F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 36 Number of unprocessed: 36 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 36 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 35 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 1 extension rule candidate clauses % 0.12/0.37 # 35 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.37 # Creating equality axioms % 0.12/0.37 # Ran out of tableaux, making start rules for all clauses % 0.12/0.37 # Returning from population with 45 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 45 tableaux to operate on % 1.43/0.56 # There were 1 total branch saturation attempts. % 1.43/0.56 # There were 0 of these attempts blocked. % 1.43/0.56 # There were 0 deferred branch saturation attempts. % 1.43/0.56 # There were 0 free duplicated saturations. % 1.43/0.56 # There were 1 total successful branch saturations. % 1.43/0.56 # There were 0 successful branch saturations in interreduction. % 1.43/0.56 # There were 0 successful branch saturations on the branch. % 1.43/0.56 # There were 1 successful branch saturations after the branch. % 1.43/0.56 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.43/0.56 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.43/0.56 # Begin clausification derivation % 1.43/0.56 % 1.43/0.56 # End clausification derivation % 1.43/0.56 # Begin listing active clauses obtained from FOF to CNF conversion % 1.43/0.56 cnf(i_0_71, hypothesis, (a_58=a_56)). % 1.43/0.56 cnf(i_0_68, hypothesis, (select(a1,i_59)=e_60)). % 1.43/0.56 cnf(i_0_69, hypothesis, (select(a2,i_59)=e_61)). % 1.43/0.56 cnf(i_0_54, hypothesis, (select(a2,i1)=e_31)). % 1.43/0.56 cnf(i_0_55, hypothesis, (select(a1,i1)=e_33)). % 1.43/0.56 cnf(i_0_56, hypothesis, (select(a_34,i2)=e_35)). % 1.43/0.56 cnf(i_0_57, hypothesis, (select(a_32,i2)=e_37)). % 1.43/0.56 cnf(i_0_58, hypothesis, (select(a_38,i3)=e_39)). % 1.43/0.56 cnf(i_0_59, hypothesis, (select(a_36,i3)=e_41)). % 1.43/0.56 cnf(i_0_60, hypothesis, (select(a_42,i4)=e_43)). % 1.43/0.56 cnf(i_0_61, hypothesis, (select(a_40,i4)=e_45)). % 1.43/0.56 cnf(i_0_62, hypothesis, (select(a_46,i5)=e_47)). % 1.43/0.56 cnf(i_0_63, hypothesis, (select(a_44,i5)=e_49)). % 1.43/0.56 cnf(i_0_64, hypothesis, (select(a_50,i6)=e_51)). % 1.43/0.56 cnf(i_0_65, hypothesis, (select(a_48,i6)=e_53)). % 1.43/0.56 cnf(i_0_66, hypothesis, (select(a_54,i7)=e_55)). % 1.43/0.56 cnf(i_0_67, hypothesis, (select(a_52,i7)=e_57)). % 1.43/0.56 cnf(i_0_70, hypothesis, (sk(a1,a2)=i_59)). % 1.43/0.56 cnf(i_0_40, hypothesis, (store(a1,i1,e_31)=a_32)). % 1.43/0.56 cnf(i_0_41, hypothesis, (store(a2,i1,e_33)=a_34)). % 1.43/0.56 cnf(i_0_42, hypothesis, (store(a_32,i2,e_35)=a_36)). % 1.43/0.56 cnf(i_0_43, hypothesis, (store(a_34,i2,e_37)=a_38)). % 1.43/0.56 cnf(i_0_44, hypothesis, (store(a_36,i3,e_39)=a_40)). % 1.43/0.56 cnf(i_0_45, hypothesis, (store(a_38,i3,e_41)=a_42)). % 1.43/0.56 cnf(i_0_46, hypothesis, (store(a_40,i4,e_43)=a_44)). % 1.43/0.56 cnf(i_0_47, hypothesis, (store(a_42,i4,e_45)=a_46)). % 1.43/0.56 cnf(i_0_48, hypothesis, (store(a_44,i5,e_47)=a_48)). % 1.43/0.56 cnf(i_0_49, hypothesis, (store(a_46,i5,e_49)=a_50)). % 1.43/0.56 cnf(i_0_50, hypothesis, (store(a_48,i6,e_51)=a_52)). % 1.43/0.56 cnf(i_0_51, hypothesis, (store(a_50,i6,e_53)=a_54)). % 1.43/0.56 cnf(i_0_52, hypothesis, (store(a_52,i7,e_55)=a_56)). % 1.43/0.56 cnf(i_0_53, hypothesis, (store(a_54,i7,e_57)=a_56)). % 1.43/0.56 cnf(i_0_37, plain, (select(store(X1,X2,X3),X2)=X3)). % 1.43/0.56 cnf(i_0_39, plain, (store(store(X1,X2,select(X1,X3)),X3,select(X1,X2))=store(store(X1,X3,select(X1,X2)),X2,select(X1,X3)))). % 1.43/0.56 cnf(i_0_72, negated_conjecture, (e_61!=e_60)). % 1.43/0.56 cnf(i_0_38, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 1.43/0.56 cnf(i_0_78, plain, (X5=X5)). % 1.43/0.56 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.43/0.56 # Begin printing tableau % 1.43/0.56 # Found 7 steps % 1.43/0.56 cnf(i_0_71, hypothesis, (a_58=a_56), inference(start_rule)). % 1.43/0.56 cnf(i_0_85, plain, (a_58=a_56), inference(extension_rule, [i_0_82])). % 1.43/0.56 cnf(i_0_134, plain, (a_58!=a_56), inference(closure_rule, [i_0_71])). % 1.43/0.56 cnf(i_0_135, plain, (a_58!=a_56), inference(closure_rule, [i_0_71])). % 1.43/0.56 cnf(i_0_132, plain, (store(a_58,a_58,a_58)=store(a_56,a_56,a_56)), inference(extension_rule, [i_0_83])). % 1.43/0.56 cnf(i_0_214, plain, (a_58!=a_56), inference(closure_rule, [i_0_71])). % 1.43/0.56 cnf(i_0_212, plain, (select(store(a_58,a_58,a_58),a_58)=select(store(a_56,a_56,a_56),a_56)), inference(etableau_closure_rule, [i_0_212, ...])). % 1.43/0.56 # End printing tableau % 1.43/0.56 # SZS output end % 1.43/0.56 # Branches closed with saturation will be marked with an "s" % 1.43/0.56 # Child (14280) has found a proof. % 1.43/0.56 % 1.43/0.56 # Proof search is over... % 1.43/0.56 # Freeing feature tree %------------------------------------------------------------------------------