%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX203+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 : n015.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:43 PM UTC 2026 % Result : Theorem 0.39s 0.57s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SWX203+1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.16/0.33 % Computer : n015.cluster.edu % 0.16/0.33 % Model : x86_64 x86_64 % 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.33 % Memory : 8042.1875MB % 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.33 % CPULimit : 300 % 0.16/0.33 % WCLimit : 300 % 0.16/0.33 % DateTime : Tue May 5 11:24:46 EDT 2026 % 0.16/0.33 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 29 Number of unprocessed: 29 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.36 # The folding up rule is enabled... % 0.19/0.36 # Local unification is enabled... % 0.19/0.36 # Any saturation attempts will use folding labels... % 0.19/0.36 # 29 beginning clauses after preprocessing and clausification % 0.19/0.36 # Creating start rules for all 1 conjectures. % 0.19/0.36 # There are 1 start rule candidates: % 0.19/0.36 # Found 18 unit axioms. % 0.19/0.36 # 1 start rule tableaux created. % 0.19/0.36 # 11 extension rule candidate clauses % 0.19/0.36 # 18 unit axiom clauses % 0.19/0.36 % 0.19/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.39/0.57 # There were 2 total branch saturation attempts. % 0.39/0.57 # There were 0 of these attempts blocked. % 0.39/0.57 # There were 0 deferred branch saturation attempts. % 0.39/0.57 # There were 0 free duplicated saturations. % 0.39/0.57 # There were 2 total successful branch saturations. % 0.39/0.57 # There were 1 successful branch saturations in interreduction. % 0.39/0.57 # There were 0 successful branch saturations on the branch. % 0.39/0.57 # There were 1 successful branch saturations after the branch. % 0.39/0.57 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.39/0.57 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.39/0.57 # Begin clausification derivation % 0.39/0.57 % 0.39/0.57 # End clausification derivation % 0.39/0.57 # Begin listing active clauses obtained from FOF to CNF conversion % 0.39/0.57 cnf(i_0_15, plain, (lengthNat(nil)=z)). % 0.39/0.57 cnf(i_0_10, plain, (sorted(nil))). % 0.39/0.57 cnf(i_0_21, plain, (unique(nil))). % 0.39/0.57 cnf(i_0_27, plain, (rev(nil)=nil)). % 0.39/0.57 cnf(i_0_6, plain, (leqNat(z,X1))). % 0.39/0.57 cnf(i_0_4, plain, (proj1S(s(X1))=X1)). % 0.39/0.57 cnf(i_0_11, plain, (sorted(cons(X1,nil)))). % 0.39/0.57 cnf(i_0_25, plain, (append(nil,X1)=X1)). % 0.39/0.57 cnf(i_0_1, plain, (head(cons(X1,X2))=X1)). % 0.39/0.57 cnf(i_0_2, plain, (tail(cons(X1,X2))=X2)). % 0.39/0.57 cnf(i_0_19, plain, (elemNat(X1,cons(X1,X2)))). % 0.39/0.57 cnf(i_0_16, plain, (lengthNat(cons(X1,X2))=s(lengthNat(X2)))). % 0.39/0.57 cnf(i_0_28, plain, (append(rev(X1),cons(X2,nil))=rev(cons(X2,X1)))). % 0.39/0.57 cnf(i_0_26, plain, (append(cons(X1,X2),X3)=cons(X1,append(X2,X3)))). % 0.39/0.57 cnf(i_0_5, plain, (s(X1)!=z)). % 0.39/0.57 cnf(i_0_7, plain, (~leqNat(s(X1),z))). % 0.39/0.57 cnf(i_0_17, plain, (~elemNat(X1,nil))). % 0.39/0.57 cnf(i_0_3, plain, (cons(X1,X2)!=nil)). % 0.39/0.57 cnf(i_0_24, plain, (~unique(cons(X1,X2))|~elemNat(X1,X2))). % 0.39/0.57 cnf(i_0_23, plain, (unique(X1)|~unique(cons(X2,X1)))). % 0.39/0.57 cnf(i_0_29, negated_conjecture, (leqNat(lengthNat(X1),s(s(s(z))))|~unique(X1)|~sorted(rev(X1)))). % 0.39/0.57 cnf(i_0_9, plain, (leqNat(X1,X2)|~leqNat(s(X1),s(X2)))). % 0.39/0.57 cnf(i_0_8, plain, (leqNat(s(X1),s(X2))|~leqNat(X1,X2))). % 0.39/0.57 cnf(i_0_14, plain, (leqNat(X1,X2)|~sorted(cons(X1,cons(X2,X3))))). % 0.39/0.57 cnf(i_0_13, plain, (sorted(cons(X1,X2))|~sorted(cons(X3,cons(X1,X2))))). % 0.39/0.57 cnf(i_0_22, plain, (unique(cons(X1,X2))|elemNat(X1,X2)|~unique(X2))). % 0.39/0.57 cnf(i_0_18, plain, (elemNat(X1,cons(X2,X3))|~elemNat(X1,X3))). % 0.39/0.57 cnf(i_0_20, plain, (X1=X2|elemNat(X1,X3)|~elemNat(X1,cons(X2,X3)))). % 0.39/0.57 cnf(i_0_12, plain, (sorted(cons(X1,cons(X2,X3)))|~sorted(cons(X2,X3))|~leqNat(X1,X2))). % 0.39/0.57 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.39/0.57 # Begin printing tableau % 0.39/0.57 # Found 8 steps % 0.39/0.57 cnf(i_0_29, negated_conjecture, (leqNat(lengthNat(nil),s(s(s(z))))|~unique(nil)|~sorted(rev(nil))), inference(start_rule)). % 0.39/0.57 cnf(i_0_32, plain, (~unique(nil)), inference(closure_rule, [i_0_21])). % 0.39/0.57 cnf(i_0_31, plain, (leqNat(lengthNat(nil),s(s(s(z))))), inference(extension_rule, [i_0_12])). % 0.39/0.57 cnf(i_0_55, plain, (~sorted(cons(s(s(s(z))),nil))), inference(closure_rule, [i_0_11])). % 0.39/0.57 cnf(i_0_54, plain, (sorted(cons(lengthNat(nil),cons(s(s(s(z))),nil)))), inference(extension_rule, [i_0_12])). % 0.39/0.57 cnf(i_0_134, plain, (~leqNat(z,lengthNat(nil))), inference(closure_rule, [i_0_6])). % 0.39/0.57 cnf(i_0_33, plain, (~sorted(rev(nil))), inference(etableau_closure_rule, [i_0_33, ...])). % 0.39/0.57 cnf(i_0_132, plain, (sorted(cons(z,cons(lengthNat(nil),cons(s(s(s(z))),nil))))), inference(etableau_closure_rule, [i_0_132, ...])). % 0.39/0.57 # End printing tableau % 0.39/0.57 # SZS output end % 0.39/0.57 # Branches closed with saturation will be marked with an "s" % 0.39/0.57 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.39/0.57 # We now have 2 tableaux to operate on % 0.39/0.57 # Found closed tableau during pool population. % 0.39/0.57 # Proof search is over... % 0.39/0.57 # Freeing feature tree %------------------------------------------------------------------------------