%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP167-1 : 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 : n011.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:05:08 EDT 2022 % Result : Unsatisfiable 38.80s 5.25s % Output : CNFRefutation 38.80s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP167-1 : TPTP v8.1.0. Bugfixed v1.2.1. % 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 : n011.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.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jun 13 09:53:03 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic U_____102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 18 Number of unprocessed: 18 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 18 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 1 conjectures. % 0.13/0.36 # There are 1 start rule candidates: % 0.13/0.36 # Found 18 unit axioms. % 0.13/0.36 # 1 start rule tableaux created. % 0.13/0.36 # 0 extension rule candidate clauses % 0.13/0.36 # 18 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.36 # Creating equality axioms % 0.13/0.36 # Ran out of tableaux, making start rules for all clauses % 0.13/0.36 # Returning from population with 26 new_tableaux and 0 remaining starting tableaux. % 0.13/0.36 # We now have 26 tableaux to operate on % 38.80/5.25 # There were 2 total branch saturation attempts. % 38.80/5.25 # There were 0 of these attempts blocked. % 38.80/5.25 # There were 0 deferred branch saturation attempts. % 38.80/5.25 # There were 0 free duplicated saturations. % 38.80/5.25 # There were 1 total successful branch saturations. % 38.80/5.25 # There were 0 successful branch saturations in interreduction. % 38.80/5.25 # There were 0 successful branch saturations on the branch. % 38.80/5.25 # There were 1 successful branch saturations after the branch. % 38.80/5.25 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 38.80/5.25 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 38.80/5.25 # Begin clausification derivation % 38.80/5.25 % 38.80/5.25 # End clausification derivation % 38.80/5.25 # Begin listing active clauses obtained from FOF to CNF conversion % 38.80/5.25 cnf(i_0_21, plain, (multiply(identity,X1)=X1)). % 38.80/5.25 cnf(i_0_29, plain, (greatest_lower_bound(X1,X1)=X1)). % 38.80/5.25 cnf(i_0_28, plain, (least_upper_bound(X1,X1)=X1)). % 38.80/5.25 cnf(i_0_22, plain, (multiply(inverse(X1),X1)=identity)). % 38.80/5.25 cnf(i_0_31, plain, (greatest_lower_bound(X1,least_upper_bound(X1,X2))=X1)). % 38.80/5.25 cnf(i_0_30, plain, (least_upper_bound(X1,greatest_lower_bound(X1,X2))=X1)). % 38.80/5.25 cnf(i_0_26, plain, (greatest_lower_bound(greatest_lower_bound(X1,X2),X3)=greatest_lower_bound(X1,greatest_lower_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_27, plain, (least_upper_bound(least_upper_bound(X1,X2),X3)=least_upper_bound(X1,least_upper_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_23, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 38.80/5.25 cnf(i_0_33, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,greatest_lower_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_32, plain, (least_upper_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,least_upper_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_39, plain, (least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X1,X3))=greatest_lower_bound(X1,least_upper_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_38, plain, (greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,X3))=least_upper_bound(X1,greatest_lower_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_35, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X3,X2))=multiply(greatest_lower_bound(X1,X3),X2))). % 38.80/5.25 cnf(i_0_34, plain, (least_upper_bound(multiply(X1,X2),multiply(X3,X2))=multiply(least_upper_bound(X1,X3),X2))). % 38.80/5.25 cnf(i_0_24, plain, (greatest_lower_bound(X1,X2)=greatest_lower_bound(X2,X1))). % 38.80/5.25 cnf(i_0_25, plain, (least_upper_bound(X1,X2)=least_upper_bound(X2,X1))). % 38.80/5.25 cnf(i_0_40, negated_conjecture, (multiply(least_upper_bound(identity,a),greatest_lower_bound(identity,a))!=a)). % 38.80/5.25 cnf(i_0_42, plain, (X4=X4)). % 38.80/5.25 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 38.80/5.25 # Begin printing tableau % 38.80/5.25 # Found 8 steps % 38.80/5.25 cnf(i_0_21, plain, (multiply(identity,X5)=X5), inference(start_rule)). % 38.80/5.25 cnf(i_0_50, plain, (multiply(identity,X5)=X5), inference(extension_rule, [i_0_48])). % 38.80/5.25 cnf(i_0_82, plain, (multiply(identity,X3)!=X3), inference(closure_rule, [i_0_21])). % 38.80/5.25 cnf(i_0_81, plain, (greatest_lower_bound(multiply(identity,X3),multiply(identity,X5))=greatest_lower_bound(X3,X5)), inference(extension_rule, [i_0_45])). % 38.80/5.25 cnf(i_0_93, plain, (multiply(identity,greatest_lower_bound(X3,X5))!=greatest_lower_bound(X3,X5)), inference(closure_rule, [i_0_21])). % 38.80/5.25 cnf(i_0_91, plain, (greatest_lower_bound(multiply(identity,X3),multiply(identity,X5))=multiply(identity,greatest_lower_bound(X3,X5))), inference(extension_rule, [i_0_46])). % 38.80/5.25 cnf(i_0_258542, plain, (multiply(identity,X6)!=X6), inference(closure_rule, [i_0_21])). % 38.80/5.25 cnf(i_0_258540, plain, (multiply(greatest_lower_bound(multiply(identity,X3),multiply(identity,X5)),multiply(identity,X6))=multiply(multiply(identity,greatest_lower_bound(X3,X5)),X6)), inference(etableau_closure_rule, [i_0_258540, ...])). % 38.80/5.25 # End printing tableau % 38.80/5.25 # SZS output end % 38.80/5.25 # Branches closed with saturation will be marked with an "s" % 38.80/5.25 # There were 2 total branch saturation attempts. % 38.80/5.25 # There were 0 of these attempts blocked. % 38.80/5.25 # There were 0 deferred branch saturation attempts. % 38.80/5.25 # There were 0 free duplicated saturations. % 38.80/5.25 # There were 1 total successful branch saturations. % 38.80/5.25 # There were 0 successful branch saturations in interreduction. % 38.80/5.25 # There were 0 successful branch saturations on the branch. % 38.80/5.25 # There were 1 successful branch saturations after the branch. % 38.80/5.25 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 38.80/5.25 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 38.80/5.25 # Begin clausification derivation % 38.80/5.25 % 38.80/5.25 # End clausification derivation % 38.80/5.25 # Begin listing active clauses obtained from FOF to CNF conversion % 38.80/5.25 cnf(i_0_21, plain, (multiply(identity,X1)=X1)). % 38.80/5.25 cnf(i_0_29, plain, (greatest_lower_bound(X1,X1)=X1)). % 38.80/5.25 cnf(i_0_28, plain, (least_upper_bound(X1,X1)=X1)). % 38.80/5.25 cnf(i_0_22, plain, (multiply(inverse(X1),X1)=identity)). % 38.80/5.25 cnf(i_0_31, plain, (greatest_lower_bound(X1,least_upper_bound(X1,X2))=X1)). % 38.80/5.25 cnf(i_0_30, plain, (least_upper_bound(X1,greatest_lower_bound(X1,X2))=X1)). % 38.80/5.25 cnf(i_0_26, plain, (greatest_lower_bound(greatest_lower_bound(X1,X2),X3)=greatest_lower_bound(X1,greatest_lower_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_27, plain, (least_upper_bound(least_upper_bound(X1,X2),X3)=least_upper_bound(X1,least_upper_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_23, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 38.80/5.25 cnf(i_0_33, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,greatest_lower_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_32, plain, (least_upper_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,least_upper_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_39, plain, (least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X1,X3))=greatest_lower_bound(X1,least_upper_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_38, plain, (greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,X3))=least_upper_bound(X1,greatest_lower_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_35, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X3,X2))=multiply(greatest_lower_bound(X1,X3),X2))). % 38.80/5.25 cnf(i_0_34, plain, (least_upper_bound(multiply(X1,X2),multiply(X3,X2))=multiply(least_upper_bound(X1,X3),X2))). % 38.80/5.25 cnf(i_0_24, plain, (greatest_lower_bound(X1,X2)=greatest_lower_bound(X2,X1))). % 38.80/5.25 cnf(i_0_25, plain, (least_upper_bound(X1,X2)=least_upper_bound(X2,X1))). % 38.80/5.25 cnf(i_0_40, negated_conjecture, (multiply(least_upper_bound(identity,a),greatest_lower_bound(identity,a))!=a)). % 38.80/5.25 cnf(i_0_42, plain, (X4=X4)). % 38.80/5.25 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 38.80/5.25 # Begin printing tableau % 38.80/5.25 # Found 8 steps % 38.80/5.25 cnf(i_0_21, plain, (multiply(identity,X3)=X3), inference(start_rule)). % 38.80/5.25 cnf(i_0_50, plain, (multiply(identity,X3)=X3), inference(extension_rule, [i_0_48])). % 38.80/5.25 cnf(i_0_83, plain, (multiply(identity,X5)!=X5), inference(closure_rule, [i_0_21])). % 38.80/5.25 cnf(i_0_81, plain, (greatest_lower_bound(multiply(identity,X3),multiply(identity,X5))=greatest_lower_bound(X3,X5)), inference(extension_rule, [i_0_45])). % 38.80/5.25 cnf(i_0_93, plain, (multiply(identity,greatest_lower_bound(X3,X5))!=greatest_lower_bound(X3,X5)), inference(closure_rule, [i_0_21])). % 38.80/5.25 cnf(i_0_91, plain, (greatest_lower_bound(multiply(identity,X3),multiply(identity,X5))=multiply(identity,greatest_lower_bound(X3,X5))), inference(extension_rule, [i_0_46])). % 38.80/5.25 cnf(i_0_258542, plain, (multiply(identity,X6)!=X6), inference(closure_rule, [i_0_21])). % 38.80/5.25 cnf(i_0_258540, plain, (multiply(greatest_lower_bound(multiply(identity,X3),multiply(identity,X5)),multiply(identity,X6))=multiply(multiply(identity,greatest_lower_bound(X3,X5)),X6)), inference(etableau_closure_rule, [i_0_258540, ...])). % 38.80/5.25 # End printing tableau % 38.80/5.25 # SZS output end % 38.80/5.25 # Branches closed with saturation will be marked with an "s" % 38.80/5.25 # There were 2 total branch saturation attempts. % 38.80/5.25 # There were 0 of these attempts blocked. % 38.80/5.25 # There were 0 deferred branch saturation attempts. % 38.80/5.25 # There were 0 free duplicated saturations. % 38.80/5.25 # There were 1 total successful branch saturations. % 38.80/5.25 # There were 0 successful branch saturations in interreduction. % 38.80/5.25 # There were 0 successful branch saturations on the branch. % 38.80/5.25 # There were 1 successful branch saturations after the branch. % 38.80/5.25 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 38.80/5.25 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 38.80/5.25 # Begin clausification derivation % 38.80/5.25 % 38.80/5.25 # End clausification derivation % 38.80/5.25 # Begin listing active clauses obtained from FOF to CNF conversion % 38.80/5.25 cnf(i_0_21, plain, (multiply(identity,X1)=X1)). % 38.80/5.25 cnf(i_0_29, plain, (greatest_lower_bound(X1,X1)=X1)). % 38.80/5.25 cnf(i_0_28, plain, (least_upper_bound(X1,X1)=X1)). % 38.80/5.25 cnf(i_0_22, plain, (multiply(inverse(X1),X1)=identity)). % 38.80/5.25 cnf(i_0_31, plain, (greatest_lower_bound(X1,least_upper_bound(X1,X2))=X1)). % 38.80/5.25 cnf(i_0_30, plain, (least_upper_bound(X1,greatest_lower_bound(X1,X2))=X1)). % 38.80/5.25 cnf(i_0_26, plain, (greatest_lower_bound(greatest_lower_bound(X1,X2),X3)=greatest_lower_bound(X1,greatest_lower_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_27, plain, (least_upper_bound(least_upper_bound(X1,X2),X3)=least_upper_bound(X1,least_upper_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_23, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 38.80/5.25 cnf(i_0_33, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,greatest_lower_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_32, plain, (least_upper_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,least_upper_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_39, plain, (least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X1,X3))=greatest_lower_bound(X1,least_upper_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_38, plain, (greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,X3))=least_upper_bound(X1,greatest_lower_bound(X2,X3)))). % 38.80/5.25 cnf(i_0_35, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X3,X2))=multiply(greatest_lower_bound(X1,X3),X2))). % 38.80/5.25 cnf(i_0_34, plain, (least_upper_bound(multiply(X1,X2),multiply(X3,X2))=multiply(least_upper_bound(X1,X3),X2))). % 38.80/5.25 cnf(i_0_24, plain, (greatest_lower_bound(X1,X2)=greatest_lower_bound(X2,X1))). % 38.80/5.25 cnf(i_0_25, plain, (least_upper_bound(X1,X2)=least_upper_bound(X2,X1))). % 38.80/5.25 cnf(i_0_40, negated_conjecture, (multiply(least_upper_bound(identity,a),greatest_lower_bound(identity,a))!=a)). % 38.80/5.25 cnf(i_0_42, plain, (X4=X4)). % 38.80/5.25 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 38.80/5.25 # Begin printing tableau % 38.80/5.25 # Found 8 steps % 38.80/5.25 cnf(i_0_21, plain, (multiply(identity,X5)=X5), inference(start_rule)). % 38.80/5.25 cnf(i_0_50, plain, (multiply(identity,X5)=X5), inference(extension_rule, [i_0_49])). % 38.80/5.25 cnf(i_0_85, plain, (multiply(identity,X3)!=X3), inference(closure_rule, [i_0_21])). % 38.80/5.25 cnf(i_0_84, plain, (least_upper_bound(multiply(identity,X3),multiply(identity,X5))=least_upper_bound(X3,X5)), inference(extension_rule, [i_0_45])). % 38.80/5.25 cnf(i_0_93, plain, (multiply(identity,least_upper_bound(X3,X5))!=least_upper_bound(X3,X5)), inference(closure_rule, [i_0_21])). % 38.80/5.25 cnf(i_0_91, plain, (least_upper_bound(multiply(identity,X3),multiply(identity,X5))=multiply(identity,least_upper_bound(X3,X5))), inference(extension_rule, [i_0_46])). % 38.80/5.25 cnf(i_0_258542, plain, (multiply(identity,X6)!=X6), inference(closure_rule, [i_0_21])). % 38.80/5.25 cnf(i_0_258540, plain, (multiply(least_upper_bound(multiply(identity,X3),multiply(identity,X5)),multiply(identity,X6))=multiply(multiply(identity,least_upper_bound(X3,X5)),X6)), inference(etableau_closure_rule, [i_0_258540, ...])). % 38.80/5.25 # End printing tableau % 38.80/5.25 # SZS output end % 38.80/5.25 # Branches closed with saturation will be marked with an "s" % 38.80/5.26 # Child (6431) has found a proof. % 38.80/5.26 % 38.80/5.26 # Proof search is over... % 38.80/5.26 # Freeing feature tree %------------------------------------------------------------------------------