%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP498-1 : TPTP v8.1.0. Released v2.6.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:06:44 EDT 2022 % Result : Unsatisfiable 0.14s 0.40s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : GRP498-1 : TPTP v8.1.0. Released v2.6.0. % 0.08/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.36 % Computer : n024.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Mon Jun 13 15:10:03 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S % 0.14/0.39 # and selection function SelectNewComplexAHP. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 5 Number of unprocessed: 5 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 5 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 1 conjectures. % 0.14/0.39 # There are 1 start rule candidates: % 0.14/0.39 # Found 5 unit axioms. % 0.14/0.39 # 1 start rule tableaux created. % 0.14/0.39 # 0 extension rule candidate clauses % 0.14/0.39 # 5 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.39 # Creating equality axioms % 0.14/0.39 # Ran out of tableaux, making start rules for all clauses % 0.14/0.39 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 12 tableaux to operate on % 0.14/0.40 # There were 1 total branch saturation attempts. % 0.14/0.40 # There were 0 of these attempts blocked. % 0.14/0.40 # There were 0 deferred branch saturation attempts. % 0.14/0.40 # There were 0 free duplicated saturations. % 0.14/0.40 # There were 1 total successful branch saturations. % 0.14/0.40 # There were 0 successful branch saturations in interreduction. % 0.14/0.40 # There were 0 successful branch saturations on the branch. % 0.14/0.40 # There were 1 successful branch saturations after the branch. % 0.14/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.40 # Begin clausification derivation % 0.14/0.40 % 0.14/0.40 # End clausification derivation % 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.40 cnf(i_0_8, plain, (double_divide(X1,identity)=inverse(X1))). % 0.14/0.40 cnf(i_0_9, plain, (double_divide(X1,inverse(X1))=identity)). % 0.14/0.40 cnf(i_0_7, plain, (inverse(double_divide(X1,X2))=multiply(X2,X1))). % 0.14/0.40 cnf(i_0_6, plain, (double_divide(double_divide(identity,double_divide(X1,inverse(X2))),multiply(double_divide(X3,X1),X2))=X3)). % 0.14/0.40 cnf(i_0_10, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)))). % 0.14/0.40 cnf(i_0_12, plain, (X4=X4)). % 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.40 # Begin printing tableau % 0.14/0.40 # Found 6 steps % 0.14/0.40 cnf(i_0_8, plain, (double_divide(X6,identity)=inverse(X6)), inference(start_rule)). % 0.14/0.40 cnf(i_0_19, plain, (double_divide(X6,identity)=inverse(X6)), inference(extension_rule, [i_0_16])). % 0.14/0.40 cnf(i_0_34, plain, (double_divide(inverse(X6),identity)!=inverse(inverse(X6))), inference(closure_rule, [i_0_8])). % 0.14/0.40 cnf(i_0_32, plain, (double_divide(double_divide(X6,identity),double_divide(inverse(X6),identity))=double_divide(inverse(X6),inverse(inverse(X6)))), inference(extension_rule, [i_0_15])). % 0.14/0.40 cnf(i_0_46, plain, (double_divide(inverse(X6),inverse(inverse(X6)))!=identity), inference(closure_rule, [i_0_9])). % 0.14/0.40 cnf(i_0_44, plain, (double_divide(double_divide(X6,identity),double_divide(inverse(X6),identity))=identity), inference(etableau_closure_rule, [i_0_44, ...])). % 0.14/0.40 # End printing tableau % 0.14/0.40 # SZS output end % 0.14/0.40 # Branches closed with saturation will be marked with an "s" % 0.21/0.40 # Child (10990) has found a proof. % 0.21/0.40 % 0.21/0.40 # There were 1 total branch saturation attempts. % 0.21/0.40 # There were 0 of these attempts blocked. % 0.21/0.40 # There were 0 deferred branch saturation attempts. % 0.21/0.40 # There were 0 free duplicated saturations. % 0.21/0.40 # There were 1 total successful branch saturations. % 0.21/0.40 # There were 0 successful branch saturations in interreduction. % 0.21/0.40 # There were 0 successful branch saturations on the branch. % 0.21/0.40 # There were 1 successful branch saturations after the branch. % 0.21/0.40 # Proof search is over... % 0.21/0.40 # Freeing feature tree %------------------------------------------------------------------------------