%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP002-2 : TPTP v8.1.0. Bugfixed v1.2.1. % 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 : n025.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:03:51 EDT 2022 % Result : Unsatisfiable 0.14s 0.39s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : GRP002-2 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.11/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.35 % Computer : n025.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Mon Jun 13 07:04:23 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: 12 Number of unprocessed: 12 % 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 # 12 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 6 conjectures. % 0.14/0.38 # There are 6 start rule candidates: % 0.14/0.38 # Found 12 unit axioms. % 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.38 # 6 start rule tableaux created. % 0.14/0.38 # 0 extension rule candidate clauses % 0.14/0.38 # 12 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 6 % 0.14/0.38 # Creating equality axioms % 0.14/0.38 # Ran out of tableaux, making start rules for all clauses % 0.14/0.38 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux. % 0.14/0.38 # We now have 17 tableaux to operate on % 0.14/0.39 # There were 1 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 1 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 1 successful branch saturations after the branch. % 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_19, negated_conjecture, (multiply(a,b)=c)). % 0.14/0.39 cnf(i_0_22, negated_conjecture, (multiply(h,b)=j)). % 0.14/0.39 cnf(i_0_20, negated_conjecture, (multiply(c,inverse(a))=d)). % 0.14/0.39 cnf(i_0_21, negated_conjecture, (multiply(d,inverse(b))=h)). % 0.14/0.39 cnf(i_0_16, plain, (multiply(X1,identity)=X1)). % 0.14/0.39 cnf(i_0_23, negated_conjecture, (multiply(j,inverse(h))=k)). % 0.14/0.39 cnf(i_0_13, plain, (multiply(identity,X1)=X1)). % 0.14/0.39 cnf(i_0_17, plain, (multiply(X1,inverse(X1))=identity)). % 0.14/0.39 cnf(i_0_14, plain, (multiply(inverse(X1),X1)=identity)). % 0.14/0.39 cnf(i_0_18, hypothesis, (multiply(X1,multiply(X1,X1))=identity)). % 0.14/0.39 cnf(i_0_15, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 0.14/0.39 cnf(i_0_24, negated_conjecture, (multiply(k,inverse(b))!=identity)). % 0.14/0.39 cnf(i_0_31, plain, (X4=X4)). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 6 steps % 0.14/0.39 cnf(i_0_21, negated_conjecture, (multiply(d,inverse(b))=h), inference(start_rule)). % 0.14/0.39 cnf(i_0_40, plain, (multiply(d,inverse(b))=h), inference(extension_rule, [i_0_34])). % 0.14/0.39 cnf(i_0_68, plain, (multiply(d,inverse(b))!=h), inference(closure_rule, [i_0_21])). % 0.14/0.39 cnf(i_0_66, plain, (multiply(d,inverse(b))=multiply(d,inverse(b))), inference(extension_rule, [i_0_35])). % 0.14/0.39 cnf(i_0_75, plain, (multiply(a,b)!=c), inference(closure_rule, [i_0_19])). % 0.14/0.39 cnf(i_0_73, plain, (multiply(multiply(d,inverse(b)),multiply(a,b))=multiply(multiply(d,inverse(b)),c)), inference(etableau_closure_rule, [i_0_73, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # Child (20007) has found a proof. % 0.14/0.39 % 0.14/0.39 # Proof search is over... % 0.14/0.39 # Freeing feature tree %------------------------------------------------------------------------------