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.32 % Computer : n027.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.11/0.32 % CPULimit : 1200 0.11/0.32 % WCLimit : 120 0.11/0.32 % DateTime : Tue Jul 13 11:21:10 EDT 2021 0.11/0.32 % CPUTime : 0.11/0.35 # No SInE strategy applied 0.11/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S04AN 0.11/0.35 # and selection function SelectComplexExceptUniqMaxHorn. 0.11/0.35 # 0.11/0.35 # Presaturation interreduction done 0.11/0.35 # Number of axioms: 3 Number of unprocessed: 3 0.11/0.35 # Tableaux proof search. 0.11/0.35 # APR header successfully linked. 0.11/0.35 # Hello from C++ 0.11/0.35 # The folding up rule is enabled... 0.11/0.35 # Local unification is enabled... 0.11/0.35 # Any saturation attempts will use folding labels... 0.11/0.35 # 3 beginning clauses after preprocessing and clausification 0.11/0.35 # Creating start rules for all 1 conjectures. 0.11/0.35 # There are 1 start rule candidates: 0.11/0.35 # Found 3 unit axioms. 0.11/0.35 # 1 start rule tableaux created. 0.11/0.35 # 0 extension rule candidate clauses 0.11/0.35 # 3 unit axiom clauses 0.11/0.35 0.11/0.35 # Requested 8, 32 cores available to the main process. 0.11/0.35 # There are not enough tableaux to fork, creating more from the initial 1 0.11/0.35 # Creating equality axioms 0.11/0.35 # Ran out of tableaux, making start rules for all clauses 0.11/0.35 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. 0.11/0.35 # We now have 8 tableaux to operate on 1.76/0.58 # There were 1 total branch saturation attempts. 1.76/0.58 # There were 0 of these attempts blocked. 1.76/0.58 # There were 0 deferred branch saturation attempts. 1.76/0.58 # There were 0 free duplicated saturations. 1.76/0.58 # There were 1 total successful branch saturations. 1.76/0.58 # There were 0 successful branch saturations in interreduction. 1.76/0.58 # There were 0 successful branch saturations on the branch. 1.76/0.58 # There were 1 successful branch saturations after the branch. 1.76/0.58 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p 1.76/0.58 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 1.76/0.58 # Begin clausification derivation 1.76/0.58 1.76/0.58 # End clausification derivation 1.76/0.58 # Begin listing active clauses obtained from FOF to CNF conversion 1.76/0.58 cnf(i_0_5, plain, (meet(X1,join(X1,X2))=X1)). 1.76/0.58 cnf(i_0_6, plain, (join(meet(X1,X2),meet(X3,X2))=meet(X2,join(X3,X1)))). 1.76/0.58 cnf(i_0_4, negated_conjecture, (join(join(a,b),c)!=join(a,join(b,c)))). 1.76/0.58 cnf(i_0_8, plain, (X4=X4)). 1.76/0.58 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 1.76/0.58 # Begin printing tableau 1.76/0.58 # Found 6 steps 1.76/0.58 cnf(i_0_5, plain, (meet(X8,join(X8,X7))=X8), inference(start_rule)). 1.76/0.58 cnf(i_0_14, plain, (meet(X8,join(X8,X7))=X8), inference(extension_rule, [i_0_13])). 1.76/0.58 cnf(i_0_30, plain, (meet(join(X8,X2),join(join(X8,X2),X2))!=join(X8,X2)), inference(closure_rule, [i_0_5])). 1.76/0.58 cnf(i_0_28, plain, (meet(meet(X8,join(X8,X7)),meet(join(X8,X2),join(join(X8,X2),X2)))=meet(X8,join(X8,X2))), inference(extension_rule, [i_0_11])). 1.76/0.58 cnf(i_0_37, plain, (meet(X8,join(X8,X2))!=X8), inference(closure_rule, [i_0_5])). 1.76/0.58 cnf(i_0_35, plain, (meet(meet(X8,join(X8,X7)),meet(join(X8,X2),join(join(X8,X2),X2)))=X8), inference(etableau_closure_rule, [i_0_35, ...])). 1.76/0.58 # End printing tableau 1.76/0.58 # SZS output end 1.76/0.58 # Branches closed with saturation will be marked with an "s" 1.76/0.58 # Child (10300) has found a proof. 1.76/0.58 1.76/0.58 # Proof search is over... 1.76/0.58 # Freeing feature tree 1.76/0.58 EOF