%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP285-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 : n024.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:48 EDT 2022 % Result : Unsatisfiable 1.89s 0.63s % Output : CNFRefutation 1.89s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : GRP285-1 : TPTP v8.1.0. Released v2.5.0. % 0.08/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 : n024.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 06:16:03 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 32 Number of unprocessed: 32 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # 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 # 32 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 29 conjectures. % 0.14/0.38 # There are 29 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 # 29 start rule tableaux created. % 0.14/0.38 # 29 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.60 # Creating equality axioms % 0.21/0.60 # Ran out of tableaux, making start rules for all clauses % 1.89/0.63 # There were 1 total branch saturation attempts. % 1.89/0.63 # There were 0 of these attempts blocked. % 1.89/0.63 # There were 0 deferred branch saturation attempts. % 1.89/0.63 # There were 0 free duplicated saturations. % 1.89/0.63 # There were 1 total successful branch saturations. % 1.89/0.63 # There were 0 successful branch saturations in interreduction. % 1.89/0.63 # There were 0 successful branch saturations on the branch. % 1.89/0.63 # There were 1 successful branch saturations after the branch. % 1.89/0.63 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.89/0.63 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.89/0.63 # Begin clausification derivation % 1.89/0.63 % 1.89/0.63 # End clausification derivation % 1.89/0.63 # Begin listing active clauses obtained from FOF to CNF conversion % 1.89/0.63 cnf(i_0_33, plain, (multiply(identity,X1)=X1)). % 1.89/0.63 cnf(i_0_34, plain, (multiply(inverse(X1),X1)=identity)). % 1.89/0.63 cnf(i_0_35, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 1.89/0.63 cnf(i_0_51, negated_conjecture, (inverse(sk_c1)=sk_c9|inverse(sk_c3)=sk_c9)). % 1.89/0.63 cnf(i_0_53, negated_conjecture, (inverse(sk_c1)=sk_c9|inverse(sk_c4)=sk_c7)). % 1.89/0.63 cnf(i_0_56, negated_conjecture, (inverse(sk_c1)=sk_c9|inverse(sk_c5)=sk_c9)). % 1.89/0.63 cnf(i_0_37, negated_conjecture, (multiply(sk_c9,sk_c8)=sk_c7|inverse(sk_c3)=sk_c9)). % 1.89/0.63 cnf(i_0_44, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c8|inverse(sk_c3)=sk_c9)). % 1.89/0.63 cnf(i_0_58, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c7|inverse(sk_c3)=sk_c9)). % 1.89/0.63 cnf(i_0_39, negated_conjecture, (multiply(sk_c9,sk_c8)=sk_c7|inverse(sk_c4)=sk_c7)). % 1.89/0.63 cnf(i_0_46, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c8|inverse(sk_c4)=sk_c7)). % 1.89/0.63 cnf(i_0_60, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c7|inverse(sk_c4)=sk_c7)). % 1.89/0.63 cnf(i_0_42, negated_conjecture, (multiply(sk_c9,sk_c8)=sk_c7|inverse(sk_c5)=sk_c9)). % 1.89/0.63 cnf(i_0_49, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c8|inverse(sk_c5)=sk_c9)). % 1.89/0.63 cnf(i_0_63, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c7|inverse(sk_c5)=sk_c9)). % 1.89/0.63 cnf(i_0_54, negated_conjecture, (multiply(sk_c9,sk_c6)=sk_c7|inverse(sk_c1)=sk_c9)). % 1.89/0.63 cnf(i_0_50, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c8|inverse(sk_c1)=sk_c9)). % 1.89/0.63 cnf(i_0_52, negated_conjecture, (multiply(sk_c4,sk_c7)=sk_c8|inverse(sk_c1)=sk_c9)). % 1.89/0.63 cnf(i_0_55, negated_conjecture, (multiply(sk_c5,sk_c9)=sk_c6|inverse(sk_c1)=sk_c9)). % 1.89/0.63 cnf(i_0_40, negated_conjecture, (multiply(sk_c9,sk_c6)=sk_c7|multiply(sk_c9,sk_c8)=sk_c7)). % 1.89/0.63 cnf(i_0_36, negated_conjecture, (multiply(sk_c3,sk_c9)=sk_c8|multiply(sk_c9,sk_c8)=sk_c7)). % 1.89/0.63 cnf(i_0_38, negated_conjecture, (multiply(sk_c4,sk_c7)=sk_c8|multiply(sk_c9,sk_c8)=sk_c7)). % 1.89/0.63 cnf(i_0_41, negated_conjecture, (multiply(sk_c5,sk_c9)=sk_c6|multiply(sk_c9,sk_c8)=sk_c7)). % 1.89/0.63 cnf(i_0_47, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c8|multiply(sk_c9,sk_c6)=sk_c7)). % 1.89/0.63 cnf(i_0_61, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c7|multiply(sk_c9,sk_c6)=sk_c7)). % 1.89/0.63 cnf(i_0_43, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c8|multiply(sk_c3,sk_c9)=sk_c8)). % 1.89/0.63 cnf(i_0_57, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c7|multiply(sk_c3,sk_c9)=sk_c8)). % 1.89/0.63 cnf(i_0_45, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c8|multiply(sk_c4,sk_c7)=sk_c8)). % 1.89/0.63 cnf(i_0_59, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c7|multiply(sk_c4,sk_c7)=sk_c8)). % 1.89/0.63 cnf(i_0_48, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c8|multiply(sk_c5,sk_c9)=sk_c6)). % 1.89/0.63 cnf(i_0_62, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c7|multiply(sk_c5,sk_c9)=sk_c6)). % 1.89/0.63 cnf(i_0_64, negated_conjecture, (multiply(sk_c9,multiply(X1,sk_c9))!=sk_c7|multiply(sk_c9,sk_c8)!=sk_c7|multiply(X2,sk_c7)!=sk_c8|multiply(X3,sk_c9)!=sk_c8|multiply(X4,sk_c9)!=sk_c7|multiply(X5,sk_c9)!=sk_c8|inverse(X1)!=sk_c9|inverse(X2)!=sk_c7|inverse(X3)!=sk_c9|inverse(X5)!=sk_c9)). % 1.89/0.63 cnf(i_0_1726, plain, (X7=X7)). % 1.89/0.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.89/0.63 # Begin printing tableau % 1.89/0.63 # Found 6 steps % 1.89/0.63 cnf(i_0_1726, plain, (identity=identity), inference(start_rule)). % 1.89/0.63 cnf(i_0_1801, plain, (identity=identity), inference(extension_rule, [i_0_1730])). % 1.89/0.63 cnf(i_0_1877, plain, (multiply(identity,X5)!=X5), inference(closure_rule, [i_0_33])). % 1.89/0.63 cnf(i_0_1875, plain, (multiply(identity,multiply(identity,X5))=multiply(identity,X5)), inference(extension_rule, [i_0_1729])). % 1.89/0.63 cnf(i_0_1950, plain, (multiply(identity,X5)!=X5), inference(closure_rule, [i_0_33])). % 1.89/0.63 cnf(i_0_1948, plain, (multiply(identity,multiply(identity,X5))=X5), inference(etableau_closure_rule, [i_0_1948, ...])). % 1.89/0.63 # End printing tableau % 1.89/0.63 # SZS output end % 1.89/0.63 # Branches closed with saturation will be marked with an "s" % 1.89/0.63 # Child (2936) has found a proof. % 1.89/0.63 % 1.89/0.63 # Proof search is over... % 1.89/0.63 # Freeing feature tree %------------------------------------------------------------------------------