0.08/0.14 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.15/0.36 % Computer : n031.cluster.edu 0.15/0.36 % Model : x86_64 x86_64 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.36 % Memory : 8042.1875MB 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.36 % CPULimit : 1200 0.15/0.36 % WCLimit : 120 0.15/0.36 % DateTime : Tue Jul 13 15:25:29 EDT 2021 0.15/0.36 % CPUTime : 0.15/0.39 # No SInE strategy applied 0.15/0.39 # Auto-Mode selected heuristic G_E___209_C18_F1_AE_CS_SP_PI_S0Y 0.15/0.39 # and selection function SelectMaxLComplexAvoidPosPred. 0.15/0.39 # 0.15/0.39 # Number of axioms: 2 Number of unprocessed: 2 0.15/0.39 # Tableaux proof search. 0.15/0.39 # APR header successfully linked. 0.15/0.39 # Hello from C++ 0.15/0.39 # The folding up rule is enabled... 0.15/0.39 # Local unification is enabled... 0.15/0.39 # Any saturation attempts will use folding labels... 0.15/0.39 # 2 beginning clauses after preprocessing and clausification 0.15/0.39 # Creating start rules for all 1 conjectures. 0.15/0.39 # There are 1 start rule candidates: 0.15/0.39 # Found 2 unit axioms. 0.15/0.39 # 1 start rule tableaux created. 0.15/0.39 # 0 extension rule candidate clauses 0.15/0.39 # 2 unit axiom clauses 0.15/0.39 0.15/0.39 # Requested 8, 32 cores available to the main process. 0.15/0.39 # There are not enough tableaux to fork, creating more from the initial 1 0.15/0.39 # Creating equality axioms 0.15/0.39 # Ran out of tableaux, making start rules for all clauses 0.15/0.39 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. 0.15/0.39 # We now have 8 tableaux to operate on 0.22/0.47 # There were 1 total branch saturation attempts. 0.22/0.47 # There were 0 of these attempts blocked. 0.22/0.47 # There were 0 deferred branch saturation attempts. 0.22/0.47 # There were 0 free duplicated saturations. 0.22/0.47 # There were 1 total successful branch saturations. 0.22/0.47 # There were 0 successful branch saturations in interreduction. 0.22/0.47 # There were 0 successful branch saturations on the branch. 0.22/0.47 # There were 1 successful branch saturations after the branch. 0.22/0.47 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.22/0.47 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.22/0.47 # Begin clausification derivation 0.22/0.47 0.22/0.47 # End clausification derivation 0.22/0.47 # Begin listing active clauses obtained from FOF to CNF conversion 0.22/0.47 cnf(i_0_4, negated_conjecture, (meet(a,join(a,b))!=a)). 0.22/0.47 cnf(i_0_3, plain, (join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X4,X2),meet(X2,X5)),X2)),meet(join(meet(X2,meet(meet(join(X4,join(X2,X5)),join(X6,X2)),X2)),meet(X7,join(X2,meet(meet(join(X4,join(X2,X5)),join(X6,X2)),X2)))),join(X1,join(join(meet(X4,X2),meet(X2,X5)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3)))=X2)). 0.22/0.47 cnf(i_0_6, plain, (X8=X8)). 0.22/0.47 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.22/0.47 # Begin printing tableau 0.22/0.47 # Found 6 steps 0.22/0.47 cnf(i_0_3, plain, (join(meet(join(meet(X1,a),meet(a,join(X1,a))),X3),meet(join(meet(X1,join(join(meet(X4,a),meet(a,X5)),a)),meet(join(meet(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)),meet(X7,join(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)))),join(X1,join(join(meet(X4,a),meet(a,X5)),a)))),join(join(meet(X1,a),meet(a,join(X1,a))),X3)))=a), inference(start_rule)). 0.22/0.47 cnf(i_0_13, plain, (join(meet(join(meet(X1,a),meet(a,join(X1,a))),X3),meet(join(meet(X1,join(join(meet(X4,a),meet(a,X5)),a)),meet(join(meet(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)),meet(X7,join(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)))),join(X1,join(join(meet(X4,a),meet(a,X5)),a)))),join(join(meet(X1,a),meet(a,join(X1,a))),X3)))=a), inference(extension_rule, [i_0_9])). 0.22/0.47 cnf(i_0_110, plain, (meet(a,join(a,b))=a), inference(closure_rule, [i_0_4])). 0.22/0.47 cnf(i_0_111, plain, (meet(a,join(a,b))!=join(meet(join(meet(X1,a),meet(a,join(X1,a))),X3),meet(join(meet(X1,join(join(meet(X4,a),meet(a,X5)),a)),meet(join(meet(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)),meet(X7,join(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)))),join(X1,join(join(meet(X4,a),meet(a,X5)),a)))),join(join(meet(X1,a),meet(a,join(X1,a))),X3)))), inference(extension_rule, [i_0_9])). 0.22/0.47 cnf(i_0_124, plain, (meet(a,join(a,b))!=join(meet(join(meet(X1,meet(a,join(a,b))),meet(meet(a,join(a,b)),join(X1,meet(a,join(a,b))))),X3),meet(join(meet(X1,join(join(meet(X4,meet(a,join(a,b))),meet(meet(a,join(a,b)),X5)),meet(a,join(a,b)))),meet(join(meet(meet(a,join(a,b)),meet(meet(join(X4,join(meet(a,join(a,b)),X5)),join(X6,meet(a,join(a,b)))),meet(a,join(a,b)))),meet(X7,join(meet(a,join(a,b)),meet(meet(join(X4,join(meet(a,join(a,b)),X5)),join(X6,meet(a,join(a,b)))),meet(a,join(a,b)))))),join(X1,join(join(meet(X4,meet(a,join(a,b))),meet(meet(a,join(a,b)),X5)),meet(a,join(a,b)))))),join(join(meet(X1,meet(a,join(a,b))),meet(meet(a,join(a,b)),join(X1,meet(a,join(a,b))))),X3)))), inference(closure_rule, [i_0_3])). 0.22/0.47 cnf(i_0_125, plain, (join(meet(join(meet(X1,meet(a,join(a,b))),meet(meet(a,join(a,b)),join(X1,meet(a,join(a,b))))),X3),meet(join(meet(X1,join(join(meet(X4,meet(a,join(a,b))),meet(meet(a,join(a,b)),X5)),meet(a,join(a,b)))),meet(join(meet(meet(a,join(a,b)),meet(meet(join(X4,join(meet(a,join(a,b)),X5)),join(X6,meet(a,join(a,b)))),meet(a,join(a,b)))),meet(X7,join(meet(a,join(a,b)),meet(meet(join(X4,join(meet(a,join(a,b)),X5)),join(X6,meet(a,join(a,b)))),meet(a,join(a,b)))))),join(X1,join(join(meet(X4,meet(a,join(a,b))),meet(meet(a,join(a,b)),X5)),meet(a,join(a,b)))))),join(join(meet(X1,meet(a,join(a,b))),meet(meet(a,join(a,b)),join(X1,meet(a,join(a,b))))),X3)))!=join(meet(join(meet(X1,a),meet(a,join(X1,a))),X3),meet(join(meet(X1,join(join(meet(X4,a),meet(a,X5)),a)),meet(join(meet(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)),meet(X7,join(a,meet(meet(join(X4,join(a,X5)),join(X6,a)),a)))),join(X1,join(join(meet(X4,a),meet(a,X5)),a)))),join(join(meet(X1,a),meet(a,join(X1,a))),X3)))), inference(etableau_closure_rule, [i_0_125, ...])). 0.22/0.47 # End printing tableau 0.22/0.47 # SZS output end 0.22/0.47 # Branches closed with saturation will be marked with an "s" 0.22/0.47 # Child (20540) has found a proof. 0.22/0.47 0.22/0.47 # Proof search is over... 0.22/0.47 # Freeing feature tree 0.22/0.48 EOF