%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP777+1 : TPTP v8.1.0. Released v4.1.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:08:25 EDT 2022 % Result : Theorem 2.11s 0.67s % Output : CNFRefutation 2.11s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP777+1 : TPTP v8.1.0. Released v4.1.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n015.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Mon Jun 13 08:15:07 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.13/0.38 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Number of axioms: 9 Number of unprocessed: 9 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 9 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 1 conjectures. % 0.13/0.38 # There are 1 start rule candidates: % 0.13/0.38 # Found 9 unit axioms. % 0.13/0.38 # 1 start rule tableaux created. % 0.13/0.38 # 0 extension rule candidate clauses % 0.13/0.38 # 9 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 16 tableaux to operate on % 2.11/0.67 # There were 1 total branch saturation attempts. % 2.11/0.67 # There were 0 of these attempts blocked. % 2.11/0.67 # There were 0 deferred branch saturation attempts. % 2.11/0.67 # There were 0 free duplicated saturations. % 2.11/0.67 # There were 1 total successful branch saturations. % 2.11/0.67 # There were 0 successful branch saturations in interreduction. % 2.11/0.67 # There were 0 successful branch saturations on the branch. % 2.11/0.67 # There were 1 successful branch saturations after the branch. % 2.11/0.67 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.11/0.67 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.11/0.67 # Begin clausification derivation % 2.11/0.67 % 2.11/0.67 # End clausification derivation % 2.11/0.67 # Begin listing active clauses obtained from FOF to CNF conversion % 2.11/0.67 cnf(i_0_6, plain, (product(X1,X1)=X1)). % 2.11/0.67 cnf(i_0_2, plain, (product(X1,difference(X1,X2))=X2)). % 2.11/0.67 cnf(i_0_1, plain, (difference(X1,product(X1,X2))=X2)). % 2.11/0.67 cnf(i_0_4, plain, (product(quotient(X1,X2),X2)=X1)). % 2.11/0.67 cnf(i_0_3, plain, (quotient(product(X1,X2),X2)=X1)). % 2.11/0.67 cnf(i_0_9, plain, (product(product(a,c),product(c,b))=product(a,b))). % 2.11/0.67 cnf(i_0_5, plain, (product(product(X1,X2),product(X3,X4))=product(product(X1,X3),product(X2,X4)))). % 2.11/0.67 cnf(i_0_10, negated_conjecture, (product(product(a,b),product(esk1_0,a))!=product(product(c,c),product(esk1_0,c)))). % 2.11/0.67 cnf(i_0_7, plain, (product(product(product(X1,X2),X2),product(X2,product(X2,X1)))=X2)). % 2.11/0.67 cnf(i_0_12, plain, (X25=X25)). % 2.11/0.67 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.11/0.67 # Begin printing tableau % 2.11/0.67 # Found 6 steps % 2.11/0.67 cnf(i_0_6, plain, (product(X4,X4)=X4), inference(start_rule)). % 2.11/0.67 cnf(i_0_19, plain, (product(X4,X4)=X4), inference(extension_rule, [i_0_16])). % 2.11/0.67 cnf(i_0_37, plain, (product(X4,X4)!=X4), inference(closure_rule, [i_0_6])). % 2.11/0.67 cnf(i_0_36, plain, (product(product(X4,X4),product(X4,X4))=product(X4,X4)), inference(extension_rule, [i_0_15])). % 2.11/0.67 cnf(i_0_51, plain, (product(X4,X4)!=X4), inference(closure_rule, [i_0_6])). % 2.11/0.67 cnf(i_0_49, plain, (product(product(X4,X4),product(X4,X4))=X4), inference(etableau_closure_rule, [i_0_49, ...])). % 2.11/0.67 # End printing tableau % 2.11/0.67 # SZS output end % 2.11/0.67 # Branches closed with saturation will be marked with an "s" % 2.11/0.68 # Child (14504) has found a proof. % 2.11/0.68 % 2.11/0.68 # Proof search is over... % 2.11/0.68 # Freeing feature tree %------------------------------------------------------------------------------