%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP210-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 : n015.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:28 EDT 2022 % Result : Unsatisfiable 4.57s 0.97s % Output : CNFRefutation 4.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GRP210-1 : TPTP v8.1.0. Released v2.5.0. % 0.11/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 : n015.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 : Tue Jun 14 05:32:23 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 44 Number of unprocessed: 44 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # 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 # 44 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 41 conjectures. % 0.12/0.37 # There are 41 start rule candidates: % 0.12/0.37 # Found 3 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 41 start rule tableaux created. % 0.12/0.37 # 41 extension rule candidate clauses % 0.12/0.37 # 3 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 4.25/0.89 # Creating equality axioms % 4.25/0.89 # Ran out of tableaux, making start rules for all clauses % 4.57/0.93 # Creating equality axioms % 4.57/0.93 # Ran out of tableaux, making start rules for all clauses % 4.57/0.93 # Creating equality axioms % 4.57/0.93 # Ran out of tableaux, making start rules for all clauses % 4.57/0.93 # Creating equality axioms % 4.57/0.93 # Ran out of tableaux, making start rules for all clauses % 4.57/0.93 # Creating equality axioms % 4.57/0.93 # Ran out of tableaux, making start rules for all clauses % 4.57/0.94 # Creating equality axioms % 4.57/0.94 # Ran out of tableaux, making start rules for all clauses % 4.57/0.94 # Creating equality axioms % 4.57/0.94 # Ran out of tableaux, making start rules for all clauses % 4.57/0.94 # Creating equality axioms % 4.57/0.94 # Ran out of tableaux, making start rules for all clauses % 4.57/0.97 # There were 2 total branch saturation attempts. % 4.57/0.97 # There were 0 of these attempts blocked. % 4.57/0.97 # There were 0 deferred branch saturation attempts. % 4.57/0.97 # There were 0 free duplicated saturations. % 4.57/0.97 # There were 1 total successful branch saturations. % 4.57/0.97 # There were 0 successful branch saturations in interreduction. % 4.57/0.97 # There were 0 successful branch saturations on the branch. % 4.57/0.97 # There were 1 successful branch saturations after the branch. % 4.57/0.97 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.57/0.97 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.57/0.97 # Begin clausification derivation % 4.57/0.97 % 4.57/0.97 # End clausification derivation % 4.57/0.97 # Begin listing active clauses obtained from FOF to CNF conversion % 4.57/0.97 cnf(i_0_45, plain, (multiply(identity,X1)=X1)). % 4.57/0.97 cnf(i_0_46, plain, (multiply(inverse(X1),X1)=identity)). % 4.57/0.97 cnf(i_0_47, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 4.57/0.97 cnf(i_0_56, negated_conjecture, (inverse(sk_c4)=sk_c10|inverse(sk_c1)=sk_c2)). % 4.57/0.97 cnf(i_0_59, negated_conjecture, (inverse(sk_c5)=sk_c6|inverse(sk_c1)=sk_c2)). % 4.57/0.97 cnf(i_0_63, negated_conjecture, (inverse(sk_c7)=sk_c10|inverse(sk_c1)=sk_c2)). % 4.57/0.97 cnf(i_0_72, negated_conjecture, (inverse(sk_c3)=sk_c10|inverse(sk_c4)=sk_c10)). % 4.57/0.97 cnf(i_0_75, negated_conjecture, (inverse(sk_c3)=sk_c10|inverse(sk_c5)=sk_c6)). % 4.57/0.97 cnf(i_0_79, negated_conjecture, (inverse(sk_c3)=sk_c10|inverse(sk_c7)=sk_c10)). % 4.57/0.97 cnf(i_0_61, negated_conjecture, (multiply(sk_c10,sk_c8)=sk_c9|inverse(sk_c1)=sk_c2)). % 4.57/0.97 cnf(i_0_57, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c10|inverse(sk_c1)=sk_c2)). % 4.57/0.97 cnf(i_0_58, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c9|inverse(sk_c1)=sk_c2)). % 4.57/0.97 cnf(i_0_60, negated_conjecture, (multiply(sk_c6,sk_c10)=sk_c9|inverse(sk_c1)=sk_c2)). % 4.57/0.97 cnf(i_0_62, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c8|inverse(sk_c1)=sk_c2)). % 4.57/0.97 cnf(i_0_48, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c10|inverse(sk_c4)=sk_c10)). % 4.57/0.97 cnf(i_0_64, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c10|inverse(sk_c4)=sk_c10)). % 4.57/0.97 cnf(i_0_80, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|inverse(sk_c4)=sk_c10)). % 4.57/0.97 cnf(i_0_51, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c10|inverse(sk_c5)=sk_c6)). % 4.57/0.97 cnf(i_0_67, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c10|inverse(sk_c5)=sk_c6)). % 4.57/0.97 cnf(i_0_83, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|inverse(sk_c5)=sk_c6)). % 4.57/0.97 cnf(i_0_55, negated_conjecture, (multiply(sk_c1,sk_c2)=sk_c10|inverse(sk_c7)=sk_c10)). % 4.57/0.97 cnf(i_0_71, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c10|inverse(sk_c7)=sk_c10)). % 4.57/0.97 cnf(i_0_87, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|inverse(sk_c7)=sk_c10)). % 4.57/0.97 cnf(i_0_77, negated_conjecture, (multiply(sk_c10,sk_c8)=sk_c9|inverse(sk_c3)=sk_c10)). % 4.57/0.97 cnf(i_0_73, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c10|inverse(sk_c3)=sk_c10)). % 4.57/0.97 cnf(i_0_74, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c9|inverse(sk_c3)=sk_c10)). % 4.57/0.97 cnf(i_0_76, negated_conjecture, (multiply(sk_c6,sk_c10)=sk_c9|inverse(sk_c3)=sk_c10)). % 4.57/0.97 cnf(i_0_78, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c8|inverse(sk_c3)=sk_c10)). % 4.57/0.97 cnf(i_0_53, negated_conjecture, (multiply(sk_c10,sk_c8)=sk_c9|multiply(sk_c1,sk_c2)=sk_c10)). % 4.57/0.97 cnf(i_0_49, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c10|multiply(sk_c1,sk_c2)=sk_c10)). % 4.57/0.97 cnf(i_0_50, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c9|multiply(sk_c1,sk_c2)=sk_c10)). % 4.57/0.97 cnf(i_0_52, negated_conjecture, (multiply(sk_c6,sk_c10)=sk_c9|multiply(sk_c1,sk_c2)=sk_c10)). % 4.57/0.97 cnf(i_0_54, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c8|multiply(sk_c1,sk_c2)=sk_c10)). % 4.57/0.97 cnf(i_0_69, negated_conjecture, (multiply(sk_c10,sk_c8)=sk_c9|multiply(sk_c2,sk_c9)=sk_c10)). % 4.57/0.97 cnf(i_0_65, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c10|multiply(sk_c2,sk_c9)=sk_c10)). % 4.57/0.97 cnf(i_0_66, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c9|multiply(sk_c2,sk_c9)=sk_c10)). % 4.57/0.97 cnf(i_0_68, negated_conjecture, (multiply(sk_c6,sk_c10)=sk_c9|multiply(sk_c2,sk_c9)=sk_c10)). % 4.57/0.97 cnf(i_0_70, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c8|multiply(sk_c2,sk_c9)=sk_c10)). % 4.57/0.97 cnf(i_0_85, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|multiply(sk_c10,sk_c8)=sk_c9)). % 4.57/0.97 cnf(i_0_81, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|multiply(sk_c4,sk_c9)=sk_c10)). % 4.57/0.97 cnf(i_0_82, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|multiply(sk_c5,sk_c6)=sk_c9)). % 4.57/0.97 cnf(i_0_84, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|multiply(sk_c6,sk_c10)=sk_c9)). % 4.57/0.97 cnf(i_0_86, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c10|multiply(sk_c7,sk_c10)=sk_c8)). % 4.57/0.97 cnf(i_0_88, negated_conjecture, (multiply(sk_c10,multiply(X1,sk_c10))!=sk_c9|multiply(inverse(X2),sk_c10)!=sk_c9|multiply(inverse(X3),sk_c9)!=sk_c10|multiply(X2,inverse(X2))!=sk_c9|multiply(X3,inverse(X3))!=sk_c10|multiply(X4,sk_c9)!=sk_c10|multiply(X5,sk_c9)!=sk_c10|inverse(X1)!=sk_c10|inverse(X4)!=sk_c10|inverse(X5)!=sk_c10)). % 4.57/0.97 cnf(i_0_632, plain, (X9=X9)). % 4.57/0.97 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 4.57/0.97 # Begin printing tableau % 4.57/0.97 # Found 7 steps % 4.57/0.97 cnf(i_0_632, plain, (identity=identity), inference(start_rule)). % 4.57/0.97 cnf(i_0_731, plain, (identity=identity), inference(extension_rule, [i_0_636])). % 4.57/0.97 cnf(i_0_831, plain, (multiply(identity,X4)!=X4), inference(closure_rule, [i_0_45])). % 4.57/0.97 cnf(i_0_829, plain, (multiply(identity,multiply(identity,X4))=multiply(identity,X4)), inference(extension_rule, [i_0_635])). % 4.57/0.97 cnf(i_0_928, plain, (multiply(identity,multiply(identity,X4))!=multiply(identity,X4)), inference(closure_rule, [i_0_45])). % 4.57/0.97 cnf(i_0_926, plain, (multiply(identity,multiply(identity,X4))=multiply(identity,multiply(identity,X4))), inference(extension_rule, [i_0_637])). % 4.57/0.97 cnf(i_0_58716, plain, (inverse(multiply(identity,multiply(identity,X4)))=inverse(multiply(identity,multiply(identity,X4)))), inference(etableau_closure_rule, [i_0_58716, ...])). % 4.57/0.97 # End printing tableau % 4.57/0.97 # SZS output end % 4.57/0.97 # Branches closed with saturation will be marked with an "s" % 4.57/0.98 # Child (25460) has found a proof. % 4.57/0.98 % 4.57/0.98 # Proof search is over... % 4.57/0.98 # Freeing feature tree %------------------------------------------------------------------------------