0.00/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.33 % Computer : n024.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 1200 0.11/0.33 % WCLimit : 120 0.11/0.33 % DateTime : Tue Jul 13 16:02:03 EDT 2021 0.11/0.33 % CPUTime : 0.18/0.36 # No SInE strategy applied 0.18/0.36 # Auto-Mode selected heuristic G_E___100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y 0.18/0.36 # and selection function SelectMaxLComplexAvoidPosPred. 0.18/0.36 # 0.18/0.36 # Presaturation interreduction done 0.18/0.36 # Number of axioms: 21 Number of unprocessed: 21 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 # 21 beginning clauses after preprocessing and clausification 0.18/0.36 # Creating start rules for all 2 conjectures. 0.18/0.36 # There are 2 start rule candidates: 0.18/0.36 # Found 19 unit axioms. 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.18/0.36 # 2 start rule tableaux created. 0.18/0.36 # 2 extension rule candidate clauses 0.18/0.36 # 19 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 2 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 31 new_tableaux and 0 remaining starting tableaux. 0.18/0.36 # We now have 31 tableaux to operate on 8.10/1.45 # There were 1 total branch saturation attempts. 8.10/1.45 # There were 0 of these attempts blocked. 8.10/1.45 # There were 0 deferred branch saturation attempts. 8.10/1.45 # There were 0 free duplicated saturations. 8.10/1.45 # There were 1 total successful branch saturations. 8.10/1.45 # There were 0 successful branch saturations in interreduction. 8.10/1.45 # There were 0 successful branch saturations on the branch. 8.10/1.45 # There were 1 successful branch saturations after the branch. 8.10/1.45 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 8.10/1.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 8.10/1.45 # Begin clausification derivation 8.10/1.45 8.10/1.45 # End clausification derivation 8.10/1.45 # Begin listing active clauses obtained from FOF to CNF conversion 8.10/1.45 cnf(i_0_13, plain, (addition(X1,X1)=X1)). 8.10/1.45 cnf(i_0_1, plain, (multiplication(X1,one)=X1)). 8.10/1.45 cnf(i_0_5, plain, (addition(X1,zero)=X1)). 8.10/1.45 cnf(i_0_4, plain, (multiplication(one,X1)=X1)). 8.10/1.45 cnf(i_0_17, plain, (multiplication(X1,coantidomain(X1))=zero)). 8.10/1.45 cnf(i_0_14, plain, (multiplication(antidomain(X1),X1)=zero)). 8.10/1.45 cnf(i_0_12, plain, (multiplication(zero,X1)=zero)). 8.10/1.45 cnf(i_0_6, plain, (multiplication(X1,zero)=zero)). 8.10/1.45 cnf(i_0_20, plain, (addition(antidomain(X1),antidomain(antidomain(X1)))=one)). 8.10/1.45 cnf(i_0_19, plain, (addition(coantidomain(X1),coantidomain(coantidomain(X1)))=one)). 8.10/1.45 cnf(i_0_11, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). 8.10/1.45 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). 8.10/1.45 cnf(i_0_3, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). 8.10/1.45 cnf(i_0_7, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). 8.10/1.45 cnf(i_0_18, plain, (addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2)))))=antidomain(multiplication(X1,antidomain(antidomain(X2)))))). 8.10/1.45 cnf(i_0_21, plain, (addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))=coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))). 8.10/1.45 cnf(i_0_29, negated_conjecture, (addition(antidomain(antidomain(esk2_0)),antidomain(antidomain(antidomain(coantidomain(coantidomain(multiplication(coantidomain(coantidomain(antidomain(antidomain(antidomain(antidomain(antidomain(esk3_0))))))),esk1_0)))))))=antidomain(antidomain(antidomain(coantidomain(coantidomain(multiplication(coantidomain(coantidomain(antidomain(antidomain(antidomain(antidomain(antidomain(esk3_0))))))),esk1_0)))))))). 8.10/1.45 cnf(i_0_10, plain, (addition(X1,X2)=addition(X2,X1))). 8.10/1.45 cnf(i_0_28, negated_conjecture, (addition(antidomain(antidomain(esk3_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0))))))))!=antidomain(antidomain(esk3_0)))). 8.10/1.45 cnf(i_0_8, plain, (addition(X1,X2)=X2|~leq(X1,X2))). 8.10/1.45 cnf(i_0_9, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). 8.10/1.45 cnf(i_0_44, plain, (X53=X53)). 8.10/1.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 8.10/1.45 # Begin printing tableau 8.10/1.45 # Found 6 steps 8.10/1.45 cnf(i_0_1, plain, (multiplication(antidomain(antidomain(esk3_0)),one)=antidomain(antidomain(esk3_0))), inference(start_rule)). 8.10/1.45 cnf(i_0_54, plain, (multiplication(antidomain(antidomain(esk3_0)),one)=antidomain(antidomain(esk3_0))), inference(extension_rule, [i_0_47])). 8.10/1.45 cnf(i_0_135, plain, (addition(antidomain(antidomain(esk3_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0))))))))=antidomain(antidomain(esk3_0))), inference(closure_rule, [i_0_28])). 8.10/1.45 cnf(i_0_136, plain, (addition(antidomain(antidomain(esk3_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0))))))))!=multiplication(antidomain(antidomain(esk3_0)),one)), inference(extension_rule, [i_0_47])). 8.10/1.45 cnf(i_0_161, plain, (addition(antidomain(antidomain(esk3_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0))))))))!=addition(addition(antidomain(antidomain(esk3_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0)))))))),addition(antidomain(antidomain(esk3_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0)))))))))), inference(closure_rule, [i_0_13])). 8.10/1.45 cnf(i_0_162, plain, (addition(addition(antidomain(antidomain(esk3_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0)))))))),addition(antidomain(antidomain(esk3_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0)))))))))!=multiplication(antidomain(antidomain(esk3_0)),one)), inference(etableau_closure_rule, [i_0_162, ...])). 8.10/1.45 # End printing tableau 8.10/1.45 # SZS output end 8.10/1.45 # Branches closed with saturation will be marked with an "s" 8.10/1.46 # Child (22067) has found a proof. 8.10/1.46 8.10/1.46 # Proof search is over... 8.10/1.46 # Freeing feature tree 8.10/1.48 EOF