%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX233-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 : n013.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:47 PM UTC 2026 % Result : Unsatisfiable 0.19s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SWX233-1 : TPTP v9.3.0. Released v9.3.0. % 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.34 % Computer : n013.cluster.edu % 0.15/0.34 % Model : x86_64 x86_64 % 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.34 % Memory : 8042.1875MB % 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.34 % CPULimit : 300 % 0.15/0.34 % WCLimit : 300 % 0.15/0.34 % DateTime : Tue May 5 13:06:25 EDT 2026 % 0.15/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 12 Number of unprocessed: 12 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 12 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 1 conjectures. % 0.19/0.37 # There are 1 start rule candidates: % 0.19/0.37 # Found 12 unit axioms. % 0.19/0.37 # 1 start rule tableaux created. % 0.19/0.37 # 0 extension rule candidate clauses % 0.19/0.37 # 12 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.37 # Creating equality axioms % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.37 # Returning from population with 23 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 23 tableaux to operate on % 0.19/0.38 # There were 1 total branch saturation attempts. % 0.19/0.38 # There were 0 of these attempts blocked. % 0.19/0.38 # There were 0 deferred branch saturation attempts. % 0.19/0.38 # There were 0 free duplicated saturations. % 0.19/0.38 # There were 1 total successful branch saturations. % 0.19/0.38 # There were 0 successful branch saturations in interreduction. % 0.19/0.38 # There were 0 successful branch saturations on the branch. % 0.19/0.38 # There were 1 successful branch saturations after the branch. % 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.38 # Begin clausification derivation % 0.19/0.38 % 0.19/0.38 # End clausification derivation % 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.38 cnf(i_0_18, plain, (g(btrue)=bfalse)). % 0.19/0.38 cnf(i_0_24, plain, (eq(btrue,bfalse)=bfalse)). % 0.19/0.38 cnf(i_0_23, plain, (eq(bfalse,btrue)=bfalse)). % 0.19/0.38 cnf(i_0_19, plain, (g(bfalse)=btrue)). % 0.19/0.38 cnf(i_0_16, plain, (h(nil)=nil)). % 0.19/0.38 cnf(i_0_20, plain, (f(nil)=btrue)). % 0.19/0.38 cnf(i_0_25, plain, (eq(X1,X1)=btrue)). % 0.19/0.38 cnf(i_0_14, plain, (aux(X1,btrue)=bfalse)). % 0.19/0.38 cnf(i_0_15, plain, (aux(X1,bfalse)=btrue)). % 0.19/0.38 cnf(i_0_17, plain, (h(cons(X1,X2))=X2)). % 0.19/0.38 cnf(i_0_21, plain, (f(cons(X1,X2))=aux(X2,f(X2)))). % 0.19/0.38 cnf(i_0_26, negated_conjecture, (eq(eq(f(X1),bfalse),bfalse)!=btrue)). % 0.19/0.38 cnf(i_0_28, plain, (X3=X3)). % 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.38 # Begin printing tableau % 0.19/0.38 # Found 6 steps % 0.19/0.38 cnf(i_0_18, plain, (g(btrue)=bfalse), inference(start_rule)). % 0.19/0.38 cnf(i_0_38, plain, (g(btrue)=bfalse), inference(extension_rule, [i_0_37])). % 0.19/0.38 cnf(i_0_71, plain, (g(btrue)!=bfalse), inference(closure_rule, [i_0_18])). % 0.19/0.38 cnf(i_0_70, plain, (eq(g(btrue),g(btrue))=eq(bfalse,bfalse)), inference(extension_rule, [i_0_31])). % 0.19/0.38 cnf(i_0_79, plain, (eq(bfalse,bfalse)!=btrue), inference(closure_rule, [i_0_25])). % 0.19/0.38 cnf(i_0_77, plain, (eq(g(btrue),g(btrue))=btrue), inference(etableau_closure_rule, [i_0_77, ...])). % 0.19/0.38 # End printing tableau % 0.19/0.38 # SZS output end % 0.19/0.38 # Branches closed with saturation will be marked with an "s" % 0.19/0.38 # There were 1 total branch saturation attempts. % 0.19/0.38 # There were 0 of these attempts blocked. % 0.19/0.38 # There were 0 deferred branch saturation attempts. % 0.19/0.38 # There were 0 free duplicated saturations. % 0.19/0.38 # There were 1 total successful branch saturations. % 0.19/0.38 # There were 0 successful branch saturations in interreduction. % 0.19/0.38 # There were 0 successful branch saturations on the branch. % 0.19/0.38 # There were 1 successful branch saturations after the branch. % 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.38 # Begin clausification derivation % 0.19/0.38 % 0.19/0.38 # End clausification derivation % 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.38 cnf(i_0_18, plain, (g(btrue)=bfalse)). % 0.19/0.38 cnf(i_0_24, plain, (eq(btrue,bfalse)=bfalse)). % 0.19/0.38 cnf(i_0_23, plain, (eq(bfalse,btrue)=bfalse)). % 0.19/0.38 cnf(i_0_19, plain, (g(bfalse)=btrue)). % 0.19/0.38 cnf(i_0_16, plain, (h(nil)=nil)). % 0.19/0.38 cnf(i_0_20, plain, (f(nil)=btrue)). % 0.19/0.38 cnf(i_0_25, plain, (eq(X1,X1)=btrue)). % 0.19/0.38 cnf(i_0_14, plain, (aux(X1,btrue)=bfalse)). % 0.19/0.38 cnf(i_0_15, plain, (aux(X1,bfalse)=btrue)). % 0.19/0.38 cnf(i_0_17, plain, (h(cons(X1,X2))=X2)). % 0.19/0.38 cnf(i_0_21, plain, (f(cons(X1,X2))=aux(X2,f(X2)))). % 0.19/0.38 cnf(i_0_26, negated_conjecture, (eq(eq(f(X1),bfalse),bfalse)!=btrue)). % 0.19/0.38 cnf(i_0_28, plain, (X3=X3)). % 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.38 # Begin printing tableau % 0.19/0.38 # Found 6 steps % 0.19/0.38 cnf(i_0_18, plain, (g(btrue)=bfalse), inference(start_rule)). % 0.19/0.38 cnf(i_0_38, plain, (g(btrue)=bfalse), inference(extension_rule, [i_0_37])). % 0.19/0.38 cnf(i_0_72, plain, (g(btrue)!=bfalse), inference(closure_rule, [i_0_18])). % 0.19/0.38 cnf(i_0_70, plain, (eq(g(btrue),g(btrue))=eq(bfalse,bfalse)), inference(extension_rule, [i_0_31])). % 0.19/0.38 cnf(i_0_79, plain, (eq(bfalse,bfalse)!=btrue), inference(closure_rule, [i_0_25])). % 0.19/0.38 cnf(i_0_77, plain, (eq(g(btrue),g(btrue))=btrue), inference(etableau_closure_rule, [i_0_77, ...])). % 0.19/0.38 # End printing tableau % 0.19/0.38 # SZS output end % 0.19/0.38 # Branches closed with saturation will be marked with an "s" % 0.19/0.38 # There were 1 total branch saturation attempts. % 0.19/0.38 # There were 0 of these attempts blocked. % 0.19/0.38 # There were 0 deferred branch saturation attempts. % 0.19/0.38 # There were 0 free duplicated saturations. % 0.19/0.38 # There were 1 total successful branch saturations. % 0.19/0.38 # There were 0 successful branch saturations in interreduction. % 0.19/0.38 # There were 0 successful branch saturations on the branch. % 0.19/0.38 # There were 1 successful branch saturations after the branch. % 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.38 # Begin clausification derivation % 0.19/0.38 % 0.19/0.38 # End clausification derivation % 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.38 cnf(i_0_18, plain, (g(btrue)=bfalse)). % 0.19/0.38 cnf(i_0_24, plain, (eq(btrue,bfalse)=bfalse)). % 0.19/0.38 cnf(i_0_23, plain, (eq(bfalse,btrue)=bfalse)). % 0.19/0.38 cnf(i_0_19, plain, (g(bfalse)=btrue)). % 0.19/0.38 cnf(i_0_16, plain, (h(nil)=nil)). % 0.19/0.38 cnf(i_0_20, plain, (f(nil)=btrue)). % 0.19/0.38 cnf(i_0_25, plain, (eq(X1,X1)=btrue)). % 0.19/0.38 cnf(i_0_14, plain, (aux(X1,btrue)=bfalse)). % 0.19/0.38 cnf(i_0_15, plain, (aux(X1,bfalse)=btrue)). % 0.19/0.38 cnf(i_0_17, plain, (h(cons(X1,X2))=X2)). % 0.19/0.38 cnf(i_0_21, plain, (f(cons(X1,X2))=aux(X2,f(X2)))). % 0.19/0.38 cnf(i_0_26, negated_conjecture, (eq(eq(f(X1),bfalse),bfalse)!=btrue)). % 0.19/0.38 cnf(i_0_28, plain, (X3=X3)). % 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.38 # Begin printing tableau % 0.19/0.38 # Found 5 steps % 0.19/0.38 cnf(i_0_18, plain, (g(btrue)=bfalse), inference(start_rule)). % 0.19/0.38 cnf(i_0_38, plain, (g(btrue)=bfalse), inference(extension_rule, [i_0_36])). % 0.19/0.38 cnf(i_0_68, plain, (f(g(btrue))=f(bfalse)), inference(extension_rule, [i_0_31])). % 0.19/0.38 cnf(i_0_79, plain, (f(bfalse)!=h(cons(X1,f(bfalse)))), inference(closure_rule, [i_0_17])). % 0.19/0.38 cnf(i_0_77, plain, (f(g(btrue))=h(cons(X1,f(bfalse)))), inference(etableau_closure_rule, [i_0_77, ...])). % 0.19/0.38 # End printing tableau % 0.19/0.38 # SZS output end % 0.19/0.38 # Branches closed with saturation will be marked with an "s" % 0.19/0.38 # Child (23065) has found a proof. % 0.19/0.38 % 0.19/0.38 # Proof search is over... % 0.19/0.38 # Freeing feature tree %------------------------------------------------------------------------------