%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX187+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n025.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Tue May 5 07:00:41 PM UTC 2026 % Result : Theorem 1.90s 0.71s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SWX187+1 : TPTP v9.3.0. Released v9.3.0. % 0.12/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.16/0.35 % Computer : n025.cluster.edu % 0.16/0.35 % Model : x86_64 x86_64 % 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.35 % Memory : 8042.1875MB % 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.35 % CPULimit : 300 % 0.16/0.35 % WCLimit : 300 % 0.16/0.35 % DateTime : Tue May 5 09:39:43 EDT 2026 % 0.16/0.35 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 18 Number of unprocessed: 18 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.30/0.48 # The folding up rule is enabled... % 0.30/0.48 # Local unification is enabled... % 0.30/0.48 # Any saturation attempts will use folding labels... % 0.30/0.48 # 18 beginning clauses after preprocessing and clausification % 0.30/0.48 # Creating start rules for all 1 conjectures. % 0.30/0.48 # There are 1 start rule candidates: % 0.30/0.48 # Found 15 unit axioms. % 0.30/0.48 # 1 start rule tableaux created. % 0.30/0.48 # 3 extension rule candidate clauses % 0.30/0.48 # 15 unit axiom clauses % 0.30/0.48 % 0.30/0.48 # Requested 8, 32 cores available to the main process. % 0.30/0.48 # There are not enough tableaux to fork, creating more from the initial 1 % 0.30/0.48 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 0.30/0.48 # We now have 5 tableaux to operate on % 0.30/0.51 # Creating equality axioms % 0.30/0.51 # Ran out of tableaux, making start rules for all clauses % 0.30/0.52 # Creating equality axioms % 0.30/0.52 # Ran out of tableaux, making start rules for all clauses % 0.30/0.52 # Creating equality axioms % 0.30/0.52 # Ran out of tableaux, making start rules for all clauses % 0.30/0.52 # Creating equality axioms % 0.30/0.52 # Ran out of tableaux, making start rules for all clauses % 0.30/0.52 # Creating equality axioms % 0.30/0.52 # Ran out of tableaux, making start rules for all clauses % 0.30/0.53 # Creating equality axioms % 0.30/0.53 # Ran out of tableaux, making start rules for all clauses % 0.30/0.53 # Creating equality axioms % 0.30/0.53 # Ran out of tableaux, making start rules for all clauses % 0.30/0.54 # Creating equality axioms % 0.30/0.54 # Ran out of tableaux, making start rules for all clauses % 1.90/0.71 # There were 13 total branch saturation attempts. % 1.90/0.71 # There were 0 of these attempts blocked. % 1.90/0.71 # There were 0 deferred branch saturation attempts. % 1.90/0.71 # There were 1 free duplicated saturations. % 1.90/0.71 # There were 13 total successful branch saturations. % 1.90/0.71 # There were 4 successful branch saturations in interreduction. % 1.90/0.71 # There were 0 successful branch saturations on the branch. % 1.90/0.71 # There were 8 successful branch saturations after the branch. % 1.90/0.71 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.90/0.71 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.90/0.71 # Begin clausification derivation % 1.90/0.71 % 1.90/0.71 # End clausification derivation % 1.90/0.71 # Begin listing active clauses obtained from FOF to CNF conversion % 1.90/0.71 cnf(i_0_6, plain, (length(nil)=z)). % 1.90/0.71 cnf(i_0_11, plain, (x2(z,s(X1)))). % 1.90/0.71 cnf(i_0_4, plain, (proj1S(s(X1))=X1)). % 1.90/0.71 cnf(i_0_17, plain, (rotate(z,X1)=X1)). % 1.90/0.71 cnf(i_0_13, plain, (x(nil,X1)=X1)). % 1.90/0.71 cnf(i_0_1, plain, (head(cons(X1,X2))=X1)). % 1.90/0.71 cnf(i_0_15, plain, (rotate(s(X1),nil)=nil)). % 1.90/0.71 cnf(i_0_7, plain, (length(cons(X1,X2))=s(length(X2)))). % 1.90/0.71 cnf(i_0_2, plain, (tail(cons(X1,X2))=X2)). % 1.90/0.71 cnf(i_0_14, plain, (x(cons(X1,X2),X3)=cons(X1,x(X2,X3)))). % 1.90/0.71 cnf(i_0_16, plain, (rotate(X1,x(X2,cons(X3,nil)))=rotate(s(X1),cons(X3,X2)))). % 1.90/0.71 cnf(i_0_12, plain, (~x2(z,z))). % 1.90/0.71 cnf(i_0_5, plain, (s(X1)!=z)). % 1.90/0.71 cnf(i_0_10, plain, (~x2(s(X1),z))). % 1.90/0.71 cnf(i_0_3, plain, (cons(X1,X2)!=nil)). % 1.90/0.71 cnf(i_0_9, plain, (x2(X1,X2)|~x2(s(X1),s(X2)))). % 1.90/0.71 cnf(i_0_8, plain, (x2(s(X1),s(X2))|~x2(X1,X2))). % 1.90/0.71 cnf(i_0_18, negated_conjecture, (rotate(s(z),X1)=X1|X2=X3|rotate(X2,X1)!=rotate(X3,X1)|~x2(X3,length(X1))|~x2(X2,length(X1)))). % 1.90/0.71 cnf(i_0_2410, plain, (X38=X38)). % 1.90/0.71 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.90/0.71 # Begin printing tableau % 1.90/0.71 # Found 32 steps % 1.90/0.71 cnf(i_0_18, negated_conjecture, (rotate(s(z),nil)=nil|s(nil)=z|rotate(s(nil),nil)!=rotate(z,nil)|~x2(z,length(nil))|~x2(s(nil),length(nil))), inference(start_rule)). % 1.90/0.71 cnf(i_0_2443, plain, (s(nil)=z), inference(closure_rule, [i_0_5])). % 1.90/0.71 cnf(i_0_2442, plain, (rotate(s(z),nil)=nil), inference(extension_rule, [i_0_2418])). % 1.90/0.71 cnf(i_0_9979, plain, (proj1S(rotate(s(z),nil))=proj1S(nil)), inference(extension_rule, [i_0_2421])). % 1.90/0.71 cnf(i_0_9991, plain, (length(nil)!=z), inference(closure_rule, [i_0_6])). % 1.90/0.71 cnf(i_0_9989, plain, (x(proj1S(rotate(s(z),nil)),length(nil))=x(proj1S(nil),z)), inference(extension_rule, [i_0_2422])). % 1.90/0.71 cnf(i_0_10002, plain, (length(nil)!=z), inference(closure_rule, [i_0_6])). % 1.90/0.71 cnf(i_0_2444, plain, (rotate(s(nil),nil)!=rotate(z,nil)), inference(extension_rule, [i_0_2413])). % 1.90/0.71 cnf(i_0_10021, plain, (proj1S(s(rotate(s(nil),nil)))!=rotate(s(nil),nil)), inference(closure_rule, [i_0_4])). % 1.90/0.71 cnf(i_0_10022, plain, (proj1S(s(rotate(s(nil),nil)))!=rotate(z,nil)), inference(extension_rule, [i_0_18])). % 1.90/0.71 cnf(i_0_10040, plain, (rotate(s(z),nil)=nil), inference(extension_rule, [i_0_2419])). % 1.90/0.71 cnf(i_0_10042, plain, (rotate(proj1S(s(rotate(s(nil),nil))),nil)!=rotate(rotate(z,nil),nil)), inference(extension_rule, [i_0_2413])). % 1.90/0.71 cnf(i_0_10085, plain, (rotate(proj1S(s(rotate(s(nil),nil))),nil)!=proj1S(s(rotate(proj1S(s(rotate(s(nil),nil))),nil)))), inference(closure_rule, [i_0_4])). % 1.90/0.71 cnf(i_0_10043, plain, (~x2(rotate(z,nil),length(nil))), inference(extension_rule, [i_0_9])). % 1.90/0.71 cnf(i_0_10044, plain, (~x2(proj1S(s(rotate(s(nil),nil))),length(nil))), inference(extension_rule, [i_0_2420])). % 1.90/0.71 cnf(i_0_10103, plain, (rotate(s(nil),nil)!=proj1S(s(rotate(s(nil),nil)))), inference(closure_rule, [i_0_4])). % 1.90/0.71 cnf(i_0_10104, plain, (z!=length(nil)), inference(closure_rule, [i_0_6])). % 1.90/0.71 cnf(i_0_2445, plain, (~x2(z,length(nil))), inference(extension_rule, [i_0_9])). % 1.90/0.71 cnf(i_0_10140, plain, (~x2(s(z),s(length(nil)))), inference(extension_rule, [i_0_2420])). % 1.90/0.71 cnf(i_0_10175, plain, ($false), inference(closure_rule, [i_0_2410])). % 1.90/0.71 cnf(i_0_10176, plain, (proj1S(s(s(length(nil))))!=s(length(nil))), inference(closure_rule, [i_0_4])). % 1.90/0.71 cnf(i_0_10177, plain, (~x2(s(z),proj1S(s(s(length(nil)))))), inference(extension_rule, [i_0_9])). % 1.90/0.71 cnf(i_0_2446, plain, (~x2(s(nil),length(nil))), inference(extension_rule, [i_0_2420])). % 1.90/0.71 cnf(i_0_10247, plain, ($false), inference(closure_rule, [i_0_2410])). % 1.90/0.71 cnf(i_0_10248, plain, (z!=length(nil)), inference(closure_rule, [i_0_6])). % 1.90/0.71 cnf(i_0_10000, plain, (rotate(x(proj1S(rotate(s(z),nil)),length(nil)),length(nil))=rotate(x(proj1S(nil),z),z)), inference(etableau_closure_rule, [i_0_10000, ...])). % 1.90/0.71 cnf(i_0_10053, plain, (length(rotate(s(z),nil))=length(nil)), inference(etableau_closure_rule, [i_0_10053, ...])). % 1.90/0.71 cnf(i_0_10086, plain, (proj1S(s(rotate(proj1S(s(rotate(s(nil),nil))),nil)))!=rotate(rotate(z,nil),nil)), inference(etableau_closure_rule, [i_0_10086, ...])). % 1.90/0.71 cnf(i_0_10092, plain, (~x2(s(rotate(z,nil)),s(length(nil)))), inference(etableau_closure_rule, [i_0_10092, ...])). % 1.90/0.71 cnf(i_0_10105, plain, (~x2(rotate(s(nil),nil),z)), inference(etableau_closure_rule, [i_0_10105, ...])). % 1.90/0.71 cnf(i_0_10212, plain, (~x2(s(s(z)),s(proj1S(s(s(length(nil))))))), inference(etableau_closure_rule, [i_0_10212, ...])). % 1.90/0.71 cnf(i_0_10249, plain, (~x2(s(nil),z)), inference(etableau_closure_rule, [i_0_10249, ...])). % 1.90/0.71 # End printing tableau % 1.90/0.71 # SZS output end % 1.90/0.71 # Branches closed with saturation will be marked with an "s" % 1.90/0.71 # There were 13 total branch saturation attempts. % 1.90/0.71 # There were 0 of these attempts blocked. % 1.90/0.71 # There were 0 deferred branch saturation attempts. % 1.90/0.71 # There were 1 free duplicated saturations. % 1.90/0.71 # There were 13 total successful branch saturations. % 1.90/0.71 # There were 4 successful branch saturations in interreduction. % 1.90/0.71 # There were 0 successful branch saturations on the branch. % 1.90/0.71 # There were 8 successful branch saturations after the branch. % 1.90/0.71 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.90/0.71 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.90/0.71 # Begin clausification derivation % 1.90/0.71 % 1.90/0.71 # End clausification derivation % 1.90/0.71 # Begin listing active clauses obtained from FOF to CNF conversion % 1.90/0.71 cnf(i_0_6, plain, (length(nil)=z)). % 1.90/0.71 cnf(i_0_11, plain, (x2(z,s(X1)))). % 1.90/0.71 cnf(i_0_4, plain, (proj1S(s(X1))=X1)). % 1.90/0.71 cnf(i_0_17, plain, (rotate(z,X1)=X1)). % 1.90/0.71 cnf(i_0_13, plain, (x(nil,X1)=X1)). % 1.90/0.71 cnf(i_0_1, plain, (head(cons(X1,X2))=X1)). % 1.90/0.71 cnf(i_0_15, plain, (rotate(s(X1),nil)=nil)). % 1.90/0.71 cnf(i_0_7, plain, (length(cons(X1,X2))=s(length(X2)))). % 1.90/0.71 cnf(i_0_2, plain, (tail(cons(X1,X2))=X2)). % 1.90/0.71 cnf(i_0_14, plain, (x(cons(X1,X2),X3)=cons(X1,x(X2,X3)))). % 1.90/0.71 cnf(i_0_16, plain, (rotate(X1,x(X2,cons(X3,nil)))=rotate(s(X1),cons(X3,X2)))). % 1.90/0.71 cnf(i_0_12, plain, (~x2(z,z))). % 1.90/0.71 cnf(i_0_5, plain, (s(X1)!=z)). % 1.90/0.71 cnf(i_0_10, plain, (~x2(s(X1),z))). % 1.90/0.71 cnf(i_0_3, plain, (cons(X1,X2)!=nil)). % 1.90/0.71 cnf(i_0_9, plain, (x2(X1,X2)|~x2(s(X1),s(X2)))). % 1.90/0.71 cnf(i_0_8, plain, (x2(s(X1),s(X2))|~x2(X1,X2))). % 1.90/0.71 cnf(i_0_18, negated_conjecture, (rotate(s(z),X1)=X1|X2=X3|rotate(X2,X1)!=rotate(X3,X1)|~x2(X3,length(X1))|~x2(X2,length(X1)))). % 1.90/0.71 cnf(i_0_2419, plain, (X38=X38)). % 1.90/0.71 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.90/0.71 # Begin printing tableau % 1.90/0.71 # Found 32 steps % 1.90/0.71 cnf(i_0_18, negated_conjecture, (rotate(s(z),nil)=nil|s(nil)=z|rotate(s(nil),nil)!=rotate(z,nil)|~x2(z,length(nil))|~x2(s(nil),length(nil))), inference(start_rule)). % 1.90/0.71 cnf(i_0_2452, plain, (s(nil)=z), inference(closure_rule, [i_0_5])). % 1.90/0.71 cnf(i_0_2451, plain, (rotate(s(z),nil)=nil), inference(extension_rule, [i_0_2427])). % 1.90/0.71 cnf(i_0_10008, plain, (proj1S(rotate(s(z),nil))=proj1S(nil)), inference(extension_rule, [i_0_2430])). % 1.90/0.71 cnf(i_0_10020, plain, (length(nil)!=z), inference(closure_rule, [i_0_6])). % 1.90/0.71 cnf(i_0_10018, plain, (x(proj1S(rotate(s(z),nil)),length(nil))=x(proj1S(nil),z)), inference(extension_rule, [i_0_2431])). % 1.90/0.71 cnf(i_0_10031, plain, (length(nil)!=z), inference(closure_rule, [i_0_6])). % 1.90/0.71 cnf(i_0_2453, plain, (rotate(s(nil),nil)!=rotate(z,nil)), inference(extension_rule, [i_0_2422])). % 1.90/0.71 cnf(i_0_10050, plain, (proj1S(s(rotate(s(nil),nil)))!=rotate(s(nil),nil)), inference(closure_rule, [i_0_4])). % 1.90/0.71 cnf(i_0_10051, plain, (proj1S(s(rotate(s(nil),nil)))!=rotate(z,nil)), inference(extension_rule, [i_0_18])). % 1.90/0.71 cnf(i_0_10069, plain, (rotate(s(z),nil)=nil), inference(extension_rule, [i_0_2428])). % 1.90/0.71 cnf(i_0_10071, plain, (rotate(proj1S(s(rotate(s(nil),nil))),nil)!=rotate(rotate(z,nil),nil)), inference(extension_rule, [i_0_2422])). % 1.90/0.71 cnf(i_0_10114, plain, (rotate(proj1S(s(rotate(s(nil),nil))),nil)!=proj1S(s(rotate(proj1S(s(rotate(s(nil),nil))),nil)))), inference(closure_rule, [i_0_4])). % 1.90/0.71 cnf(i_0_10072, plain, (~x2(rotate(z,nil),length(nil))), inference(extension_rule, [i_0_9])). % 1.90/0.71 cnf(i_0_10073, plain, (~x2(proj1S(s(rotate(s(nil),nil))),length(nil))), inference(extension_rule, [i_0_2429])). % 1.90/0.71 cnf(i_0_10132, plain, (rotate(s(nil),nil)!=proj1S(s(rotate(s(nil),nil)))), inference(closure_rule, [i_0_4])). % 1.90/0.71 cnf(i_0_10133, plain, (z!=length(nil)), inference(closure_rule, [i_0_6])). % 1.90/0.71 cnf(i_0_2454, plain, (~x2(z,length(nil))), inference(extension_rule, [i_0_9])). % 1.90/0.71 cnf(i_0_10169, plain, (~x2(s(z),s(length(nil)))), inference(extension_rule, [i_0_2429])). % 1.90/0.71 cnf(i_0_10204, plain, ($false), inference(closure_rule, [i_0_2419])). % 1.90/0.71 cnf(i_0_10205, plain, (proj1S(s(s(length(nil))))!=s(length(nil))), inference(closure_rule, [i_0_4])). % 1.90/0.71 cnf(i_0_10206, plain, (~x2(s(z),proj1S(s(s(length(nil)))))), inference(extension_rule, [i_0_9])). % 1.90/0.71 cnf(i_0_2455, plain, (~x2(s(nil),length(nil))), inference(extension_rule, [i_0_2429])). % 1.90/0.71 cnf(i_0_10276, plain, ($false), inference(closure_rule, [i_0_2419])). % 1.90/0.71 cnf(i_0_10277, plain, (z!=length(nil)), inference(closure_rule, [i_0_6])). % 1.90/0.71 cnf(i_0_10029, plain, (rotate(x(proj1S(rotate(s(z),nil)),length(nil)),length(nil))=rotate(x(proj1S(nil),z),z)), inference(etableau_closure_rule, [i_0_10029, ...])). % 1.90/0.71 cnf(i_0_10082, plain, (length(rotate(s(z),nil))=length(nil)), inference(etableau_closure_rule, [i_0_10082, ...])). % 1.90/0.71 cnf(i_0_10115, plain, (proj1S(s(rotate(proj1S(s(rotate(s(nil),nil))),nil)))!=rotate(rotate(z,nil),nil)), inference(etableau_closure_rule, [i_0_10115, ...])). % 1.90/0.71 cnf(i_0_10121, plain, (~x2(s(rotate(z,nil)),s(length(nil)))), inference(etableau_closure_rule, [i_0_10121, ...])). % 1.90/0.71 cnf(i_0_10134, plain, (~x2(rotate(s(nil),nil),z)), inference(etableau_closure_rule, [i_0_10134, ...])). % 1.90/0.71 cnf(i_0_10241, plain, (~x2(s(s(z)),s(proj1S(s(s(length(nil))))))), inference(etableau_closure_rule, [i_0_10241, ...])). % 1.90/0.71 cnf(i_0_10278, plain, (~x2(s(nil),z)), inference(etableau_closure_rule, [i_0_10278, ...])). % 1.90/0.71 # End printing tableau % 1.90/0.71 # SZS output end % 1.90/0.71 # Branches closed with saturation will be marked with an "s" % 1.90/0.72 # Child (19583) has found a proof. % 1.90/0.72 % 1.90/0.72 # Proof search is over... % 1.90/0.72 # Freeing feature tree %------------------------------------------------------------------------------