%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP237-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 : n022.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:35 EDT 2022 % Result : Unsatisfiable 278.23s 35.30s % Output : CNFRefutation 278.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.10 % Problem : GRP237-1 : TPTP v8.1.0. Released v2.5.0. % 0.09/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.10/0.31 % Computer : n022.cluster.edu % 0.10/0.31 % Model : x86_64 x86_64 % 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.31 % Memory : 8042.1875MB % 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.31 % CPULimit : 300 % 0.10/0.31 % WCLimit : 600 % 0.10/0.31 % DateTime : Tue Jun 14 13:01:03 EDT 2022 % 0.10/0.31 % CPUTime : % 0.16/0.34 # No SInE strategy applied % 0.16/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.16/0.34 # and selection function SelectComplexExceptUniqMaxHorn. % 0.16/0.34 # % 0.16/0.34 # Presaturation interreduction done % 0.16/0.34 # Number of axioms: 40 Number of unprocessed: 40 % 0.16/0.34 # Tableaux proof search. % 0.16/0.34 # APR header successfully linked. % 0.16/0.34 # Hello from C++ % 0.16/0.34 # The folding up rule is enabled... % 0.16/0.34 # Local unification is enabled... % 0.16/0.34 # Any saturation attempts will use folding labels... % 0.16/0.34 # 40 beginning clauses after preprocessing and clausification % 0.16/0.34 # Creating start rules for all 37 conjectures. % 0.16/0.34 # There are 37 start rule candidates: % 0.16/0.34 # Found 3 unit axioms. % 0.16/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.16/0.34 # 37 start rule tableaux created. % 0.16/0.34 # 37 extension rule candidate clauses % 0.16/0.34 # 3 unit axiom clauses % 0.16/0.34 % 0.16/0.34 # Requested 8, 32 cores available to the main process. % 5.31/1.03 # Creating equality axioms % 5.31/1.03 # Ran out of tableaux, making start rules for all clauses % 5.31/1.03 # Creating equality axioms % 5.31/1.03 # Ran out of tableaux, making start rules for all clauses % 5.31/1.03 # Creating equality axioms % 5.31/1.03 # Ran out of tableaux, making start rules for all clauses % 5.31/1.04 # Creating equality axioms % 5.31/1.04 # Ran out of tableaux, making start rules for all clauses % 5.31/1.04 # Creating equality axioms % 5.31/1.04 # Ran out of tableaux, making start rules for all clauses % 5.31/1.05 # Creating equality axioms % 5.31/1.05 # Ran out of tableaux, making start rules for all clauses % 5.31/1.05 # Creating equality axioms % 5.31/1.05 # Ran out of tableaux, making start rules for all clauses % 5.82/1.08 # Creating equality axioms % 5.82/1.08 # Ran out of tableaux, making start rules for all clauses % 278.23/35.30 # There were 50 total branch saturation attempts. % 278.23/35.30 # There were 0 of these attempts blocked. % 278.23/35.30 # There were 0 deferred branch saturation attempts. % 278.23/35.30 # There were 1 free duplicated saturations. % 278.23/35.30 # There were 10 total successful branch saturations. % 278.23/35.30 # There were 0 successful branch saturations in interreduction. % 278.23/35.30 # There were 0 successful branch saturations on the branch. % 278.23/35.30 # There were 9 successful branch saturations after the branch. % 278.23/35.30 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 278.23/35.30 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 278.23/35.30 # Begin clausification derivation % 278.23/35.30 % 278.23/35.30 # End clausification derivation % 278.23/35.30 # Begin listing active clauses obtained from FOF to CNF conversion % 278.23/35.30 cnf(i_0_41, plain, (multiply(identity,X1)=X1)). % 278.23/35.30 cnf(i_0_42, plain, (multiply(inverse(X1),X1)=identity)). % 278.23/35.30 cnf(i_0_43, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 278.23/35.30 cnf(i_0_45, negated_conjecture, (inverse(sk_c4)=sk_c5|inverse(sk_c9)=sk_c8)). % 278.23/35.30 cnf(i_0_49, negated_conjecture, (inverse(sk_c6)=sk_c9|inverse(sk_c9)=sk_c8)). % 278.23/35.30 cnf(i_0_51, negated_conjecture, (inverse(sk_c1)=sk_c9|inverse(sk_c4)=sk_c5)). % 278.23/35.30 cnf(i_0_75, negated_conjecture, (inverse(sk_c2)=sk_c9|inverse(sk_c4)=sk_c5)). % 278.23/35.30 cnf(i_0_55, negated_conjecture, (inverse(sk_c1)=sk_c9|inverse(sk_c6)=sk_c9)). % 278.23/35.30 cnf(i_0_79, negated_conjecture, (inverse(sk_c2)=sk_c9|inverse(sk_c6)=sk_c9)). % 278.23/35.30 cnf(i_0_47, negated_conjecture, (multiply(sk_c9,sk_c7)=sk_c8|inverse(sk_c9)=sk_c8)). % 278.23/35.30 cnf(i_0_44, negated_conjecture, (multiply(sk_c4,sk_c5)=sk_c9|inverse(sk_c9)=sk_c8)). % 278.23/35.30 cnf(i_0_46, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c9|inverse(sk_c9)=sk_c8)). % 278.23/35.30 cnf(i_0_48, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c7|inverse(sk_c9)=sk_c8)). % 278.23/35.30 cnf(i_0_63, negated_conjecture, (multiply(sk_c9,sk_c3)=sk_c8|inverse(sk_c4)=sk_c5)). % 278.23/35.30 cnf(i_0_57, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|inverse(sk_c4)=sk_c5)). % 278.23/35.30 cnf(i_0_69, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|inverse(sk_c4)=sk_c5)). % 278.23/35.30 cnf(i_0_67, negated_conjecture, (multiply(sk_c9,sk_c3)=sk_c8|inverse(sk_c6)=sk_c9)). % 278.23/35.30 cnf(i_0_61, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|inverse(sk_c6)=sk_c9)). % 278.23/35.30 cnf(i_0_73, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|inverse(sk_c6)=sk_c9)). % 278.23/35.30 cnf(i_0_53, negated_conjecture, (multiply(sk_c9,sk_c7)=sk_c8|inverse(sk_c1)=sk_c9)). % 278.23/35.30 cnf(i_0_50, negated_conjecture, (multiply(sk_c4,sk_c5)=sk_c9|inverse(sk_c1)=sk_c9)). % 278.23/35.30 cnf(i_0_52, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c9|inverse(sk_c1)=sk_c9)). % 278.23/35.30 cnf(i_0_54, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c7|inverse(sk_c1)=sk_c9)). % 278.23/35.30 cnf(i_0_77, negated_conjecture, (multiply(sk_c9,sk_c7)=sk_c8|inverse(sk_c2)=sk_c9)). % 278.23/35.30 cnf(i_0_74, negated_conjecture, (multiply(sk_c4,sk_c5)=sk_c9|inverse(sk_c2)=sk_c9)). % 278.23/35.30 cnf(i_0_76, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c9|inverse(sk_c2)=sk_c9)). % 278.23/35.30 cnf(i_0_78, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c7|inverse(sk_c2)=sk_c9)). % 278.23/35.30 cnf(i_0_65, negated_conjecture, (multiply(sk_c9,sk_c3)=sk_c8|multiply(sk_c9,sk_c7)=sk_c8)). % 278.23/35.30 cnf(i_0_59, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|multiply(sk_c9,sk_c7)=sk_c8)). % 278.23/35.30 cnf(i_0_71, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|multiply(sk_c9,sk_c7)=sk_c8)). % 278.23/35.30 cnf(i_0_62, negated_conjecture, (multiply(sk_c4,sk_c5)=sk_c9|multiply(sk_c9,sk_c3)=sk_c8)). % 278.23/35.30 cnf(i_0_64, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c9|multiply(sk_c9,sk_c3)=sk_c8)). % 278.23/35.30 cnf(i_0_66, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c7|multiply(sk_c9,sk_c3)=sk_c8)). % 278.23/35.30 cnf(i_0_56, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|multiply(sk_c4,sk_c5)=sk_c9)). % 278.23/35.30 cnf(i_0_68, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|multiply(sk_c4,sk_c5)=sk_c9)). % 278.23/35.30 cnf(i_0_58, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|multiply(sk_c5,sk_c8)=sk_c9)). % 278.23/35.30 cnf(i_0_70, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|multiply(sk_c5,sk_c8)=sk_c9)). % 278.23/35.30 cnf(i_0_60, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|multiply(sk_c6,sk_c9)=sk_c7)). % 278.23/35.30 cnf(i_0_72, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|multiply(sk_c6,sk_c9)=sk_c7)). % 278.23/35.30 cnf(i_0_80, negated_conjecture, (multiply(sk_c9,multiply(X1,sk_c9))!=sk_c8|multiply(sk_c9,multiply(X2,sk_c9))!=sk_c8|multiply(inverse(X3),sk_c8)!=sk_c9|multiply(X3,inverse(X3))!=sk_c9|multiply(X4,sk_c8)!=sk_c9|inverse(sk_c9)!=sk_c8|inverse(X1)!=sk_c9|inverse(X2)!=sk_c9|inverse(X4)!=sk_c9)). % 278.23/35.30 cnf(i_0_1551, plain, (X8=X8)). % 278.23/35.30 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 278.23/35.30 # Begin printing tableau % 278.23/35.30 # Found 6 steps % 278.23/35.30 cnf(i_0_1551, plain, (sk_c2=sk_c2), inference(start_rule)). % 278.23/35.30 cnf(i_0_1641, plain, (sk_c2=sk_c2), inference(extension_rule, [i_0_1556])). % 278.23/35.30 cnf(i_0_1650252, plain, (inverse(sk_c2)=inverse(sk_c2)), inference(extension_rule, [i_0_1554])). % 278.23/35.30 cnf(i_0_2632026, plain, (inverse(sk_c2)!=sk_c9), inference(extension_rule, [i_0_78])). % 278.23/35.30 cnf(i_0_2632025, plain, (inverse(sk_c2)=sk_c9), inference(etableau_closure_rule, [i_0_2632025, ...])). % 278.23/35.30 cnf(i_0_2632205, plain, (multiply(sk_c6,sk_c9)=sk_c7), inference(etableau_closure_rule, [i_0_2632205, ...])). % 278.23/35.30 # End printing tableau % 278.23/35.30 # SZS output end % 278.23/35.30 # Branches closed with saturation will be marked with an "s" % 278.23/35.31 # Child (19162) has found a proof. % 278.23/35.31 % 278.23/35.31 # Proof search is over... % 278.23/35.31 # Freeing feature tree %------------------------------------------------------------------------------