0.11/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.11/0.32 % Computer : n014.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.17/0.32 % CPULimit : 1200 0.17/0.32 % WCLimit : 120 0.17/0.32 % DateTime : Tue Jul 13 11:09:49 EDT 2021 0.17/0.33 % CPUTime : 0.18/0.35 # No SInE strategy applied 0.18/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.18/0.35 # and selection function SelectComplexExceptUniqMaxHorn. 0.18/0.35 # 0.18/0.35 # Presaturation interreduction done 0.18/0.35 # Number of axioms: 20 Number of unprocessed: 20 0.18/0.35 # Tableaux proof search. 0.18/0.35 # APR header successfully linked. 0.18/0.35 # Hello from C++ 0.18/0.35 # The folding up rule is enabled... 0.18/0.35 # Local unification is enabled... 0.18/0.35 # Any saturation attempts will use folding labels... 0.18/0.35 # 20 beginning clauses after preprocessing and clausification 0.18/0.35 # Creating start rules for all 1 conjectures. 0.18/0.35 # There are 1 start rule candidates: 0.18/0.35 # Found 20 unit axioms. 0.18/0.35 # 1 start rule tableaux created. 0.18/0.35 # 0 extension rule candidate clauses 0.18/0.35 # 20 unit axiom clauses 0.18/0.35 0.18/0.35 # Requested 8, 32 cores available to the main process. 0.18/0.35 # There are not enough tableaux to fork, creating more from the initial 1 0.18/0.35 # Creating equality axioms 0.18/0.35 # Ran out of tableaux, making start rules for all clauses 0.18/0.35 # Returning from population with 29 new_tableaux and 0 remaining starting tableaux. 0.18/0.35 # We now have 29 tableaux to operate on 576.39/73.15 # There were 18 total branch saturation attempts. 576.39/73.15 # There were 0 of these attempts blocked. 576.39/73.15 # There were 0 deferred branch saturation attempts. 576.39/73.15 # There were 0 free duplicated saturations. 576.39/73.15 # There were 1 total successful branch saturations. 576.39/73.15 # There were 0 successful branch saturations in interreduction. 576.39/73.15 # There were 0 successful branch saturations on the branch. 576.39/73.15 # There were 1 successful branch saturations after the branch. 576.39/73.15 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p 576.39/73.15 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 576.39/73.15 # Begin clausification derivation 576.39/73.15 576.39/73.15 # End clausification derivation 576.39/73.15 # Begin listing active clauses obtained from FOF to CNF conversion 576.39/73.15 cnf(i_0_39, hypothesis, (greatest_lower_bound(a,b)=identity)). 576.39/73.15 cnf(i_0_36, hypothesis, (least_upper_bound(identity,c)=c)). 576.39/73.15 cnf(i_0_37, hypothesis, (least_upper_bound(identity,b)=b)). 576.39/73.15 cnf(i_0_38, hypothesis, (least_upper_bound(identity,a)=a)). 576.39/73.15 cnf(i_0_22, plain, (multiply(identity,X1)=X1)). 576.39/73.15 cnf(i_0_26, plain, (greatest_lower_bound(X1,X1)=X1)). 576.39/73.15 cnf(i_0_29, plain, (least_upper_bound(X1,X1)=X1)). 576.39/73.15 cnf(i_0_23, plain, (multiply(inverse(X1),X1)=identity)). 576.39/73.15 cnf(i_0_34, plain, (least_upper_bound(X1,greatest_lower_bound(X1,X2))=X1)). 576.39/73.15 cnf(i_0_27, plain, (greatest_lower_bound(X1,least_upper_bound(X1,X2))=X1)). 576.39/73.15 cnf(i_0_25, plain, (greatest_lower_bound(greatest_lower_bound(X1,X2),X3)=greatest_lower_bound(X1,greatest_lower_bound(X2,X3)))). 576.39/73.15 cnf(i_0_21, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). 576.39/73.15 cnf(i_0_30, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X3,X2))=multiply(greatest_lower_bound(X1,X3),X2))). 576.39/73.15 cnf(i_0_32, plain, (least_upper_bound(least_upper_bound(X1,X2),X3)=least_upper_bound(X1,least_upper_bound(X2,X3)))). 576.39/73.15 cnf(i_0_33, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,greatest_lower_bound(X2,X3)))). 576.39/73.15 cnf(i_0_28, plain, (least_upper_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,least_upper_bound(X2,X3)))). 576.39/73.15 cnf(i_0_24, plain, (least_upper_bound(multiply(X1,X2),multiply(X3,X2))=multiply(least_upper_bound(X1,X3),X2))). 576.39/73.15 cnf(i_0_35, plain, (greatest_lower_bound(X1,X2)=greatest_lower_bound(X2,X1))). 576.39/73.15 cnf(i_0_31, plain, (least_upper_bound(X1,X2)=least_upper_bound(X2,X1))). 576.39/73.15 cnf(i_0_40, negated_conjecture, (greatest_lower_bound(a,multiply(b,c))!=greatest_lower_bound(a,c))). 576.39/73.15 cnf(i_0_42, plain, (X4=X4)). 576.39/73.15 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 576.39/73.15 # Begin printing tableau 576.39/73.15 # Found 5 steps 576.39/73.15 cnf(i_0_39, hypothesis, (greatest_lower_bound(a,b)=identity), inference(start_rule)). 576.39/73.15 cnf(i_0_50, plain, (greatest_lower_bound(a,b)=identity), inference(extension_rule, [i_0_47])). 576.39/73.15 cnf(i_0_81, plain, (inverse(greatest_lower_bound(a,b))=inverse(identity)), inference(extension_rule, [i_0_46])). 576.39/73.15 cnf(i_0_4285545, plain, (greatest_lower_bound(a,b)!=identity), inference(closure_rule, [i_0_39])). 576.39/73.15 cnf(i_0_4285543, plain, (multiply(inverse(greatest_lower_bound(a,b)),greatest_lower_bound(a,b))=multiply(inverse(identity),identity)), inference(etableau_closure_rule, [i_0_4285543, ...])). 576.39/73.15 # End printing tableau 576.39/73.15 # SZS output end 576.39/73.15 # Branches closed with saturation will be marked with an "s" 576.39/73.18 # Child (12944) has found a proof. 576.39/73.18 576.39/73.18 # Proof search is over... 576.39/73.18 # Freeing feature tree 576.39/73.24 EOF