%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP325-1 : TPTP v8.1.0. Released v2.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 : n020.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 : Sat Jul 16 09:05:59 EDT 2022 % Result : Unsatisfiable 3.34s 0.77s % Output : CNFRefutation 3.34s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : GRP325-1 : TPTP v8.1.0. Released v2.5.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.12/0.33 % Computer : n020.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 : Mon Jun 13 05:00:35 EDT 2022 % 0.12/0.34 % CPUTime : % 0.18/0.37 # No SInE strategy applied % 0.18/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.18/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.37 # % 0.18/0.37 # Presaturation interreduction done % 0.18/0.37 # Number of axioms: 50 Number of unprocessed: 50 % 0.18/0.37 # Tableaux proof search. % 0.18/0.37 # APR header successfully linked. % 0.18/0.37 # Hello from C++ % 0.18/0.37 # The folding up rule is enabled... % 0.18/0.37 # Local unification is enabled... % 0.18/0.37 # Any saturation attempts will use folding labels... % 0.18/0.37 # 50 beginning clauses after preprocessing and clausification % 0.18/0.37 # Creating start rules for all 47 conjectures. % 0.18/0.37 # There are 47 start rule candidates: % 0.18/0.37 # Found 4 unit axioms. % 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.37 # 47 start rule tableaux created. % 0.18/0.37 # 46 extension rule candidate clauses % 0.18/0.37 # 4 unit axiom clauses % 0.18/0.37 % 0.18/0.37 # Requested 8, 32 cores available to the main process. % 3.03/0.77 # Creating equality axioms % 3.03/0.77 # Ran out of tableaux, making start rules for all clauses % 3.34/0.77 # There were 1 total branch saturation attempts. % 3.34/0.77 # There were 0 of these attempts blocked. % 3.34/0.77 # There were 0 deferred branch saturation attempts. % 3.34/0.77 # There were 0 free duplicated saturations. % 3.34/0.77 # There were 1 total successful branch saturations. % 3.34/0.77 # There were 0 successful branch saturations in interreduction. % 3.34/0.77 # There were 0 successful branch saturations on the branch. % 3.34/0.77 # There were 1 successful branch saturations after the branch. % 3.34/0.77 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.34/0.77 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.34/0.77 # Begin clausification derivation % 3.34/0.77 % 3.34/0.77 # End clausification derivation % 3.34/0.77 # Begin listing active clauses obtained from FOF to CNF conversion % 3.34/0.77 cnf(i_0_54, negated_conjecture, (multiply(sk_c9,sk_c10)=sk_c8)). % 3.34/0.77 cnf(i_0_51, plain, (multiply(identity,X1)=X1)). % 3.34/0.77 cnf(i_0_52, plain, (multiply(inverse(X1),X1)=identity)). % 3.34/0.77 cnf(i_0_53, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 3.34/0.77 cnf(i_0_66, negated_conjecture, (inverse(sk_c1)=sk_c9|inverse(sk_c9)=sk_c8)). % 3.34/0.77 cnf(i_0_93, negated_conjecture, (inverse(sk_c2)=sk_c10|inverse(sk_c9)=sk_c8)). % 3.34/0.77 cnf(i_0_65, negated_conjecture, (inverse(sk_c4)=sk_c10|inverse(sk_c1)=sk_c9)). % 3.34/0.77 cnf(i_0_68, negated_conjecture, (inverse(sk_c5)=sk_c9|inverse(sk_c1)=sk_c9)). % 3.34/0.77 cnf(i_0_70, negated_conjecture, (inverse(sk_c7)=sk_c6|inverse(sk_c1)=sk_c9)). % 3.34/0.77 cnf(i_0_71, negated_conjecture, (inverse(sk_c6)=sk_c10|inverse(sk_c1)=sk_c9)). % 3.34/0.77 cnf(i_0_92, negated_conjecture, (inverse(sk_c2)=sk_c10|inverse(sk_c4)=sk_c10)). % 3.34/0.77 cnf(i_0_95, negated_conjecture, (inverse(sk_c2)=sk_c10|inverse(sk_c5)=sk_c9)). % 3.34/0.77 cnf(i_0_97, negated_conjecture, (inverse(sk_c2)=sk_c10|inverse(sk_c7)=sk_c6)). % 3.34/0.77 cnf(i_0_98, negated_conjecture, (inverse(sk_c2)=sk_c10|inverse(sk_c6)=sk_c10)). % 3.34/0.77 cnf(i_0_75, negated_conjecture, (multiply(sk_c10,sk_c3)=sk_c9|inverse(sk_c9)=sk_c8)). % 3.34/0.77 cnf(i_0_57, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|inverse(sk_c9)=sk_c8)). % 3.34/0.77 cnf(i_0_84, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|inverse(sk_c9)=sk_c8)). % 3.34/0.77 cnf(i_0_67, negated_conjecture, (multiply(sk_c10,sk_c8)=sk_c9|inverse(sk_c1)=sk_c9)). % 3.34/0.77 cnf(i_0_64, negated_conjecture, (multiply(sk_c4,sk_c10)=sk_c9|inverse(sk_c1)=sk_c9)). % 3.34/0.77 cnf(i_0_69, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c9|inverse(sk_c1)=sk_c9)). % 3.34/0.77 cnf(i_0_72, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c6|inverse(sk_c1)=sk_c9)). % 3.34/0.77 cnf(i_0_74, negated_conjecture, (multiply(sk_c10,sk_c3)=sk_c9|inverse(sk_c4)=sk_c10)). % 3.34/0.77 cnf(i_0_56, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|inverse(sk_c4)=sk_c10)). % 3.34/0.77 cnf(i_0_83, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|inverse(sk_c4)=sk_c10)). % 3.34/0.77 cnf(i_0_77, negated_conjecture, (multiply(sk_c10,sk_c3)=sk_c9|inverse(sk_c5)=sk_c9)). % 3.34/0.77 cnf(i_0_59, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|inverse(sk_c5)=sk_c9)). % 3.34/0.77 cnf(i_0_86, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|inverse(sk_c5)=sk_c9)). % 3.34/0.77 cnf(i_0_79, negated_conjecture, (multiply(sk_c10,sk_c3)=sk_c9|inverse(sk_c7)=sk_c6)). % 3.34/0.77 cnf(i_0_61, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|inverse(sk_c7)=sk_c6)). % 3.34/0.77 cnf(i_0_88, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|inverse(sk_c7)=sk_c6)). % 3.34/0.77 cnf(i_0_80, negated_conjecture, (multiply(sk_c10,sk_c3)=sk_c9|inverse(sk_c6)=sk_c10)). % 3.34/0.77 cnf(i_0_62, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|inverse(sk_c6)=sk_c10)). % 3.34/0.77 cnf(i_0_89, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|inverse(sk_c6)=sk_c10)). % 3.34/0.77 cnf(i_0_94, negated_conjecture, (multiply(sk_c10,sk_c8)=sk_c9|inverse(sk_c2)=sk_c10)). % 3.34/0.77 cnf(i_0_91, negated_conjecture, (multiply(sk_c4,sk_c10)=sk_c9|inverse(sk_c2)=sk_c10)). % 3.34/0.77 cnf(i_0_96, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c9|inverse(sk_c2)=sk_c10)). % 3.34/0.77 cnf(i_0_99, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c6|inverse(sk_c2)=sk_c10)). % 3.34/0.77 cnf(i_0_76, negated_conjecture, (multiply(sk_c10,sk_c3)=sk_c9|multiply(sk_c10,sk_c8)=sk_c9)). % 3.34/0.77 cnf(i_0_58, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|multiply(sk_c10,sk_c8)=sk_c9)). % 3.34/0.77 cnf(i_0_85, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|multiply(sk_c10,sk_c8)=sk_c9)). % 3.34/0.77 cnf(i_0_73, negated_conjecture, (multiply(sk_c4,sk_c10)=sk_c9|multiply(sk_c10,sk_c3)=sk_c9)). % 3.34/0.77 cnf(i_0_78, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c9|multiply(sk_c10,sk_c3)=sk_c9)). % 3.34/0.77 cnf(i_0_81, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c6|multiply(sk_c10,sk_c3)=sk_c9)). % 3.34/0.77 cnf(i_0_55, negated_conjecture, (multiply(sk_c4,sk_c10)=sk_c9|multiply(sk_c1,sk_c9)=sk_c10)). % 3.34/0.77 cnf(i_0_60, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c9|multiply(sk_c1,sk_c9)=sk_c10)). % 3.34/0.77 cnf(i_0_63, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c6|multiply(sk_c1,sk_c9)=sk_c10)). % 3.34/0.77 cnf(i_0_82, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|multiply(sk_c4,sk_c10)=sk_c9)). % 3.34/0.77 cnf(i_0_87, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|multiply(sk_c5,sk_c8)=sk_c9)). % 3.34/0.77 cnf(i_0_90, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|multiply(sk_c7,sk_c10)=sk_c6)). % 3.34/0.77 cnf(i_0_100, negated_conjecture, (multiply(sk_c10,multiply(X1,sk_c10))!=sk_c9|inverse(multiply(X2,sk_c10))!=sk_c10|multiply(sk_c10,sk_c8)!=sk_c9|inverse(X2)!=multiply(X2,sk_c10)|multiply(X3,sk_c8)!=sk_c9|multiply(X4,sk_c10)!=sk_c9|multiply(X5,sk_c9)!=sk_c10|inverse(sk_c9)!=sk_c8|inverse(X3)!=sk_c9|inverse(X4)!=sk_c10|inverse(X1)!=sk_c10|inverse(X5)!=sk_c9)). % 3.34/0.77 cnf(i_0_2870, plain, (X8=X8)). % 3.34/0.77 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 3.34/0.77 # Begin printing tableau % 3.34/0.77 # Found 6 steps % 3.34/0.77 cnf(i_0_2870, plain, (identity=identity), inference(start_rule)). % 3.34/0.77 cnf(i_0_2982, plain, (identity=identity), inference(extension_rule, [i_0_2874])). % 3.34/0.77 cnf(i_0_3094, plain, (multiply(sk_c9,sk_c10)!=sk_c8), inference(closure_rule, [i_0_54])). % 3.34/0.77 cnf(i_0_3092, plain, (multiply(identity,multiply(sk_c9,sk_c10))=multiply(identity,sk_c8)), inference(extension_rule, [i_0_2873])). % 3.34/0.77 cnf(i_0_3203, plain, (multiply(identity,sk_c8)!=sk_c8), inference(closure_rule, [i_0_51])). % 3.34/0.77 cnf(i_0_3201, plain, (multiply(identity,multiply(sk_c9,sk_c10))=sk_c8), inference(etableau_closure_rule, [i_0_3201, ...])). % 3.34/0.77 # End printing tableau % 3.34/0.77 # SZS output end % 3.34/0.77 # Branches closed with saturation will be marked with an "s" % 3.34/0.78 # Child (27708) has found a proof. % 3.34/0.78 % 3.34/0.78 # Proof search is over... % 3.34/0.78 # Freeing feature tree %------------------------------------------------------------------------------