0.03/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 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.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:44:18 EDT 2021 0.11/0.33 % CPUTime : 0.11/0.36 # No SInE strategy applied 0.11/0.36 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S 0.11/0.36 # and selection function SelectNewComplexAHP. 0.11/0.36 # 0.11/0.36 # Presaturation interreduction done 0.11/0.36 # Number of axioms: 18 Number of unprocessed: 18 0.11/0.36 # Tableaux proof search. 0.11/0.36 # APR header successfully linked. 0.11/0.36 # Hello from C++ 0.11/0.36 # The folding up rule is enabled... 0.11/0.36 # Local unification is enabled... 0.11/0.36 # Any saturation attempts will use folding labels... 0.11/0.36 # 18 beginning clauses after preprocessing and clausification 0.11/0.36 # Creating start rules for all 2 conjectures. 0.11/0.36 # There are 2 start rule candidates: 0.11/0.36 # Found 18 unit axioms. 0.11/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.11/0.36 # 2 start rule tableaux created. 0.11/0.36 # 0 extension rule candidate clauses 0.11/0.36 # 18 unit axiom clauses 0.11/0.36 0.11/0.36 # Requested 8, 32 cores available to the main process. 0.11/0.36 # There are not enough tableaux to fork, creating more from the initial 2 0.11/0.36 # Creating equality axioms 0.11/0.36 # Ran out of tableaux, making start rules for all clauses 0.11/0.36 # Returning from population with 27 new_tableaux and 0 remaining starting tableaux. 0.11/0.36 # We now have 27 tableaux to operate on 13.04/2.01 # There were 1 total branch saturation attempts. 13.04/2.01 # There were 0 of these attempts blocked. 13.04/2.01 # There were 0 deferred branch saturation attempts. 13.04/2.01 # There were 0 free duplicated saturations. 13.04/2.01 # There were 1 total successful branch saturations. 13.04/2.01 # There were 0 successful branch saturations in interreduction. 13.04/2.01 # There were 0 successful branch saturations on the branch. 13.04/2.01 # There were 1 successful branch saturations after the branch. 13.04/2.01 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 13.04/2.01 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 13.04/2.01 # Begin clausification derivation 13.04/2.01 13.04/2.01 # End clausification derivation 13.04/2.01 # Begin listing active clauses obtained from FOF to CNF conversion 13.04/2.01 cnf(i_0_1, plain, (converse(converse(X1))=X1)). 13.04/2.01 cnf(i_0_5, plain, (composition(X1,one)=X1)). 13.04/2.01 cnf(i_0_3, plain, (join(X1,complement(X1))=top)). 13.04/2.01 cnf(i_0_2, plain, (meet(X1,X2)=complement(join(complement(X1),complement(X2))))). 13.04/2.01 cnf(i_0_6, plain, (complement(top)=zero)). 13.04/2.01 cnf(i_0_13, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))). 13.04/2.01 cnf(i_0_10, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). 13.04/2.01 cnf(i_0_4, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))). 13.04/2.01 cnf(i_0_8, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))). 13.04/2.01 cnf(i_0_9, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))). 13.04/2.01 cnf(i_0_18, negated_conjecture, (join(complement(esk3_0),composition(complement(esk1_0),esk2_0))=complement(esk3_0))). 13.04/2.01 cnf(i_0_11, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))). 13.04/2.01 cnf(i_0_7, plain, (join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1)). 13.04/2.01 cnf(i_0_16, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))))))=complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))))))). 13.04/2.01 cnf(i_0_15, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(X3),complement(composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),X2)))))=complement(join(complement(X3),complement(composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),X2)))))). 13.04/2.01 cnf(i_0_14, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))))=composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))))). 13.04/2.01 cnf(i_0_12, plain, (join(X1,X2)=join(X2,X1))). 13.04/2.01 cnf(i_0_17, negated_conjecture, (join(esk1_0,composition(esk3_0,converse(esk2_0)))!=esk1_0)). 13.04/2.01 cnf(i_0_21, plain, (X41=X41)). 13.04/2.01 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 13.04/2.01 # Begin printing tableau 13.04/2.01 # Found 6 steps 13.04/2.01 cnf(i_0_1, plain, (converse(converse(X3))=X3), inference(start_rule)). 13.04/2.01 cnf(i_0_30, plain, (converse(converse(X3))=X3), inference(extension_rule, [i_0_28])). 13.04/2.01 cnf(i_0_65, plain, (converse(converse(X5))!=X5), inference(closure_rule, [i_0_1])). 13.04/2.01 cnf(i_0_63, plain, (join(converse(converse(X3)),converse(converse(X5)))=join(X3,X5)), inference(extension_rule, [i_0_24])). 13.04/2.01 cnf(i_0_75, plain, (join(X3,X5)!=converse(converse(join(X3,X5)))), inference(closure_rule, [i_0_1])). 13.04/2.01 cnf(i_0_73, plain, (join(converse(converse(X3)),converse(converse(X5)))=converse(converse(join(X3,X5)))), inference(etableau_closure_rule, [i_0_73, ...])). 13.04/2.01 # End printing tableau 13.04/2.01 # SZS output end 13.04/2.01 # Branches closed with saturation will be marked with an "s" 13.04/2.02 # There were 1 total branch saturation attempts. 13.04/2.02 # There were 0 of these attempts blocked. 13.04/2.02 # There were 0 deferred branch saturation attempts. 13.04/2.02 # There were 0 free duplicated saturations. 13.04/2.02 # There were 1 total successful branch saturations. 13.04/2.02 # There were 0 successful branch saturations in interreduction. 13.04/2.02 # There were 0 successful branch saturations on the branch. 13.04/2.02 # There were 1 successful branch saturations after the branch. 13.04/2.02 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 13.04/2.02 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 13.04/2.02 # Begin clausification derivation 13.04/2.02 13.04/2.02 # End clausification derivation 13.04/2.02 # Begin listing active clauses obtained from FOF to CNF conversion 13.04/2.02 cnf(i_0_1, plain, (converse(converse(X1))=X1)). 13.04/2.02 cnf(i_0_5, plain, (composition(X1,one)=X1)). 13.04/2.02 cnf(i_0_3, plain, (join(X1,complement(X1))=top)). 13.04/2.02 cnf(i_0_2, plain, (meet(X1,X2)=complement(join(complement(X1),complement(X2))))). 13.04/2.02 cnf(i_0_6, plain, (complement(top)=zero)). 13.04/2.02 cnf(i_0_13, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))). 13.04/2.02 cnf(i_0_10, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). 13.04/2.02 cnf(i_0_4, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))). 13.04/2.02 cnf(i_0_8, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))). 13.04/2.02 cnf(i_0_9, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))). 13.04/2.02 cnf(i_0_18, negated_conjecture, (join(complement(esk3_0),composition(complement(esk1_0),esk2_0))=complement(esk3_0))). 13.04/2.02 cnf(i_0_11, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))). 13.04/2.02 cnf(i_0_7, plain, (join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1)). 13.04/2.02 cnf(i_0_16, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))))))=complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))))))). 13.04/2.02 cnf(i_0_15, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(X3),complement(composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),X2)))))=complement(join(complement(X3),complement(composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),X2)))))). 13.04/2.02 cnf(i_0_14, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))))=composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))))). 13.04/2.02 cnf(i_0_12, plain, (join(X1,X2)=join(X2,X1))). 13.04/2.02 cnf(i_0_17, negated_conjecture, (join(esk1_0,composition(esk3_0,converse(esk2_0)))!=esk1_0)). 13.04/2.02 cnf(i_0_21, plain, (X41=X41)). 13.04/2.02 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 13.04/2.02 # Begin printing tableau 13.04/2.02 # Found 6 steps 13.04/2.02 cnf(i_0_1, plain, (converse(converse(X5))=X5), inference(start_rule)). 13.04/2.02 cnf(i_0_30, plain, (converse(converse(X5))=X5), inference(extension_rule, [i_0_26])). 13.04/2.02 cnf(i_0_59, plain, (converse(converse(X3))!=X3), inference(closure_rule, [i_0_1])). 13.04/2.02 cnf(i_0_58, plain, (meet(converse(converse(X3)),converse(converse(X5)))=meet(X3,X5)), inference(extension_rule, [i_0_24])). 13.04/2.02 cnf(i_0_75, plain, (meet(X3,X5)!=converse(converse(meet(X3,X5)))), inference(closure_rule, [i_0_1])). 13.04/2.02 cnf(i_0_73, plain, (meet(converse(converse(X3)),converse(converse(X5)))=converse(converse(meet(X3,X5)))), inference(etableau_closure_rule, [i_0_73, ...])). 13.04/2.02 # End printing tableau 13.04/2.02 # SZS output end 13.04/2.02 # Branches closed with saturation will be marked with an "s" 13.04/2.02 # Child (31169) has found a proof. 13.04/2.02 13.04/2.02 # Proof search is over... 13.04/2.02 # Freeing feature tree 13.04/2.05 EOF