%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP184-3 : 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 : n009.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:19 EDT 2022 % Result : Unsatisfiable 17.71s 2.61s % Output : CNFRefutation 17.71s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : GRP184-3 : TPTP v8.1.0. Bugfixed v1.2.1. % 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.12/0.33 % Computer : n009.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jun 13 17:57:23 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S % 0.18/0.36 # and selection function SelectNewComplexAHP. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 16 Number of unprocessed: 16 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 16 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 1 conjectures. % 0.18/0.36 # There are 1 start rule candidates: % 0.18/0.36 # Found 16 unit axioms. % 0.18/0.36 # 1 start rule tableaux created. % 0.18/0.36 # 0 extension rule candidate clauses % 0.18/0.36 # 16 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.18/0.36 # Creating equality axioms % 0.18/0.36 # Ran out of tableaux, making start rules for all clauses % 0.18/0.36 # Returning from population with 24 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 24 tableaux to operate on % 17.71/2.61 # There were 1 total branch saturation attempts. % 17.71/2.61 # There were 0 of these attempts blocked. % 17.71/2.61 # There were 0 deferred branch saturation attempts. % 17.71/2.61 # There were 0 free duplicated saturations. % 17.71/2.61 # There were 1 total successful branch saturations. % 17.71/2.61 # There were 0 successful branch saturations in interreduction. % 17.71/2.61 # There were 0 successful branch saturations on the branch. % 17.71/2.61 # There were 1 successful branch saturations after the branch. % 17.71/2.61 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 17.71/2.61 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 17.71/2.61 # Begin clausification derivation % 17.71/2.61 % 17.71/2.61 # End clausification derivation % 17.71/2.61 # Begin listing active clauses obtained from FOF to CNF conversion % 17.71/2.61 cnf(i_0_17, plain, (multiply(identity,X1)=X1)). % 17.71/2.61 cnf(i_0_25, plain, (greatest_lower_bound(X1,X1)=X1)). % 17.71/2.61 cnf(i_0_24, plain, (least_upper_bound(X1,X1)=X1)). % 17.71/2.61 cnf(i_0_18, plain, (multiply(inverse(X1),X1)=identity)). % 17.71/2.61 cnf(i_0_27, plain, (greatest_lower_bound(X1,least_upper_bound(X1,X2))=X1)). % 17.71/2.61 cnf(i_0_26, plain, (least_upper_bound(X1,greatest_lower_bound(X1,X2))=X1)). % 17.71/2.61 cnf(i_0_22, plain, (greatest_lower_bound(greatest_lower_bound(X1,X2),X3)=greatest_lower_bound(X1,greatest_lower_bound(X2,X3)))). % 17.71/2.61 cnf(i_0_23, plain, (least_upper_bound(least_upper_bound(X1,X2),X3)=least_upper_bound(X1,least_upper_bound(X2,X3)))). % 17.71/2.61 cnf(i_0_19, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 17.71/2.61 cnf(i_0_29, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,greatest_lower_bound(X2,X3)))). % 17.71/2.61 cnf(i_0_28, plain, (least_upper_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,least_upper_bound(X2,X3)))). % 17.71/2.61 cnf(i_0_31, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X3,X2))=multiply(greatest_lower_bound(X1,X3),X2))). % 17.71/2.61 cnf(i_0_30, plain, (least_upper_bound(multiply(X1,X2),multiply(X3,X2))=multiply(least_upper_bound(X1,X3),X2))). % 17.71/2.61 cnf(i_0_20, plain, (greatest_lower_bound(X1,X2)=greatest_lower_bound(X2,X1))). % 17.71/2.61 cnf(i_0_21, plain, (least_upper_bound(X1,X2)=least_upper_bound(X2,X1))). % 17.71/2.61 cnf(i_0_32, negated_conjecture, (multiply(inverse(greatest_lower_bound(identity,a)),least_upper_bound(identity,a))!=multiply(least_upper_bound(identity,a),inverse(greatest_lower_bound(identity,a))))). % 17.71/2.61 cnf(i_0_34, plain, (X4=X4)). % 17.71/2.61 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 17.71/2.61 # Begin printing tableau % 17.71/2.61 # Found 5 steps % 17.71/2.61 cnf(i_0_17, plain, (multiply(identity,X3)=X3), inference(start_rule)). % 17.71/2.61 cnf(i_0_42, plain, (multiply(identity,X3)=X3), inference(extension_rule, [i_0_39])). % 17.71/2.61 cnf(i_0_69, plain, (inverse(multiply(identity,X3))=inverse(X3)), inference(extension_rule, [i_0_37])). % 17.71/2.61 cnf(i_0_83, plain, (inverse(X3)!=multiply(identity,inverse(X3))), inference(closure_rule, [i_0_17])). % 17.71/2.61 cnf(i_0_81, plain, (inverse(multiply(identity,X3))=multiply(identity,inverse(X3))), inference(etableau_closure_rule, [i_0_81, ...])). % 17.71/2.61 # End printing tableau % 17.71/2.61 # SZS output end % 17.71/2.61 # Branches closed with saturation will be marked with an "s" % 17.71/2.62 # There were 1 total branch saturation attempts. % 17.71/2.62 # There were 0 of these attempts blocked. % 17.71/2.62 # There were 0 deferred branch saturation attempts. % 17.71/2.62 # There were 0 free duplicated saturations. % 17.71/2.62 # There were 1 total successful branch saturations. % 17.71/2.62 # There were 0 successful branch saturations in interreduction. % 17.71/2.62 # There were 0 successful branch saturations on the branch. % 17.71/2.62 # There were 1 successful branch saturations after the branch. % 17.71/2.62 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 17.71/2.62 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 17.71/2.62 # Begin clausification derivation % 17.71/2.62 % 17.71/2.62 # End clausification derivation % 17.71/2.62 # Begin listing active clauses obtained from FOF to CNF conversion % 17.71/2.62 cnf(i_0_17, plain, (multiply(identity,X1)=X1)). % 17.71/2.62 cnf(i_0_25, plain, (greatest_lower_bound(X1,X1)=X1)). % 17.71/2.62 cnf(i_0_24, plain, (least_upper_bound(X1,X1)=X1)). % 17.71/2.62 cnf(i_0_18, plain, (multiply(inverse(X1),X1)=identity)). % 17.71/2.62 cnf(i_0_27, plain, (greatest_lower_bound(X1,least_upper_bound(X1,X2))=X1)). % 17.71/2.62 cnf(i_0_26, plain, (least_upper_bound(X1,greatest_lower_bound(X1,X2))=X1)). % 17.71/2.62 cnf(i_0_22, plain, (greatest_lower_bound(greatest_lower_bound(X1,X2),X3)=greatest_lower_bound(X1,greatest_lower_bound(X2,X3)))). % 17.71/2.62 cnf(i_0_23, plain, (least_upper_bound(least_upper_bound(X1,X2),X3)=least_upper_bound(X1,least_upper_bound(X2,X3)))). % 17.71/2.62 cnf(i_0_19, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 17.71/2.62 cnf(i_0_29, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,greatest_lower_bound(X2,X3)))). % 17.71/2.62 cnf(i_0_28, plain, (least_upper_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,least_upper_bound(X2,X3)))). % 17.71/2.62 cnf(i_0_31, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X3,X2))=multiply(greatest_lower_bound(X1,X3),X2))). % 17.71/2.62 cnf(i_0_30, plain, (least_upper_bound(multiply(X1,X2),multiply(X3,X2))=multiply(least_upper_bound(X1,X3),X2))). % 17.71/2.62 cnf(i_0_20, plain, (greatest_lower_bound(X1,X2)=greatest_lower_bound(X2,X1))). % 17.71/2.62 cnf(i_0_21, plain, (least_upper_bound(X1,X2)=least_upper_bound(X2,X1))). % 17.71/2.62 cnf(i_0_32, negated_conjecture, (multiply(inverse(greatest_lower_bound(identity,a)),least_upper_bound(identity,a))!=multiply(least_upper_bound(identity,a),inverse(greatest_lower_bound(identity,a))))). % 17.71/2.62 cnf(i_0_34, plain, (X4=X4)). % 17.71/2.62 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 17.71/2.62 # Begin printing tableau % 17.71/2.62 # Found 6 steps % 17.71/2.62 cnf(i_0_17, plain, (multiply(identity,X5)=X5), inference(start_rule)). % 17.71/2.62 cnf(i_0_42, plain, (multiply(identity,X5)=X5), inference(extension_rule, [i_0_40])). % 17.71/2.62 cnf(i_0_72, plain, (multiply(identity,X3)!=X3), inference(closure_rule, [i_0_17])). % 17.71/2.62 cnf(i_0_71, plain, (greatest_lower_bound(multiply(identity,X3),multiply(identity,X5))=greatest_lower_bound(X3,X5)), inference(extension_rule, [i_0_37])). % 17.71/2.62 cnf(i_0_83, plain, (greatest_lower_bound(X3,X5)!=multiply(identity,greatest_lower_bound(X3,X5))), inference(closure_rule, [i_0_17])). % 17.71/2.62 cnf(i_0_81, plain, (greatest_lower_bound(multiply(identity,X3),multiply(identity,X5))=multiply(identity,greatest_lower_bound(X3,X5))), inference(etableau_closure_rule, [i_0_81, ...])). % 17.71/2.62 # End printing tableau % 17.71/2.62 # SZS output end % 17.71/2.62 # Branches closed with saturation will be marked with an "s" % 17.71/2.63 # Child (22110) has found a proof. % 17.71/2.63 % 17.71/2.63 # Proof search is over... % 17.71/2.63 # Freeing feature tree %------------------------------------------------------------------------------