%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP344-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:06:04 EDT 2022 % Result : Unsatisfiable 0.13s 0.39s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.05/0.09 % Problem : GRP344-1 : TPTP v8.1.0. Released v2.5.0. % 0.05/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.28 % Computer : n015.cluster.edu % 0.09/0.28 % Model : x86_64 x86_64 % 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.28 % Memory : 8042.1875MB % 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.28 % CPULimit : 300 % 0.09/0.28 % WCLimit : 600 % 0.09/0.28 % DateTime : Mon Jun 13 04:45:37 EDT 2022 % 0.09/0.29 % CPUTime : % 0.13/0.31 # No SInE strategy applied % 0.13/0.31 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.31 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.31 # % 0.13/0.31 # Presaturation interreduction done % 0.13/0.31 # Number of axioms: 21 Number of unprocessed: 21 % 0.13/0.31 # Tableaux proof search. % 0.13/0.31 # APR header successfully linked. % 0.13/0.31 # Hello from C++ % 0.13/0.31 # The folding up rule is enabled... % 0.13/0.31 # Local unification is enabled... % 0.13/0.31 # Any saturation attempts will use folding labels... % 0.13/0.31 # 21 beginning clauses after preprocessing and clausification % 0.13/0.31 # Creating start rules for all 18 conjectures. % 0.13/0.31 # There are 18 start rule candidates: % 0.13/0.31 # Found 4 unit axioms. % 0.13/0.31 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.31 # 18 start rule tableaux created. % 0.13/0.31 # 17 extension rule candidate clauses % 0.13/0.31 # 4 unit axiom clauses % 0.13/0.31 % 0.13/0.31 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There were 8 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 8 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 8 successful branch saturations after the branch. % 0.13/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_25, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c5)). % 0.13/0.39 cnf(i_0_22, plain, (multiply(identity,X1)=X1)). % 0.13/0.39 cnf(i_0_23, plain, (multiply(inverse(X1),X1)=identity)). % 0.13/0.39 cnf(i_0_24, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 0.13/0.39 cnf(i_0_27, negated_conjecture, (inverse(sk_c3)=sk_c6|inverse(sk_c1)=sk_c7)). % 0.13/0.39 cnf(i_0_28, negated_conjecture, (inverse(sk_c4)=sk_c5|inverse(sk_c1)=sk_c7)). % 0.13/0.39 cnf(i_0_35, negated_conjecture, (inverse(sk_c2)=sk_c6|inverse(sk_c3)=sk_c6)). % 0.13/0.39 cnf(i_0_36, negated_conjecture, (inverse(sk_c2)=sk_c6|inverse(sk_c4)=sk_c5)). % 0.13/0.39 cnf(i_0_26, negated_conjecture, (multiply(sk_c3,sk_c6)=sk_c7|inverse(sk_c1)=sk_c7)). % 0.13/0.39 cnf(i_0_29, negated_conjecture, (multiply(sk_c4,sk_c6)=sk_c5|inverse(sk_c1)=sk_c7)). % 0.13/0.39 cnf(i_0_31, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c7|inverse(sk_c3)=sk_c6)). % 0.13/0.39 cnf(i_0_39, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|inverse(sk_c3)=sk_c6)). % 0.13/0.39 cnf(i_0_32, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c7|inverse(sk_c4)=sk_c5)). % 0.13/0.39 cnf(i_0_40, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|inverse(sk_c4)=sk_c5)). % 0.13/0.39 cnf(i_0_34, negated_conjecture, (multiply(sk_c3,sk_c6)=sk_c7|inverse(sk_c2)=sk_c6)). % 0.13/0.39 cnf(i_0_37, negated_conjecture, (multiply(sk_c4,sk_c6)=sk_c5|inverse(sk_c2)=sk_c6)). % 0.13/0.39 cnf(i_0_30, negated_conjecture, (multiply(sk_c3,sk_c6)=sk_c7|multiply(sk_c1,sk_c6)=sk_c7)). % 0.13/0.39 cnf(i_0_33, negated_conjecture, (multiply(sk_c4,sk_c6)=sk_c5|multiply(sk_c1,sk_c6)=sk_c7)). % 0.13/0.39 cnf(i_0_38, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|multiply(sk_c3,sk_c6)=sk_c7)). % 0.13/0.39 cnf(i_0_41, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|multiply(sk_c4,sk_c6)=sk_c5)). % 0.13/0.39 cnf(i_0_42, negated_conjecture, (multiply(X1,sk_c6)!=sk_c5|multiply(X2,sk_c6)!=sk_c7|multiply(X3,sk_c5)!=sk_c6|multiply(X4,sk_c6)!=sk_c7|inverse(X1)!=sk_c5|inverse(X2)!=sk_c6|inverse(X3)!=sk_c6|inverse(X4)!=sk_c7)). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 13 steps % 0.13/0.39 cnf(i_0_38, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|multiply(sk_c3,sk_c6)=sk_c7), inference(start_rule)). % 0.13/0.39 cnf(i_0_53, plain, (multiply(sk_c2,sk_c5)=sk_c6), inference(extension_rule, [i_0_42])). % 0.13/0.39 cnf(i_0_84, plain, (multiply(sk_c4,sk_c6)!=sk_c5), inference(extension_rule, [i_0_33])). % 0.13/0.39 cnf(i_0_54, plain, (multiply(sk_c3,sk_c6)=sk_c7), inference(etableau_closure_rule, [i_0_54, ...])). % 0.13/0.39 cnf(i_0_88, plain, (inverse(sk_c4)!=sk_c5), inference(etableau_closure_rule, [i_0_88, ...])). % 0.13/0.39 cnf(i_0_90, plain, (inverse(sk_c2)!=sk_c6), inference(etableau_closure_rule, [i_0_90, ...])). % 0.13/0.39 cnf(i_0_97, plain, (multiply(sk_c1,sk_c6)=sk_c7), inference(etableau_closure_rule, [i_0_97, ...])). % 0.13/0.39 cnf(i_0_85, plain, (multiply(sk_c3,sk_c6)!=sk_c7), inference(extension_rule, [i_0_30])). % 0.13/0.39 cnf(i_0_89, plain, (inverse(sk_c3)!=sk_c6), inference(etableau_closure_rule, [i_0_89, ...])). % 0.13/0.39 cnf(i_0_1671, plain, (multiply(sk_c1,sk_c6)=sk_c7), inference(etableau_closure_rule, [i_0_1671, ...])). % 0.13/0.39 cnf(i_0_87, plain, (multiply(sk_c3,sk_c6)!=sk_c7), inference(extension_rule, [i_0_26])). % 0.13/0.39 cnf(i_0_91, plain, (inverse(sk_c3)!=sk_c7), inference(etableau_closure_rule, [i_0_91, ...])). % 0.13/0.39 cnf(i_0_1885, plain, (inverse(sk_c1)=sk_c7), inference(etableau_closure_rule, [i_0_1885, ...])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # Child (31348) has found a proof. % 0.13/0.39 % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------