%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX221+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 : n028.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:45 PM UTC 2026 % Result : Theorem 1.86s 2.03s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SWX221+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.15/0.33 % Computer : n028.cluster.edu % 0.15/0.33 % Model : x86_64 x86_64 % 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.33 % Memory : 8042.1875MB % 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.33 % CPULimit : 300 % 0.15/0.33 % WCLimit : 300 % 0.15/0.33 % DateTime : Tue May 5 12:29:45 EDT 2026 % 0.15/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN % 0.18/0.36 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 43 Number of unprocessed: 43 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 1.73/1.98 # The folding up rule is enabled... % 1.73/1.98 # Local unification is enabled... % 1.73/1.98 # Any saturation attempts will use folding labels... % 1.73/1.98 # 43 beginning clauses after preprocessing and clausification % 1.73/1.98 # Creating start rules for all 1 conjectures. % 1.73/1.98 # There are 1 start rule candidates: % 1.73/1.98 # Found 28 unit axioms. % 1.73/1.98 # 1 start rule tableaux created. % 1.73/1.98 # 15 extension rule candidate clauses % 1.73/1.98 # 28 unit axiom clauses % 1.73/1.98 % 1.73/1.98 # Requested 8, 32 cores available to the main process. % 1.73/1.98 # There are not enough tableaux to fork, creating more from the initial 1 % 1.86/2.03 # There were 1 total branch saturation attempts. % 1.86/2.03 # There were 0 of these attempts blocked. % 1.86/2.03 # There were 0 deferred branch saturation attempts. % 1.86/2.03 # There were 0 free duplicated saturations. % 1.86/2.03 # There were 1 total successful branch saturations. % 1.86/2.03 # There were 0 successful branch saturations in interreduction. % 1.86/2.03 # There were 0 successful branch saturations on the branch. % 1.86/2.03 # There were 1 successful branch saturations after the branch. % 1.86/2.03 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.86/2.03 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.86/2.03 # Begin clausification derivation % 1.86/2.03 % 1.86/2.03 # End clausification derivation % 1.86/2.03 # Begin listing active clauses obtained from FOF to CNF conversion % 1.86/2.03 cnf(i_0_30, plain, (nf(var(X1)))). % 1.86/2.03 cnf(i_0_31, plain, (index(nil,X1)=nothing)). % 1.86/2.03 cnf(i_0_12, plain, (proj1Suc(suc(X1))=X1)). % 1.86/2.03 cnf(i_0_14, plain, (proj1Just(just(X1))=X1)). % 1.86/2.03 cnf(i_0_19, plain, (proj1Lam(lam(X1))=X1)). % 1.86/2.03 cnf(i_0_20, plain, (proj1Var(var(X1))=X1)). % 1.86/2.03 cnf(i_0_4, plain, (proj1Arr(arr(X1,X2))=X1)). % 1.86/2.03 cnf(i_0_5, plain, (proj2Arr(arr(X1,X2))=X2)). % 1.86/2.03 cnf(i_0_1, plain, (head(cons(X1,X2))=X1)). % 1.86/2.03 cnf(i_0_2, plain, (tail(cons(X1,X2))=X2)). % 1.86/2.03 cnf(i_0_32, plain, (index(cons(X1,X2),zero)=just(X1))). % 1.86/2.03 cnf(i_0_16, plain, (proj1App(app(X1,X2,X3))=X1)). % 1.86/2.03 cnf(i_0_17, plain, (proj2App(app(X1,X2,X3))=X2)). % 1.86/2.03 cnf(i_0_18, plain, (proj3App(app(X1,X2,X3))=X3)). % 1.86/2.03 cnf(i_0_33, plain, (index(cons(X1,X2),suc(X3))=index(X2,X3))). % 1.86/2.03 cnf(i_0_9, plain, (a!=b)). % 1.86/2.03 cnf(i_0_10, plain, (c!=a)). % 1.86/2.03 cnf(i_0_11, plain, (c!=b)). % 1.86/2.03 cnf(i_0_6, plain, (arr(X1,X2)!=a)). % 1.86/2.03 cnf(i_0_7, plain, (arr(X1,X2)!=b)). % 1.86/2.03 cnf(i_0_13, plain, (suc(X1)!=zero)). % 1.86/2.03 cnf(i_0_15, plain, (just(X1)!=nothing)). % 1.86/2.03 cnf(i_0_3, plain, (cons(X1,X2)!=nil)). % 1.86/2.03 cnf(i_0_8, plain, (arr(X1,X2)!=c)). % 1.86/2.03 cnf(i_0_23, plain, (var(X1)!=lam(X2))). % 1.86/2.03 cnf(i_0_27, plain, (~nf(app(lam(X1),X2,X3)))). % 1.86/2.03 cnf(i_0_21, plain, (app(X1,X2,X3)!=lam(X4))). % 1.86/2.03 cnf(i_0_22, plain, (app(X1,X2,X3)!=var(X4))). % 1.86/2.03 cnf(i_0_43, negated_conjecture, (~tc(nil,X1,arr(arr(a,arr(b,c)),arr(b,arr(a,c))))|~nf(X1))). % 1.86/2.03 cnf(i_0_29, plain, (nf(X1)|~nf(lam(X1)))). % 1.86/2.03 cnf(i_0_28, plain, (nf(lam(X1))|~nf(X1))). % 1.86/2.03 cnf(i_0_40, plain, (index(X1,X2)!=nothing|~tc(X1,var(X2),X3))). % 1.86/2.03 cnf(i_0_35, plain, (tc(X1,X2,X3)|~tc(X1,app(X4,X2,X3),X5))). % 1.86/2.03 cnf(i_0_36, plain, (tc(X1,X2,arr(X3,X4))|~tc(X1,app(X2,X5,X3),X4))). % 1.86/2.03 cnf(i_0_39, plain, (tc(cons(X1,X2),X3,X4)|~tc(X2,lam(X3),arr(X1,X4)))). % 1.86/2.03 cnf(i_0_25, plain, (lam(proj1Lam(X1))=X1|nf(X2)|~nf(app(X1,X2,X3)))). % 1.86/2.03 cnf(i_0_26, plain, (lam(proj1Lam(X1))=X1|nf(X1)|~nf(app(X1,X2,X3)))). % 1.86/2.03 cnf(i_0_37, plain, (arr(proj1Arr(X1),proj2Arr(X1))=X1|~tc(X2,lam(X3),X1))). % 1.86/2.03 cnf(i_0_41, plain, (tc(X1,var(X2),X3)|index(X1,X2)!=just(X3))). % 1.86/2.03 cnf(i_0_42, plain, (X1=X2|index(X3,X4)!=just(X2)|~tc(X3,var(X4),X1))). % 1.86/2.03 cnf(i_0_38, plain, (tc(X1,lam(X2),arr(X3,X4))|~tc(cons(X3,X1),X2,X4))). % 1.86/2.03 cnf(i_0_34, plain, (tc(X1,app(X2,X3,X4),X5)|~tc(X1,X2,arr(X4,X5))|~tc(X1,X3,X4))). % 1.86/2.03 cnf(i_0_24, plain, (lam(proj1Lam(X1))=X1|nf(app(X1,X2,X3))|~nf(X2)|~nf(X1))). % 1.86/2.03 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.86/2.03 # Begin printing tableau % 1.86/2.03 # Found 6 steps % 1.86/2.03 cnf(i_0_43, negated_conjecture, (~tc(nil,var(X10),arr(arr(a,arr(b,c)),arr(b,arr(a,c))))|~nf(var(X10))), inference(start_rule)). % 1.86/2.03 cnf(i_0_46, plain, (~nf(var(X10))), inference(closure_rule, [i_0_30])). % 1.86/2.03 cnf(i_0_45, plain, (~tc(nil,var(X10),arr(arr(a,arr(b,c)),arr(b,arr(a,c))))), inference(extension_rule, [i_0_41])). % 1.86/2.03 cnf(i_0_68, plain, (index(nil,X10)!=just(arr(arr(a,arr(b,c)),arr(b,arr(a,c))))), inference(extension_rule, [i_0_42])). % 1.86/2.03 cnf(i_0_106, plain, (index(cons(just(arr(arr(a,arr(b,c)),arr(b,arr(a,c)))),X2),zero)!=just(just(arr(arr(a,arr(b,c)),arr(b,arr(a,c)))))), inference(closure_rule, [i_0_32])). % 1.86/2.03 cnf(i_0_107, plain, (~tc(cons(just(arr(arr(a,arr(b,c)),arr(b,arr(a,c)))),X2),var(zero),index(nil,X10))), inference(etableau_closure_rule, [i_0_107, ...])). % 1.86/2.03 # End printing tableau % 1.86/2.03 # SZS output end % 1.86/2.03 # Branches closed with saturation will be marked with an "s" % 1.86/2.03 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 1.86/2.03 # We now have 3 tableaux to operate on % 1.86/2.03 # Found closed tableau during pool population. % 1.86/2.03 # Proof search is over... % 1.86/2.03 # Freeing feature tree %------------------------------------------------------------------------------