%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP002-4 : TPTP v8.1.0. Released v1.0.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:03:52 EDT 2022 % Result : Unsatisfiable 0.15s 0.40s % Output : CNFRefutation 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : GRP002-4 : TPTP v8.1.0. Released v1.0.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.10/0.32 % Computer : n022.cluster.edu % 0.10/0.32 % Model : x86_64 x86_64 % 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.32 % Memory : 8042.1875MB % 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.32 % CPULimit : 300 % 0.10/0.32 % WCLimit : 600 % 0.10/0.32 % DateTime : Mon Jun 13 16:28:03 EDT 2022 % 0.10/0.32 % CPUTime : % 0.10/0.35 # No SInE strategy applied % 0.10/0.35 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S % 0.10/0.35 # and selection function SelectNewComplexAHP. % 0.10/0.35 # % 0.10/0.35 # Presaturation interreduction done % 0.10/0.35 # Number of axioms: 8 Number of unprocessed: 8 % 0.10/0.35 # Tableaux proof search. % 0.10/0.35 # APR header successfully linked. % 0.10/0.35 # Hello from C++ % 0.10/0.35 # The folding up rule is enabled... % 0.10/0.35 # Local unification is enabled... % 0.10/0.35 # Any saturation attempts will use folding labels... % 0.10/0.35 # 8 beginning clauses after preprocessing and clausification % 0.10/0.35 # Creating start rules for all 1 conjectures. % 0.10/0.35 # There are 1 start rule candidates: % 0.10/0.35 # Found 8 unit axioms. % 0.10/0.35 # 1 start rule tableaux created. % 0.10/0.35 # 0 extension rule candidate clauses % 0.10/0.35 # 8 unit axiom clauses % 0.10/0.35 % 0.10/0.35 # Requested 8, 32 cores available to the main process. % 0.10/0.35 # There are not enough tableaux to fork, creating more from the initial 1 % 0.10/0.35 # Creating equality axioms % 0.10/0.35 # Ran out of tableaux, making start rules for all clauses % 0.10/0.35 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.10/0.35 # We now have 14 tableaux to operate on % 0.15/0.40 # There were 1 total branch saturation attempts. % 0.15/0.40 # There were 0 of these attempts blocked. % 0.15/0.40 # There were 0 deferred branch saturation attempts. % 0.15/0.40 # There were 0 free duplicated saturations. % 0.15/0.40 # There were 1 total successful branch saturations. % 0.15/0.40 # There were 0 successful branch saturations in interreduction. % 0.15/0.40 # There were 0 successful branch saturations on the branch. % 0.15/0.40 # There were 1 successful branch saturations after the branch. % 0.15/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.40 # Begin clausification derivation % 0.15/0.40 % 0.15/0.40 # End clausification derivation % 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.40 cnf(i_0_12, plain, (multiply(X1,identity)=X1)). % 0.15/0.40 cnf(i_0_9, plain, (multiply(identity,X1)=X1)). % 0.15/0.40 cnf(i_0_13, plain, (multiply(X1,inverse(X1))=identity)). % 0.15/0.40 cnf(i_0_10, plain, (multiply(inverse(X1),X1)=identity)). % 0.15/0.40 cnf(i_0_15, hypothesis, (multiply(X1,multiply(X1,X1))=identity)). % 0.15/0.40 cnf(i_0_11, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 0.15/0.40 cnf(i_0_14, plain, (multiply(X1,multiply(X2,multiply(inverse(X1),inverse(X2))))=commutator(X1,X2))). % 0.15/0.40 cnf(i_0_16, negated_conjecture, (commutator(commutator(a,b),b)!=identity)). % 0.15/0.40 cnf(i_0_18, plain, (X4=X4)). % 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.40 # Begin printing tableau % 0.15/0.40 # Found 6 steps % 0.15/0.40 cnf(i_0_12, plain, (multiply(identity,identity)=identity), inference(start_rule)). % 0.15/0.40 cnf(i_0_25, plain, (multiply(identity,identity)=identity), inference(extension_rule, [i_0_22])). % 0.15/0.40 cnf(i_0_42, plain, (multiply(X7,identity)!=X7), inference(closure_rule, [i_0_12])). % 0.15/0.40 cnf(i_0_41, plain, (multiply(multiply(X7,identity),multiply(identity,identity))=multiply(X7,identity)), inference(extension_rule, [i_0_21])). % 0.15/0.40 cnf(i_0_55, plain, (multiply(X7,identity)!=X7), inference(closure_rule, [i_0_12])). % 0.15/0.40 cnf(i_0_53, plain, (multiply(multiply(X7,identity),multiply(identity,identity))=X7), inference(etableau_closure_rule, [i_0_53, ...])). % 0.15/0.40 # End printing tableau % 0.15/0.40 # SZS output end % 0.15/0.40 # Branches closed with saturation will be marked with an "s" % 0.15/0.40 # Child (25486) has found a proof. % 0.15/0.40 % 0.15/0.40 # Proof search is over... % 0.15/0.40 # Freeing feature tree %------------------------------------------------------------------------------