0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.13/0.34 % Computer : n002.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Jul 13 14:36:33 EDT 2021 0.13/0.34 % CPUTime : 0.13/0.36 # No SInE strategy applied 0.13/0.36 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN 0.13/0.36 # and selection function PSelectComplexExceptUniqMaxHorn. 0.13/0.36 # 0.13/0.36 # Number of axioms: 6 Number of unprocessed: 6 0.13/0.36 # Tableaux proof search. 0.13/0.36 # APR header successfully linked. 0.13/0.36 # Hello from C++ 0.13/0.37 # The folding up rule is enabled... 0.13/0.37 # Local unification is enabled... 0.13/0.37 # Any saturation attempts will use folding labels... 0.13/0.37 # 6 beginning clauses after preprocessing and clausification 0.13/0.37 # Creating start rules for all 1 conjectures. 0.13/0.37 # There are 1 start rule candidates: 0.13/0.37 # Found 6 unit axioms. 0.13/0.37 # 1 start rule tableaux created. 0.13/0.37 # 0 extension rule candidate clauses 0.13/0.37 # 6 unit axiom clauses 0.13/0.37 0.13/0.37 # Requested 8, 32 cores available to the main process. 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 0.13/0.37 # Creating equality axioms 0.13/0.37 # Ran out of tableaux, making start rules for all clauses 0.13/0.37 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux. 0.13/0.37 # We now have 16 tableaux to operate on 61.28/8.10 # There were 1 total branch saturation attempts. 61.28/8.10 # There were 0 of these attempts blocked. 61.28/8.10 # There were 0 deferred branch saturation attempts. 61.28/8.10 # There were 0 free duplicated saturations. 61.28/8.10 # There were 1 total successful branch saturations. 61.28/8.10 # There were 0 successful branch saturations in interreduction. 61.28/8.10 # There were 0 successful branch saturations on the branch. 61.28/8.10 # There were 1 successful branch saturations after the branch. 61.28/8.10 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p 61.28/8.10 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 61.28/8.10 # Begin clausification derivation 61.28/8.10 61.28/8.10 # End clausification derivation 61.28/8.10 # Begin listing active clauses obtained from FOF to CNF conversion 61.28/8.10 cnf(i_0_7, plain, (is_a_theorem(implies(implies(not(X1),X1),X1))=true)). 61.28/8.10 cnf(i_0_12, plain, (is_a_theorem(implies(X1,implies(not(X1),X2)))=true)). 61.28/8.10 cnf(i_0_11, negated_conjecture, (is_a_theorem(implies(not(implies(x,y)),x))!=true)). 61.28/8.10 cnf(i_0_8, plain, (ifeq(X1,X1,X2,X3)=X2)). 61.28/8.10 cnf(i_0_9, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))=true)). 61.28/8.10 cnf(i_0_10, plain, (ifeq(is_a_theorem(implies(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true)=true)). 61.28/8.10 cnf(i_0_14, plain, (X4=X4)). 61.28/8.10 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 61.28/8.10 # Begin printing tableau 61.28/8.10 # Found 8 steps 61.28/8.10 cnf(i_0_7, plain, (is_a_theorem(implies(implies(not(X13),X13),X13))=true), inference(start_rule)). 61.28/8.10 cnf(i_0_22, plain, (is_a_theorem(implies(implies(not(X13),X13),X13))=true), inference(extension_rule, [i_0_21])). 61.28/8.10 cnf(i_0_44, plain, (is_a_theorem(implies(implies(not(true),true),true))!=true), inference(closure_rule, [i_0_7])). 61.28/8.10 cnf(i_0_45, plain, (is_a_theorem(implies(implies(not(true),true),true))!=true), inference(closure_rule, [i_0_7])). 61.28/8.10 cnf(i_0_46, plain, (is_a_theorem(implies(implies(not(true),true),true))!=true), inference(closure_rule, [i_0_7])). 61.28/8.10 cnf(i_0_43, plain, (ifeq(is_a_theorem(implies(implies(not(true),true),true)),is_a_theorem(implies(implies(not(true),true),true)),is_a_theorem(implies(implies(not(true),true),true)),is_a_theorem(implies(implies(not(X13),X13),X13)))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_17])). 61.28/8.10 cnf(i_0_54, plain, (ifeq(true,true,true,true)!=true), inference(closure_rule, [i_0_8])). 61.28/8.10 cnf(i_0_52, plain, (ifeq(is_a_theorem(implies(implies(not(true),true),true)),is_a_theorem(implies(implies(not(true),true),true)),is_a_theorem(implies(implies(not(true),true),true)),is_a_theorem(implies(implies(not(X13),X13),X13)))=true), inference(etableau_closure_rule, [i_0_52, ...])). 61.28/8.10 # End printing tableau 61.28/8.10 # SZS output end 61.28/8.10 # Branches closed with saturation will be marked with an "s" 61.28/8.10 # There were 1 total branch saturation attempts. 61.28/8.10 # There were 0 of these attempts blocked. 61.28/8.10 # There were 0 deferred branch saturation attempts. 61.28/8.10 # There were 0 free duplicated saturations. 61.28/8.10 # There were 1 total successful branch saturations. 61.28/8.10 # There were 0 successful branch saturations in interreduction. 61.28/8.10 # There were 0 successful branch saturations on the branch. 61.28/8.10 # There were 1 successful branch saturations after the branch. 61.28/8.10 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p 61.28/8.10 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 61.28/8.10 # Begin clausification derivation 61.28/8.10 61.28/8.10 # End clausification derivation 61.28/8.10 # Begin listing active clauses obtained from FOF to CNF conversion 61.28/8.10 cnf(i_0_7, plain, (is_a_theorem(implies(implies(not(X1),X1),X1))=true)). 61.28/8.10 cnf(i_0_12, plain, (is_a_theorem(implies(X1,implies(not(X1),X2)))=true)). 61.28/8.10 cnf(i_0_11, negated_conjecture, (is_a_theorem(implies(not(implies(x,y)),x))!=true)). 61.28/8.10 cnf(i_0_8, plain, (ifeq(X1,X1,X2,X3)=X2)). 61.28/8.10 cnf(i_0_9, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))=true)). 61.28/8.10 cnf(i_0_10, plain, (ifeq(is_a_theorem(implies(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true)=true)). 61.28/8.10 cnf(i_0_14, plain, (X4=X4)). 61.28/8.10 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 61.28/8.10 # Begin printing tableau 61.28/8.10 # Found 4 steps 61.28/8.10 cnf(i_0_7, plain, (is_a_theorem(implies(implies(not(X3),X3),X3))=true), inference(start_rule)). 61.28/8.10 cnf(i_0_22, plain, (is_a_theorem(implies(implies(not(X3),X3),X3))=true), inference(extension_rule, [i_0_20])). 61.28/8.10 cnf(i_0_41, plain, (is_a_theorem(is_a_theorem(implies(implies(not(X3),X3),X3)))=is_a_theorem(true)), inference(extension_rule, [i_0_18])). 61.28/8.10 cnf(i_0_119, plain, (not(is_a_theorem(is_a_theorem(implies(implies(not(X3),X3),X3))))=not(is_a_theorem(true))), inference(etableau_closure_rule, [i_0_119, ...])). 61.28/8.10 # End printing tableau 61.28/8.10 # SZS output end 61.28/8.10 # Branches closed with saturation will be marked with an "s" 61.28/8.12 # Child (10481) has found a proof. 61.28/8.12 61.28/8.12 # Proof search is over... 61.28/8.12 # Freeing feature tree 61.28/8.16 EOF