%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP770-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 : n004.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:23 EDT 2022 % Result : Unsatisfiable 59.61s 7.90s % Output : CNFRefutation 59.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : GRP770-1 : TPTP v8.1.0. Released v4.1.0. % 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.35 % Computer : n004.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % 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 20:02:09 EDT 2022 % 0.13/0.35 % CPUTime : % 0.21/0.38 # No SInE strategy applied % 0.21/0.38 # Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y % 0.21/0.38 # and selection function SelectMaxLComplexAvoidPosPred. % 0.21/0.38 # % 0.21/0.38 # Presaturation interreduction done % 0.21/0.38 # Number of axioms: 21 Number of unprocessed: 21 % 0.21/0.38 # Tableaux proof search. % 0.21/0.38 # APR header successfully linked. % 0.21/0.38 # Hello from C++ % 0.21/0.38 # The folding up rule is enabled... % 0.21/0.38 # Local unification is enabled... % 0.21/0.38 # Any saturation attempts will use folding labels... % 0.21/0.38 # 21 beginning clauses after preprocessing and clausification % 0.21/0.38 # Creating start rules for all 1 conjectures. % 0.21/0.38 # There are 1 start rule candidates: % 0.21/0.38 # Found 21 unit axioms. % 0.21/0.38 # 1 start rule tableaux created. % 0.21/0.38 # 0 extension rule candidate clauses % 0.21/0.38 # 21 unit axiom clauses % 0.21/0.38 % 0.21/0.38 # Requested 8, 32 cores available to the main process. % 0.21/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.21/0.38 # Creating equality axioms % 0.21/0.38 # Ran out of tableaux, making start rules for all clauses % 0.21/0.38 # Returning from population with 28 new_tableaux and 0 remaining starting tableaux. % 0.21/0.38 # We now have 28 tableaux to operate on % 59.61/7.90 # There were 1 total branch saturation attempts. % 59.61/7.90 # There were 0 of these attempts blocked. % 59.61/7.90 # There were 0 deferred branch saturation attempts. % 59.61/7.90 # There were 0 free duplicated saturations. % 59.61/7.90 # There were 1 total successful branch saturations. % 59.61/7.90 # There were 0 successful branch saturations in interreduction. % 59.61/7.90 # There were 0 successful branch saturations on the branch. % 59.61/7.90 # There were 1 successful branch saturations after the branch. % 59.61/7.90 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 59.61/7.90 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 59.61/7.90 # Begin clausification derivation % 59.61/7.90 % 59.61/7.90 # End clausification derivation % 59.61/7.90 # Begin listing active clauses obtained from FOF to CNF conversion % 59.61/7.90 cnf(i_0_26, plain, (product(X1,one)=X1)). % 59.61/7.90 cnf(i_0_27, plain, (product(one,X1)=X1)). % 59.61/7.90 cnf(i_0_28, plain, (product(X1,difference(X1,X2))=X2)). % 59.61/7.90 cnf(i_0_29, plain, (difference(X1,product(X1,X2))=X2)). % 59.61/7.90 cnf(i_0_31, plain, (product(quotient(X1,X2),X2)=X1)). % 59.61/7.90 cnf(i_0_30, plain, (quotient(product(X1,X2),X2)=X1)). % 59.61/7.90 cnf(i_0_36, plain, (product(difference(X1,one),X1)=product(X1,quotient(one,X1)))). % 59.61/7.90 cnf(i_0_48, plain, (product(X1,difference(product(X2,X1),one))=difference(X2,one))). % 59.61/7.90 cnf(i_0_49, plain, (product(quotient(one,product(X1,X2)),X1)=quotient(one,X2))). % 59.61/7.90 cnf(i_0_42, plain, (product(quotient(one,X1),difference(X1,one))=quotient(quotient(one,X1),X1))). % 59.61/7.90 cnf(i_0_32, plain, (difference(X1,product(product(X1,X2),X3))=quotient(product(X2,product(X3,X1)),X1))). % 59.61/7.90 cnf(i_0_33, plain, (quotient(quotient(product(X1,product(X2,X3)),X3),X2)=difference(product(X2,X3),product(X2,product(X3,X1))))). % 59.61/7.90 cnf(i_0_43, plain, (product(product(product(quotient(quotient(one,X1),X1),product(X1,X1)),X2),X3)=product(product(quotient(quotient(one,X1),X1),product(X1,X1)),product(X2,X3)))). % 59.61/7.90 cnf(i_0_47, plain, (product(quotient(one,quotient(one,X1)),quotient(one,product(X2,X1)))=quotient(one,X2))). % 59.61/7.90 cnf(i_0_46, plain, (product(difference(product(X1,X2),one),difference(difference(X1,one),one))=difference(X2,one))). % 59.61/7.90 cnf(i_0_40, plain, (product(product(X1,X2),product(X1,quotient(one,X1)))=product(X1,product(X2,product(X1,quotient(one,X1)))))). % 59.61/7.90 cnf(i_0_41, plain, (product(product(product(X1,quotient(one,X1)),X2),X3)=product(product(X1,quotient(one,X1)),product(X2,X3)))). % 59.61/7.90 cnf(i_0_45, plain, (product(quotient(product(product(X1,quotient(one,X1)),X2),product(X1,quotient(one,X1))),quotient(product(product(X1,quotient(one,X1)),X3),product(X1,quotient(one,X1))))=quotient(product(product(X1,quotient(one,X1)),product(X2,X3)),product(X1,quotient(one,X1))))). % 59.61/7.90 cnf(i_0_39, plain, (product(X1,product(product(X1,quotient(one,X1)),X2))=product(quotient(one,quotient(one,X1)),X2))). % 59.61/7.90 cnf(i_0_38, plain, (product(difference(difference(X1,one),one),X2)=product(product(X1,quotient(one,X1)),product(X1,X2)))). % 59.61/7.90 cnf(i_0_50, negated_conjecture, (product(quotient(product(x0,x1),x0),product(x0,x2))!=product(x0,product(x1,x2)))). % 59.61/7.90 cnf(i_0_52, plain, (X4=X4)). % 59.61/7.90 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 59.61/7.90 # Begin printing tableau % 59.61/7.90 # Found 6 steps % 59.61/7.90 cnf(i_0_26, plain, (product(one,one)=one), inference(start_rule)). % 59.61/7.90 cnf(i_0_59, plain, (product(one,one)=one), inference(extension_rule, [i_0_56])). % 59.61/7.90 cnf(i_0_89, plain, (product(X7,one)!=X7), inference(closure_rule, [i_0_26])). % 59.61/7.90 cnf(i_0_88, plain, (product(product(X7,one),product(one,one))=product(X7,one)), inference(extension_rule, [i_0_55])). % 59.61/7.90 cnf(i_0_103, plain, (product(X7,one)!=X7), inference(closure_rule, [i_0_26])). % 59.61/7.90 cnf(i_0_101, plain, (product(product(X7,one),product(one,one))=X7), inference(etableau_closure_rule, [i_0_101, ...])). % 59.61/7.90 # End printing tableau % 59.61/7.90 # SZS output end % 59.61/7.90 # Branches closed with saturation will be marked with an "s" % 59.61/7.92 # Child (24968) has found a proof. % 59.61/7.92 % 59.61/7.92 # Proof search is over... % 59.61/7.92 # Freeing feature tree %------------------------------------------------------------------------------