0.03/0.12 % 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.12/0.34 % Computer : n021.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 1200 0.12/0.34 % WCLimit : 120 0.12/0.34 % DateTime : Tue Jul 13 11:06:25 EDT 2021 0.12/0.34 % CPUTime : 0.19/0.37 # No SInE strategy applied 0.19/0.37 # Auto-Mode selected heuristic G_E___209_C18_F1_AE_CS_SP_PI_S0Y 0.19/0.37 # and selection function SelectMaxLComplexAvoidPosPred. 0.19/0.37 # 0.19/0.37 # Number of axioms: 2 Number of unprocessed: 2 0.19/0.37 # Tableaux proof search. 0.19/0.37 # APR header successfully linked. 0.19/0.37 # Hello from C++ 0.19/0.37 # The folding up rule is enabled... 0.19/0.37 # Local unification is enabled... 0.19/0.37 # Any saturation attempts will use folding labels... 0.19/0.37 # 2 beginning clauses after preprocessing and clausification 0.19/0.37 # Creating start rules for all 1 conjectures. 0.19/0.37 # There are 1 start rule candidates: 0.19/0.37 # Found 2 unit axioms. 0.19/0.37 # 1 start rule tableaux created. 0.19/0.37 # 0 extension rule candidate clauses 0.19/0.37 # 2 unit axiom clauses 0.19/0.37 0.19/0.37 # Requested 8, 32 cores available to the main process. 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 1 0.19/0.37 # Creating equality axioms 0.19/0.37 # Ran out of tableaux, making start rules for all clauses 0.19/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. 0.19/0.37 # We now have 8 tableaux to operate on 0.19/0.48 # There were 1 total branch saturation attempts. 0.19/0.48 # There were 0 of these attempts blocked. 0.19/0.48 # There were 0 deferred branch saturation attempts. 0.19/0.48 # There were 0 free duplicated saturations. 0.19/0.48 # There were 1 total successful branch saturations. 0.19/0.48 # There were 0 successful branch saturations in interreduction. 0.19/0.48 # There were 0 successful branch saturations on the branch. 0.19/0.48 # There were 1 successful branch saturations after the branch. 0.19/0.48 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.48 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.48 # Begin clausification derivation 0.19/0.48 0.19/0.48 # End clausification derivation 0.19/0.48 # Begin listing active clauses obtained from FOF to CNF conversion 0.19/0.48 cnf(i_0_4, negated_conjecture, (join(a,meet(a,b))!=a)). 0.19/0.48 cnf(i_0_3, plain, (join(meet(join(meet(X2,X1),meet(X1,join(X2,X1))),X3),meet(join(meet(X2,join(join(meet(X4,X1),meet(X1,X5)),X1)),meet(join(meet(X1,meet(meet(join(X4,join(X1,X5)),join(X6,X1)),X1)),meet(X7,join(X1,meet(meet(join(X4,join(X1,X5)),join(X6,X1)),X1)))),join(X2,join(join(meet(X4,X1),meet(X1,X5)),X1)))),join(join(meet(X2,X1),meet(X1,join(X2,X1))),X3)))=X1)). 0.19/0.48 cnf(i_0_6, plain, (X8=X8)). 0.19/0.48 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.19/0.48 # Begin printing tableau 0.19/0.48 # Found 6 steps 0.19/0.48 cnf(i_0_6, plain, (X6=X6), inference(start_rule)). 0.19/0.48 cnf(i_0_14, plain, (X6=X6), inference(extension_rule, [i_0_10])). 0.19/0.48 cnf(i_0_115, plain, ($false), inference(closure_rule, [i_0_6])). 0.19/0.48 cnf(i_0_113, plain, (meet(X6,X7)=meet(X6,X7)), inference(extension_rule, [i_0_11])). 0.19/0.48 cnf(i_0_166, plain, ($false), inference(closure_rule, [i_0_6])). 0.19/0.48 cnf(i_0_164, plain, (join(meet(X6,X7),X6)=join(meet(X6,X7),X6)), inference(etableau_closure_rule, [i_0_164, ...])). 0.19/0.48 # End printing tableau 0.19/0.48 # SZS output end 0.19/0.48 # Branches closed with saturation will be marked with an "s" 0.19/0.48 # Child (1070) has found a proof. 0.19/0.48 0.19/0.48 # Proof search is over... 0.19/0.48 # Freeing feature tree 0.19/0.48 EOF