%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX206+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 : n024.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.06s 0.26s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.06 % Problem : SWX206+1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.06 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.06/0.24 % Computer : n024.cluster.edu % 0.06/0.24 % Model : x86_64 x86_64 % 0.06/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.06/0.24 % Memory : 8042.1875MB % 0.06/0.24 % OS : Linux 3.10.0-693.el7.x86_64 % 0.06/0.24 % CPULimit : 300 % 0.06/0.24 % WCLimit : 300 % 0.06/0.24 % DateTime : Tue May 5 06:32:56 EDT 2026 % 0.06/0.24 % CPUTime : % 0.06/0.26 # No SInE strategy applied % 0.06/0.26 # Auto-Mode selected heuristic C12_02_nc_SAT001_MinMin_rr % 0.06/0.26 # and selection function SelectMaxLComplexAvoidPosPred. % 0.06/0.26 # % 0.06/0.26 # Presaturation interreduction done % 0.06/0.26 # Number of axioms: 5 Number of unprocessed: 5 % 0.06/0.26 # Tableaux proof search. % 0.06/0.26 # APR header successfully linked. % 0.06/0.26 # Hello from C++ % 0.06/0.26 # The folding up rule is enabled... % 0.06/0.26 # Local unification is enabled... % 0.06/0.26 # Any saturation attempts will use folding labels... % 0.06/0.26 # 5 beginning clauses after preprocessing and clausification % 0.06/0.26 # Creating start rules for all 1 conjectures. % 0.06/0.26 # There are 1 start rule candidates: % 0.06/0.26 # Found 5 unit axioms. % 0.06/0.26 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done. % 0.06/0.26 # Found closed tableau while making start rule % 0.06/0.26 # There were 0 total branch saturation attempts. % 0.06/0.26 # There were 0 of these attempts blocked. % 0.06/0.26 # There were 0 deferred branch saturation attempts. % 0.06/0.26 # There were 0 free duplicated saturations. % 0.06/0.26 # There were 0 total successful branch saturations. % 0.06/0.26 # There were 0 successful branch saturations in interreduction. % 0.06/0.26 # There were 0 successful branch saturations on the branch. % 0.06/0.26 # There were 0 successful branch saturations after the branch. % 0.06/0.26 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.26 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.26 # Begin clausification derivation % 0.06/0.26 % 0.06/0.26 # End clausification derivation % 0.06/0.26 # Begin listing active clauses obtained from FOF to CNF conversion % 0.06/0.26 cnf(i_0_3, plain, (x2(z,X1)=X1)). % 0.06/0.26 cnf(i_0_1, plain, (proj1S(s(X1))=X1)). % 0.06/0.26 cnf(i_0_4, plain, (s(x2(X1,X2))=x2(s(X1),X2))). % 0.06/0.26 cnf(i_0_2, plain, (s(X1)!=z)). % 0.06/0.26 cnf(i_0_5, negated_conjecture, (x2(X1,X1)!=X1)). % 0.06/0.26 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.06/0.26 # Begin printing tableau % 0.06/0.26 # Found 2 steps % 0.06/0.26 cnf(i_0_5, negated_conjecture, (x2(z,z)!=z), inference(start_rule)). % 0.06/0.26 cnf(i_0_6, plain, (x2(z,z)!=z), inference(closure_rule, [i_0_3])). % 0.06/0.26 # End printing tableau % 0.06/0.26 # SZS output end % 0.06/0.26 # Branches closed with saturation will be marked with an "s" % 0.06/0.26 # NOT attempting initial tableau saturation % 0.06/0.26 # 1 start rule tableaux created. % 0.06/0.26 # 0 extension rule candidate clauses % 0.06/0.26 # 5 unit axiom clauses % 0.06/0.26 % 0.06/0.26 # Proof search is over... % 0.06/0.26 # Freeing feature tree %------------------------------------------------------------------------------