%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP377-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 : n011.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:06:12 EDT 2022 % Result : Unsatisfiable 0.21s 0.49s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP377-1 : TPTP v8.1.0. Released v2.5.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.14/0.34 % Computer : n011.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Mon Jun 13 08:09:48 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.38 # No SInE strategy applied % 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.38 # % 0.14/0.38 # Presaturation interreduction done % 0.14/0.38 # Number of axioms: 44 Number of unprocessed: 44 % 0.14/0.38 # Tableaux proof search. % 0.14/0.38 # APR header successfully linked. % 0.14/0.38 # Hello from C++ % 0.14/0.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 44 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 41 conjectures. % 0.14/0.38 # There are 41 start rule candidates: % 0.14/0.38 # Found 3 unit axioms. % 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.38 # 41 start rule tableaux created. % 0.14/0.38 # 41 extension rule candidate clauses % 0.14/0.38 # 3 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.21/0.49 # Creating equality axioms % 0.21/0.49 # Ran out of tableaux, making start rules for all clauses % 0.21/0.49 # There were 1 total branch saturation attempts. % 0.21/0.49 # There were 0 of these attempts blocked. % 0.21/0.49 # There were 0 deferred branch saturation attempts. % 0.21/0.49 # There were 0 free duplicated saturations. % 0.21/0.49 # There were 1 total successful branch saturations. % 0.21/0.49 # There were 0 successful branch saturations in interreduction. % 0.21/0.49 # There were 0 successful branch saturations on the branch. % 0.21/0.49 # There were 1 successful branch saturations after the branch. % 0.21/0.49 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.49 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.49 # Begin clausification derivation % 0.21/0.49 % 0.21/0.49 # End clausification derivation % 0.21/0.49 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.49 cnf(i_0_45, plain, (multiply(identity,X1)=X1)). % 0.21/0.49 cnf(i_0_46, plain, (multiply(inverse(X1),X1)=identity)). % 0.21/0.49 cnf(i_0_47, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 0.21/0.49 cnf(i_0_49, negated_conjecture, (inverse(sk_c2)=sk_c10|inverse(sk_c10)=sk_c9)). % 0.21/0.49 cnf(i_0_51, negated_conjecture, (inverse(sk_c3)=sk_c9|inverse(sk_c10)=sk_c9)). % 0.21/0.49 cnf(i_0_53, negated_conjecture, (inverse(sk_c4)=sk_c7|inverse(sk_c10)=sk_c9)). % 0.21/0.49 cnf(i_0_55, negated_conjecture, (inverse(sk_c6)=sk_c5|inverse(sk_c10)=sk_c9)). % 0.21/0.49 cnf(i_0_56, negated_conjecture, (inverse(sk_c5)=sk_c7|inverse(sk_c10)=sk_c9)). % 0.21/0.49 cnf(i_0_69, negated_conjecture, (inverse(sk_c1)=sk_c10|inverse(sk_c2)=sk_c10)). % 0.21/0.49 cnf(i_0_71, negated_conjecture, (inverse(sk_c1)=sk_c10|inverse(sk_c3)=sk_c9)). % 0.21/0.49 cnf(i_0_73, negated_conjecture, (inverse(sk_c1)=sk_c10|inverse(sk_c4)=sk_c7)). % 0.21/0.49 cnf(i_0_75, negated_conjecture, (inverse(sk_c1)=sk_c10|inverse(sk_c6)=sk_c5)). % 0.21/0.49 cnf(i_0_76, negated_conjecture, (inverse(sk_c1)=sk_c10|inverse(sk_c5)=sk_c7)). % 0.21/0.49 cnf(i_0_48, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c9|inverse(sk_c10)=sk_c9)). % 0.21/0.49 cnf(i_0_50, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c8|inverse(sk_c10)=sk_c9)). % 0.21/0.49 cnf(i_0_52, negated_conjecture, (multiply(sk_c4,sk_c7)=sk_c10|inverse(sk_c10)=sk_c9)). % 0.21/0.49 cnf(i_0_54, negated_conjecture, (multiply(sk_c7,sk_c9)=sk_c10|inverse(sk_c10)=sk_c9)). % 0.21/0.49 cnf(i_0_57, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c5|inverse(sk_c10)=sk_c9)). % 0.21/0.49 cnf(i_0_79, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c10|inverse(sk_c2)=sk_c10)). % 0.21/0.49 cnf(i_0_59, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c9|inverse(sk_c2)=sk_c10)). % 0.21/0.49 cnf(i_0_81, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c10|inverse(sk_c3)=sk_c9)). % 0.21/0.49 cnf(i_0_61, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c9|inverse(sk_c3)=sk_c9)). % 0.21/0.49 cnf(i_0_83, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c10|inverse(sk_c4)=sk_c7)). % 0.21/0.49 cnf(i_0_63, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c9|inverse(sk_c4)=sk_c7)). % 0.21/0.49 cnf(i_0_85, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c10|inverse(sk_c6)=sk_c5)). % 0.21/0.49 cnf(i_0_65, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c9|inverse(sk_c6)=sk_c5)). % 0.21/0.49 cnf(i_0_86, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c10|inverse(sk_c5)=sk_c7)). % 0.21/0.49 cnf(i_0_66, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c9|inverse(sk_c5)=sk_c7)). % 0.21/0.49 cnf(i_0_68, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c9|inverse(sk_c1)=sk_c10)). % 0.21/0.49 cnf(i_0_70, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c8|inverse(sk_c1)=sk_c10)). % 0.21/0.49 cnf(i_0_72, negated_conjecture, (multiply(sk_c4,sk_c7)=sk_c10|inverse(sk_c1)=sk_c10)). % 0.21/0.49 cnf(i_0_74, negated_conjecture, (multiply(sk_c7,sk_c9)=sk_c10|inverse(sk_c1)=sk_c10)). % 0.21/0.49 cnf(i_0_77, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c5|inverse(sk_c1)=sk_c10)). % 0.21/0.49 cnf(i_0_78, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c10|multiply(sk_c2,sk_c10)=sk_c9)). % 0.21/0.49 cnf(i_0_58, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c9|multiply(sk_c2,sk_c10)=sk_c9)). % 0.21/0.49 cnf(i_0_80, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c10|multiply(sk_c3,sk_c9)=sk_c8)). % 0.21/0.49 cnf(i_0_60, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c9|multiply(sk_c3,sk_c9)=sk_c8)). % 0.21/0.49 cnf(i_0_82, negated_conjecture, (multiply(sk_c4,sk_c7)=sk_c10|multiply(sk_c8,sk_c9)=sk_c10)). % 0.21/0.49 cnf(i_0_84, negated_conjecture, (multiply(sk_c7,sk_c9)=sk_c10|multiply(sk_c8,sk_c9)=sk_c10)). % 0.21/0.49 cnf(i_0_87, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c5|multiply(sk_c8,sk_c9)=sk_c10)). % 0.21/0.49 cnf(i_0_62, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c9|multiply(sk_c4,sk_c7)=sk_c10)). % 0.21/0.49 cnf(i_0_64, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c9|multiply(sk_c7,sk_c9)=sk_c10)). % 0.21/0.49 cnf(i_0_67, negated_conjecture, (multiply(sk_c1,sk_c10)=sk_c9|multiply(sk_c6,sk_c7)=sk_c5)). % 0.21/0.49 cnf(i_0_88, negated_conjecture, (inverse(multiply(X1,inverse(X2)))!=inverse(X2)|multiply(inverse(X2),sk_c9)!=sk_c10|multiply(X1,inverse(X2))!=inverse(X1)|multiply(sk_c8,sk_c9)!=sk_c10|multiply(X2,inverse(X2))!=sk_c10|multiply(X3,sk_c9)!=sk_c8|multiply(X4,sk_c10)!=sk_c9|multiply(X5,sk_c10)!=sk_c9|inverse(sk_c10)!=sk_c9|inverse(X3)!=sk_c9|inverse(X4)!=sk_c10|inverse(X5)!=sk_c10)). % 0.21/0.49 cnf(i_0_3691, plain, (X8=X8)). % 0.21/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.49 # Begin printing tableau % 0.21/0.49 # Found 6 steps % 0.21/0.49 cnf(i_0_3691, plain, (identity=identity), inference(start_rule)). % 0.21/0.49 cnf(i_0_3792, plain, (identity=identity), inference(extension_rule, [i_0_3695])). % 0.21/0.49 cnf(i_0_3894, plain, (multiply(identity,X5)!=X5), inference(closure_rule, [i_0_45])). % 0.21/0.49 cnf(i_0_3892, plain, (multiply(identity,multiply(identity,X5))=multiply(identity,X5)), inference(extension_rule, [i_0_3694])). % 0.21/0.49 cnf(i_0_3993, plain, (multiply(identity,X5)!=X5), inference(closure_rule, [i_0_45])). % 0.21/0.49 cnf(i_0_3991, plain, (multiply(identity,multiply(identity,X5))=X5), inference(etableau_closure_rule, [i_0_3991, ...])). % 0.21/0.49 # End printing tableau % 0.21/0.49 # SZS output end % 0.21/0.49 # Branches closed with saturation will be marked with an "s" % 0.21/0.49 # Creating equality axioms % 0.21/0.49 # Ran out of tableaux, making start rules for all clauses % 0.21/0.49 # Child (5569) has found a proof. % 0.21/0.49 % 0.21/0.49 # Proof search is over... % 0.21/0.49 # Freeing feature tree %------------------------------------------------------------------------------