0.05/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.05/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.10/0.31 Computer : n009.cluster.edu 0.10/0.31 Model : x86_64 x86_64 0.10/0.31 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 RAMPerCPU : 8042.1875MB 0.10/0.31 OS : Linux 3.10.0-693.el7.x86_64 0.15/0.31 % CPULimit : 960 0.15/0.31 % WCLimit : 120 0.15/0.31 % DateTime : Tue Aug 9 05:23:05 EDT 2022 0.15/0.31 % CPUTime : 0.15/0.34 # No SInE strategy applied 0.15/0.34 # Auto-Mode selected heuristic H_____042_B03_F1_AE_Q4_SP_S2S 0.15/0.34 # and selection function SelectNewComplexAHP. 0.15/0.34 # 0.15/0.34 # Number of axioms: 14 Number of unprocessed: 14 0.15/0.34 # Tableaux proof search. 0.15/0.34 # APR header successfully linked. 0.15/0.34 # Hello from C++ 1.68/1.87 # The folding up rule is enabled... 1.68/1.87 # Local unification is enabled... 1.68/1.87 # Any saturation attempts will use folding labels... 1.68/1.87 # 14 beginning clauses after preprocessing and clausification 1.68/1.87 # Creating start rules for all 1 conjectures. 1.68/1.87 # There are 1 start rule candidates: 1.68/1.87 # Found 7 unit axioms. 1.68/1.87 # 1 start rule tableaux created. 1.68/1.87 # 7 extension rule candidate clauses 1.68/1.87 # 7 unit axiom clauses 1.68/1.87 1.68/1.87 # Requested 8, 32 cores available to the main process. 1.68/1.87 # There are not enough tableaux to fork, creating more from the initial 1 5.83/6.04 # There were 10 total branch saturation attempts. 5.83/6.04 # There were 4 of these attempts blocked. 5.83/6.04 # There were 0 deferred branch saturation attempts. 5.83/6.04 # There were 1 free duplicated saturations. 5.83/6.04 # There were 3 total successful branch saturations. 5.83/6.04 # There were 0 successful branch saturations in interreduction. 5.83/6.04 # There were 0 successful branch saturations on the branch. 5.83/6.04 # There were 2 successful branch saturations after the branch. 5.83/6.05 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 5.83/6.05 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 5.83/6.05 # Begin clausification derivation 5.83/6.05 5.83/6.05 # End clausification derivation 5.83/6.05 # Begin listing active clauses obtained from FOF to CNF conversion 5.83/6.05 cnf(i_0_5, plain, ('>='(X1,'0'))). 5.83/6.05 cnf(i_0_14, plain, ('+'(X1,'0')=X1)). 5.83/6.05 cnf(i_0_1, plain, ('>='(X1,X1))). 5.83/6.05 cnf(i_0_2, plain, ('+'(X1,X2)='+'(X2,X1))). 5.83/6.05 cnf(i_0_8, plain, (X1=X2|~'>='(X2,X1)|~'>='(X1,X2))). 5.83/6.05 cnf(i_0_3, plain, ('>='(X3,X2)|~'>='(X3,X1)|~'>='(X1,X2))). 5.83/6.05 cnf(i_0_11, plain, ('+'('+'(X1,X2),X3)='+'(X1,'+'(X2,X3)))). 5.83/6.05 cnf(i_0_4, plain, ('>='('+'(X1,X3),'+'(X2,X3))|~'>='(X1,X2))). 5.83/6.05 cnf(i_0_12, plain, ('>='('==>'(X3,X1),'==>'(X3,X2))|~'>='(X1,X2))). 5.83/6.05 cnf(i_0_9, plain, ('>='('==>'(X2,X3),'==>'(X1,X3))|~'>='(X1,X2))). 5.83/6.05 cnf(i_0_13, negated_conjecture, ('+'(esk1_0,'==>'(esk1_0,esk2_0))!='+'(esk2_0,'==>'(esk2_0,esk1_0)))). 5.83/6.05 cnf(i_0_7, plain, ('>='(X2,'==>'(X1,X3))|~'>='('+'(X1,X2),X3))). 5.83/6.05 cnf(i_0_6, plain, ('>='('+'(X2,X1),X3)|~'>='(X1,'==>'(X2,X3)))). 5.83/6.05 cnf(i_0_10, plain, ('+'('+'(X1,'==>'(X1,X2)),'==>'('+'(X1,'==>'(X1,X2)),X3))='+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))))). 5.83/6.05 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 5.83/6.05 # Begin printing tableau 5.83/6.05 # Found 6 steps 5.83/6.05 cnf(i_0_13, negated_conjecture, ('+'(esk1_0,'==>'(esk1_0,esk2_0))!='+'(esk2_0,'==>'(esk2_0,esk1_0))), inference(start_rule)). 5.83/6.05 cnf(i_0_15, plain, ('+'(esk1_0,'==>'(esk1_0,esk2_0))!='+'(esk2_0,'==>'(esk2_0,esk1_0))), inference(extension_rule, [i_0_8])). 5.83/6.05 cnf(i_0_17, plain, (~'>='('+'(esk2_0,'==>'(esk2_0,esk1_0)),'+'(esk1_0,'==>'(esk1_0,esk2_0)))), inference(extension_rule, [i_0_6])). 5.83/6.05 cnf(i_0_18, plain, (~'>='('+'(esk1_0,'==>'(esk1_0,esk2_0)),'+'(esk2_0,'==>'(esk2_0,esk1_0)))), inference(extension_rule, [i_0_6])). 5.83/6.05 cnf(i_0_131912, plain, (~'>='('==>'(esk2_0,esk1_0),'==>'(esk2_0,'+'(esk1_0,'==>'(esk1_0,esk2_0))))), inference(etableau_closure_rule, [i_0_131912, ...])). 5.83/6.05 cnf(i_0_397597, plain, (~'>='('==>'(esk1_0,esk2_0),'==>'(esk1_0,'+'(esk2_0,'==>'(esk2_0,esk1_0))))), inference(etableau_closure_rule, [i_0_397597, ...])). 5.83/6.05 # End printing tableau 5.83/6.05 # SZS output end 5.83/6.05 # Branches closed with saturation will be marked with an "s" 5.83/6.05 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. 5.83/6.05 # We now have 3 tableaux to operate on 5.83/6.05 # Found closed tableau during pool population. 5.83/6.05 # Proof search is over... 5.83/6.05 # Freeing feature tree 5.88/6.06 EOF