%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ITP011+2 : TPTP v8.1.0. Bugfixed v7.5.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 : n021.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 : 600s % DateTime : Sat Jul 16 22:48:07 EDT 2022 % Result : Theorem 13.28s 2.05s % Output : CNFRefutation 13.28s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : ITP011+2 : TPTP v8.1.0. Bugfixed v7.5.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n021.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Thu Jun 2 15:22:01 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.39 # No SInE strategy applied % 0.20/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.39 # % 0.20/0.39 # Presaturation interreduction done % 0.20/0.39 # Number of axioms: 95 Number of unprocessed: 93 % 0.20/0.39 # Tableaux proof search. % 0.20/0.39 # APR header successfully linked. % 0.20/0.39 # Hello from C++ % 0.20/0.40 # The folding up rule is enabled... % 0.20/0.40 # Local unification is enabled... % 0.20/0.40 # Any saturation attempts will use folding labels... % 0.20/0.40 # 93 beginning clauses after preprocessing and clausification % 0.20/0.40 # Creating start rules for all 6 conjectures. % 0.20/0.40 # There are 6 start rule candidates: % 0.20/0.40 # Found 14 unit axioms. % 0.20/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.40 # 6 start rule tableaux created. % 0.20/0.40 # 79 extension rule candidate clauses % 0.20/0.40 # 14 unit axiom clauses % 0.20/0.40 % 0.20/0.40 # Requested 8, 32 cores available to the main process. % 0.20/0.40 # There are not enough tableaux to fork, creating more from the initial 6 % 0.20/0.40 # Returning from population with 27 new_tableaux and 0 remaining starting tableaux. % 0.20/0.40 # We now have 27 tableaux to operate on % 13.28/2.05 # There were 8 total branch saturation attempts. % 13.28/2.05 # There were 0 of these attempts blocked. % 13.28/2.05 # There were 0 deferred branch saturation attempts. % 13.28/2.05 # There were 0 free duplicated saturations. % 13.28/2.05 # There were 8 total successful branch saturations. % 13.28/2.05 # There were 0 successful branch saturations in interreduction. % 13.28/2.05 # There were 0 successful branch saturations on the branch. % 13.28/2.05 # There were 8 successful branch saturations after the branch. % 13.28/2.05 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 13.28/2.05 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 13.28/2.05 # Begin clausification derivation % 13.28/2.05 % 13.28/2.05 # End clausification derivation % 13.28/2.05 # Begin listing active clauses obtained from FOF to CNF conversion % 13.28/2.05 cnf(i_0_1, plain, (ne(bool))). % 13.28/2.05 cnf(i_0_87, negated_conjecture, (ne(esk7_0))). % 13.28/2.05 cnf(i_0_85, negated_conjecture, (mem(esk9_0,esk7_0))). % 13.28/2.05 cnf(i_0_84, negated_conjecture, (mem(esk10_0,esk7_0))). % 13.28/2.05 cnf(i_0_86, negated_conjecture, (mem(esk8_0,arr(esk7_0,arr(esk7_0,bool))))). % 13.28/2.05 cnf(i_0_2, plain, (ne(ind))). % 13.28/2.05 cnf(i_0_23, plain, (p(c_2Ebool_2ET))). % 13.28/2.05 cnf(i_0_20, plain, (mem(c_2Ebool_2EF,bool))). % 13.28/2.05 cnf(i_0_22, plain, (mem(c_2Ebool_2ET,bool))). % 13.28/2.05 cnf(i_0_25, plain, (mem(c_2Ebool_2E_7E,arr(bool,bool)))). % 13.28/2.05 cnf(i_0_15, plain, (mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))))). % 13.28/2.05 cnf(i_0_35, plain, (mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))))). % 13.28/2.05 cnf(i_0_39, plain, (mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))))). % 13.28/2.05 cnf(i_0_21, plain, (~p(c_2Ebool_2EF))). % 13.28/2.05 cnf(i_0_64, plain, (epred1_1(X1)|~mem(X1,bool))). % 13.28/2.05 cnf(i_0_65, plain, (epred2_1(X1)|~mem(X1,bool))). % 13.28/2.05 cnf(i_0_68, plain, (epred3_1(X1)|~mem(X1,bool))). % 13.28/2.05 cnf(i_0_11, plain, (ne(ty_2Eoption_2Eoption(X1))|~ne(X1))). % 13.28/2.05 cnf(i_0_27, plain, (~p(ap(c_2Ebool_2E_7E,X1))|~p(X1)|~mem(X1,bool))). % 13.28/2.05 cnf(i_0_3, plain, (ne(arr(X1,X2))|~ne(X2)|~ne(X1))). % 13.28/2.05 cnf(i_0_107, plain, (~epred4_5(X1,X2,X3,X4,X5)|~p(ap(c_2Eoption_2EIS__SOME(X1),c_2Eoption_2ENONE(X1))))). % 13.28/2.05 cnf(i_0_34, plain, (mem(c_2Eoption_2ENONE(X1),ty_2Eoption_2Eoption(X1))|~ne(X1))). % 13.28/2.05 cnf(i_0_10, plain, (ap(i(X1),X2)=X2|~mem(X2,X1))). % 13.28/2.05 cnf(i_0_26, plain, (p(ap(c_2Ebool_2E_7E,X1))|p(X1)|~mem(X1,bool))). % 13.28/2.05 cnf(i_0_83, negated_conjecture, (p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),ap(c_2Eoption_2ESOME(esk7_0),esk9_0)),c_2Eoption_2ENONE(esk7_0)))|p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),c_2Eoption_2ENONE(esk7_0)),ap(c_2Eoption_2ESOME(esk7_0),esk10_0)))|~p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),ap(c_2Eoption_2ESOME(esk7_0),esk9_0)),ap(c_2Eoption_2ESOME(esk7_0),esk10_0)))|~p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),c_2Eoption_2ENONE(esk7_0)),c_2Eoption_2ENONE(esk7_0)))|~p(ap(ap(esk8_0,esk9_0),esk10_0)))). % 13.28/2.05 cnf(i_0_30, plain, (mem(c_2Ebool_2E_3F(X1),arr(arr(X1,bool),bool))|~ne(X1))). % 13.28/2.05 cnf(i_0_47, plain, (mem(c_2Ebool_2E_21(X1),arr(arr(X1,bool),bool))|~ne(X1))). % 13.28/2.05 cnf(i_0_5, plain, (X1=X2|p(X1)|p(X2)|~mem(X2,bool)|~mem(X1,bool))). % 13.28/2.05 cnf(i_0_19, plain, (mem(c_2Eoption_2EIS__NONE(X1),arr(ty_2Eoption_2Eoption(X1),bool))|~ne(X1))). % 13.28/2.05 cnf(i_0_6, plain, (X1=X2|~p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 13.28/2.05 cnf(i_0_110, plain, (ap(c_2Eoption_2ESOME(X1),X2)!=c_2Eoption_2ENONE(X1)|~epred4_5(X1,X3,X4,X5,X6)|~mem(X2,X1))). % 13.28/2.05 cnf(i_0_37, plain, (p(X1)|~p(ap(ap(c_2Ebool_2E_2F_5C,X2),X1))|~mem(X2,bool)|~mem(X1,bool))). % 13.28/2.05 cnf(i_0_24, plain, (mem(c_2Eoption_2EIS__SOME(X1),arr(ty_2Eoption_2Eoption(X1),bool))|~ne(X1))). % 13.28/2.05 cnf(i_0_38, plain, (p(X1)|~p(ap(ap(c_2Ebool_2E_2F_5C,X1),X2))|~mem(X2,bool)|~mem(X1,bool))). % 13.28/2.05 cnf(i_0_82, negated_conjecture, (p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),ap(c_2Eoption_2ESOME(esk7_0),esk9_0)),ap(c_2Eoption_2ESOME(esk7_0),esk10_0)))|p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),ap(c_2Eoption_2ESOME(esk7_0),esk9_0)),c_2Eoption_2ENONE(esk7_0)))|p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),c_2Eoption_2ENONE(esk7_0)),ap(c_2Eoption_2ESOME(esk7_0),esk10_0)))|p(ap(ap(esk8_0,esk9_0),esk10_0))|~p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),c_2Eoption_2ENONE(esk7_0)),c_2Eoption_2ENONE(esk7_0))))). % 13.28/2.05 cnf(i_0_18, plain, (p(X1)|~p(ap(ap(c_2Emin_2E_3D_3D_3E,X2),X1))|~p(X2)|~mem(X1,bool)|~mem(X2,bool))). % 13.28/2.05 cnf(i_0_29, plain, (mem(c_2Eoption_2ESOME(X1),arr(X1,ty_2Eoption_2Eoption(X1)))|~ne(X1))). % 13.28/2.05 cnf(i_0_9, plain, (ap(k(X1,X2),X3)=X2|~mem(X3,X1))). % 13.28/2.05 cnf(i_0_28, plain, (mem(c_2Eoption_2ETHE(X1),arr(ty_2Eoption_2Eoption(X1),X1))|~ne(X1))). % 13.28/2.05 cnf(i_0_62, plain, (mem(esk4_2(X1,X2),X1)|~p(X2)|~mem(X2,bool)|~ne(X1))). % 13.28/2.05 cnf(i_0_46, plain, (X1=X2|~p(ap(ap(c_2Emin_2E_3D(X3),X1),X2))|~mem(X2,X3)|~mem(X1,X3)|~ne(X3))). % 13.28/2.05 cnf(i_0_44, plain, (mem(c_2Emin_2E_3D(X1),arr(X1,arr(X1,bool)))|~ne(X1))). % 13.28/2.05 cnf(i_0_42, plain, (p(X1)|p(X2)|~p(ap(ap(c_2Ebool_2E_5C_2F,X1),X2))|~mem(X2,bool)|~mem(X1,bool))). % 13.28/2.05 cnf(i_0_16, plain, (p(ap(ap(c_2Emin_2E_3D_3D_3E,X1),X2))|~p(X2)|~mem(X1,bool)|~mem(X2,bool))). % 13.28/2.05 cnf(i_0_40, plain, (p(ap(ap(c_2Ebool_2E_5C_2F,X1),X2))|~p(X2)|~mem(X1,bool)|~mem(X2,bool))). % 13.28/2.05 cnf(i_0_41, plain, (p(ap(ap(c_2Ebool_2E_5C_2F,X1),X2))|~p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 13.28/2.05 cnf(i_0_12, plain, (mem(c_2Eoption_2EOPTION__JOIN(X1),arr(ty_2Eoption_2Eoption(ty_2Eoption_2Eoption(X1)),ty_2Eoption_2Eoption(X1)))|~ne(X1))). % 13.28/2.05 cnf(i_0_17, plain, (p(ap(ap(c_2Emin_2E_3D_3D_3E,X1),X2))|p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 13.28/2.05 cnf(i_0_4, plain, (mem(ap(X1,X2),X3)|~mem(X1,arr(X4,X3))|~mem(X2,X4))). % 13.28/2.05 cnf(i_0_106, plain, (X1=c_2Eoption_2ENONE(X2)|~epred4_5(X2,X3,X4,X5,X6)|~p(ap(c_2Eoption_2EIS__NONE(X2),X1))|~mem(X1,ty_2Eoption_2Eoption(X2)))). % 13.28/2.05 cnf(i_0_48, plain, (p(ap(c_2Ebool_2E_21(X1),X2))|~p(ap(X2,esk3_2(X1,X2)))|~mem(X2,arr(X1,bool))|~ne(X1))). % 13.28/2.05 cnf(i_0_33, plain, (mem(esk2_2(X1,X2),X1)|~p(ap(c_2Ebool_2E_3F(X1),X2))|~mem(X2,arr(X1,bool))|~ne(X1))). % 13.28/2.05 cnf(i_0_36, plain, (p(ap(ap(c_2Ebool_2E_2F_5C,X1),X2))|~p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 13.28/2.05 cnf(i_0_32, plain, (p(ap(X1,esk2_2(X2,X1)))|~p(ap(c_2Ebool_2E_3F(X2),X1))|~mem(X1,arr(X2,bool))|~ne(X2))). % 13.28/2.05 cnf(i_0_50, plain, (p(ap(X1,X2))|~p(ap(c_2Ebool_2E_21(X3),X1))|~mem(X1,arr(X3,bool))|~mem(X2,X3)|~ne(X3))). % 13.28/2.05 cnf(i_0_45, plain, (p(ap(ap(c_2Emin_2E_3D(X1),X2),X2))|~mem(X2,X1)|~ne(X1))). % 13.28/2.05 cnf(i_0_49, plain, (p(ap(c_2Ebool_2E_21(X1),X2))|mem(esk3_2(X1,X2),X1)|~mem(X2,arr(X1,bool))|~ne(X1))). % 13.28/2.05 cnf(i_0_92, plain, (ap(c_2Eoption_2EOPTION__JOIN(X1),c_2Eoption_2ENONE(ty_2Eoption_2Eoption(X1)))=c_2Eoption_2ENONE(X1)|~epred4_5(X1,X2,X3,X4,X5))). % 13.28/2.05 cnf(i_0_113, plain, (X1=X2|ap(c_2Eoption_2ESOME(X3),X1)!=ap(c_2Eoption_2ESOME(X3),X2)|~epred4_5(X3,X4,X5,X6,X7)|~mem(X2,X3)|~mem(X1,X3))). % 13.28/2.05 cnf(i_0_69, plain, (epred4_5(X1,X2,X3,X4,X5)|~mem(X4,arr(X1,X2))|~mem(X5,ty_2Eoption_2Eoption(X1))|~mem(X3,X2)|~ne(X2)|~ne(X1))). % 13.28/2.05 cnf(i_0_105, plain, (p(ap(c_2Eoption_2EIS__NONE(X1),c_2Eoption_2ENONE(X1)))|~epred4_5(X1,X2,X3,X4,X5)|~mem(c_2Eoption_2ENONE(X1),ty_2Eoption_2Eoption(X1)))). % 13.28/2.05 cnf(i_0_13, plain, (mem(c_2Eoption_2EOPTION__MAP(X1,X2),arr(arr(X1,X2),arr(ty_2Eoption_2Eoption(X1),ty_2Eoption_2Eoption(X2))))|~ne(X2)|~ne(X1))). % 13.28/2.05 cnf(i_0_31, plain, (p(ap(c_2Ebool_2E_3F(X1),X2))|~p(ap(X2,X3))|~mem(X2,arr(X1,bool))|~mem(X3,X1)|~ne(X1))). % 13.28/2.05 cnf(i_0_108, plain, (p(ap(c_2Eoption_2EIS__SOME(X1),ap(c_2Eoption_2ESOME(X1),X2)))|~epred4_5(X1,X3,X4,X5,X6)|~mem(X2,X1))). % 13.28/2.05 cnf(i_0_111, plain, (ap(c_2Eoption_2ETHE(X1),ap(c_2Eoption_2ESOME(X1),X2))=X2|~epred4_5(X1,X3,X4,X5,X6)|~mem(X2,X1))). % 13.28/2.05 cnf(i_0_43, plain, (mem(c_2Eoption_2EOPTREL(X1,X2),arr(arr(X1,arr(X2,bool)),arr(ty_2Eoption_2Eoption(X1),arr(ty_2Eoption_2Eoption(X2),bool))))|~ne(X2)|~ne(X1))). % 13.28/2.05 cnf(i_0_14, plain, (mem(c_2Eoption_2Eoption__CASE(X1,X2),arr(ty_2Eoption_2Eoption(X1),arr(X2,arr(arr(X1,X2),X2))))|~ne(X2)|~ne(X1))). % 13.28/2.05 cnf(i_0_8, plain, (X1=X2|mem(esk1_4(X3,X4,X1,X2),X3)|~mem(X2,arr(X3,X4))|~mem(X1,arr(X3,X4)))). % 13.28/2.05 cnf(i_0_7, plain, (X1=X2|ap(X1,esk1_4(X3,X4,X1,X2))!=ap(X2,esk1_4(X3,X4,X1,X2))|~mem(X2,arr(X3,X4))|~mem(X1,arr(X3,X4)))). % 13.28/2.05 cnf(i_0_104, plain, (X1=c_2Eoption_2ENONE(X2)|p(ap(c_2Eoption_2EIS__SOME(X2),X1))|~epred4_5(X2,X3,X4,X5,X6)|~mem(X1,ty_2Eoption_2Eoption(X2)))). % 13.28/2.05 cnf(i_0_91, plain, (ap(c_2Eoption_2EOPTION__JOIN(X1),ap(c_2Eoption_2ESOME(ty_2Eoption_2Eoption(X1)),X2))=X2|~epred4_5(X1,X3,X4,X5,X6)|~mem(X2,ty_2Eoption_2Eoption(X1)))). % 13.28/2.05 cnf(i_0_93, plain, (ap(ap(c_2Eoption_2EOPTION__MAP(X1,X2),X3),c_2Eoption_2ENONE(X1))=c_2Eoption_2ENONE(X2)|~epred4_5(X1,X2,X4,X5,X6)|~mem(X3,arr(X1,X2)))). % 13.28/2.05 cnf(i_0_102, plain, (ap(c_2Eoption_2ESOME(X1),ap(c_2Eoption_2ETHE(X1),X2))=X2|~epred4_5(X1,X3,X4,X5,X6)|~p(ap(c_2Eoption_2EIS__SOME(X1),X2))|~mem(X2,ty_2Eoption_2Eoption(X1)))). % 13.28/2.05 cnf(i_0_71, plain, (p(ap(ap(ap(c_2Eoption_2EOPTREL(X1,X2),X3),c_2Eoption_2ENONE(X1)),c_2Eoption_2ENONE(X2)))|~mem(X3,arr(X1,arr(X2,bool)))|~ne(X2)|~ne(X1))). % 13.28/2.05 cnf(i_0_100, plain, (ap(ap(ap(c_2Eoption_2Eoption__CASE(X1,ty_2Eoption_2Eoption(X1)),X2),X2),c_2Eoption_2ESOME(X1))=X2|~epred4_5(X1,X3,X4,X5,X6)|~mem(X2,ty_2Eoption_2Eoption(X1)))). % 13.28/2.05 cnf(i_0_96, plain, (ap(ap(ap(c_2Eoption_2Eoption__CASE(X1,X2),c_2Eoption_2ENONE(X1)),X3),X4)=X3|~epred4_5(X1,X2,X5,X6,X7)|~mem(X4,arr(X1,X2))|~mem(X3,X2))). % 13.28/2.05 cnf(i_0_101, plain, (ap(ap(ap(c_2Eoption_2Eoption__CASE(X1,ty_2Eoption_2Eoption(X1)),X2),c_2Eoption_2ENONE(X1)),c_2Eoption_2ESOME(X1))=X2|~epred4_5(X1,X3,X4,X5,X6)|~mem(X2,ty_2Eoption_2Eoption(X1)))). % 13.28/2.05 cnf(i_0_99, plain, (ap(ap(ap(c_2Eoption_2Eoption__CASE(X1,X2),X3),X4),X5)=X4|~epred4_5(X1,X2,X4,X5,X6)|~p(ap(c_2Eoption_2EIS__NONE(X1),X3))|~mem(X3,ty_2Eoption_2Eoption(X1)))). % 13.28/2.05 cnf(i_0_97, plain, (ap(ap(ap(c_2Eoption_2Eoption__CASE(X1,ty_2Eoption_2Eoption(X1)),X2),X3),c_2Eoption_2ESOME(X1))=X2|~epred4_5(X1,X4,X5,X6,X3)|~p(ap(c_2Eoption_2EIS__SOME(X1),X2))|~mem(X2,ty_2Eoption_2Eoption(X1)))). % 13.28/2.05 cnf(i_0_94, plain, (ap(ap(c_2Eoption_2EOPTION__MAP(X1,X2),X3),ap(c_2Eoption_2ESOME(X1),X4))=ap(c_2Eoption_2ESOME(X2),ap(X3,X4))|~epred4_5(X1,X2,X5,X6,X7)|~mem(X3,arr(X1,X2))|~mem(X4,X1))). % 13.28/2.05 cnf(i_0_76, plain, (X1=c_2Eoption_2ENONE(X2)|mem(esk5_5(X3,X2,X4,X5,X1),X3)|~p(ap(ap(ap(c_2Eoption_2EOPTREL(X3,X2),X4),X5),X1))|~mem(X4,arr(X3,arr(X2,bool)))|~mem(X1,ty_2Eoption_2Eoption(X2))|~mem(X5,ty_2Eoption_2Eoption(X3))|~ne(X2)|~ne(X3))). % 13.28/2.05 cnf(i_0_95, plain, (ap(ap(ap(c_2Eoption_2Eoption__CASE(X1,X2),ap(c_2Eoption_2ESOME(X1),X3)),X4),X5)=ap(X5,X3)|~epred4_5(X1,X2,X6,X7,X8)|~mem(X5,arr(X1,X2))|~mem(X4,X2)|~mem(X3,X1))). % 13.28/2.05 cnf(i_0_75, plain, (X1=c_2Eoption_2ENONE(X2)|mem(esk6_5(X3,X2,X4,X5,X1),X2)|~p(ap(ap(ap(c_2Eoption_2EOPTREL(X3,X2),X4),X5),X1))|~mem(X4,arr(X3,arr(X2,bool)))|~mem(X1,ty_2Eoption_2Eoption(X2))|~mem(X5,ty_2Eoption_2Eoption(X3))|~ne(X2)|~ne(X3))). % 13.28/2.05 cnf(i_0_81, plain, (X1=c_2Eoption_2ENONE(X2)|mem(esk5_5(X2,X3,X4,X1,X5),X2)|~p(ap(ap(ap(c_2Eoption_2EOPTREL(X2,X3),X4),X1),X5))|~mem(X4,arr(X2,arr(X3,bool)))|~mem(X5,ty_2Eoption_2Eoption(X3))|~mem(X1,ty_2Eoption_2Eoption(X2))|~ne(X3)|~ne(X2))). % 13.28/2.05 cnf(i_0_80, plain, (X1=c_2Eoption_2ENONE(X2)|mem(esk6_5(X2,X3,X4,X1,X5),X3)|~p(ap(ap(ap(c_2Eoption_2EOPTREL(X2,X3),X4),X1),X5))|~mem(X4,arr(X2,arr(X3,bool)))|~mem(X5,ty_2Eoption_2Eoption(X3))|~mem(X1,ty_2Eoption_2Eoption(X2))|~ne(X3)|~ne(X2))). % 13.28/2.05 cnf(i_0_74, plain, (ap(c_2Eoption_2ESOME(X1),esk5_5(X1,X2,X3,X4,X5))=X4|X5=c_2Eoption_2ENONE(X2)|~p(ap(ap(ap(c_2Eoption_2EOPTREL(X1,X2),X3),X4),X5))|~mem(X3,arr(X1,arr(X2,bool)))|~mem(X5,ty_2Eoption_2Eoption(X2))|~mem(X4,ty_2Eoption_2Eoption(X1))|~ne(X2)|~ne(X1))). % 13.28/2.05 cnf(i_0_70, plain, (p(ap(ap(ap(c_2Eoption_2EOPTREL(X1,X2),X3),ap(c_2Eoption_2ESOME(X1),X4)),ap(c_2Eoption_2ESOME(X2),X5)))|~p(ap(ap(X3,X4),X5))|~mem(X3,arr(X1,arr(X2,bool)))|~mem(ap(c_2Eoption_2ESOME(X2),X5),ty_2Eoption_2Eoption(X2))|~mem(ap(c_2Eoption_2ESOME(X1),X4),ty_2Eoption_2Eoption(X1))|~mem(X5,X2)|~mem(X4,X1)|~ne(X2)|~ne(X1))). % 13.28/2.05 cnf(i_0_98, plain, (ap(ap(ap(c_2Eoption_2Eoption__CASE(X1,X2),X3),X4),X5)=ap(X5,ap(c_2Eoption_2ETHE(X1),X3))|~epred4_5(X1,X2,X4,X5,X6)|~p(ap(c_2Eoption_2EIS__SOME(X1),X3))|~mem(X3,ty_2Eoption_2Eoption(X1)))). % 13.28/2.05 cnf(i_0_78, plain, (ap(c_2Eoption_2ESOME(X1),esk6_5(X2,X1,X3,X4,X5))=X5|X4=c_2Eoption_2ENONE(X2)|~p(ap(ap(ap(c_2Eoption_2EOPTREL(X2,X1),X3),X4),X5))|~mem(X3,arr(X2,arr(X1,bool)))|~mem(X4,ty_2Eoption_2Eoption(X2))|~mem(X5,ty_2Eoption_2Eoption(X1))|~ne(X2)|~ne(X1))). % 13.28/2.05 cnf(i_0_79, plain, (ap(c_2Eoption_2ESOME(X1),esk5_5(X1,X2,X3,X4,X5))=X4|X4=c_2Eoption_2ENONE(X1)|~p(ap(ap(ap(c_2Eoption_2EOPTREL(X1,X2),X3),X4),X5))|~mem(X3,arr(X1,arr(X2,bool)))|~mem(X5,ty_2Eoption_2Eoption(X2))|~mem(X4,ty_2Eoption_2Eoption(X1))|~ne(X2)|~ne(X1))). % 13.28/2.05 cnf(i_0_73, plain, (ap(c_2Eoption_2ESOME(X1),esk6_5(X2,X1,X3,X4,X5))=X5|X5=c_2Eoption_2ENONE(X1)|~p(ap(ap(ap(c_2Eoption_2EOPTREL(X2,X1),X3),X4),X5))|~mem(X3,arr(X2,arr(X1,bool)))|~mem(X4,ty_2Eoption_2Eoption(X2))|~mem(X5,ty_2Eoption_2Eoption(X1))|~ne(X2)|~ne(X1))). % 13.28/2.05 cnf(i_0_72, plain, (X1=c_2Eoption_2ENONE(X2)|p(ap(ap(X3,esk5_5(X4,X2,X3,X5,X1)),esk6_5(X4,X2,X3,X5,X1)))|~p(ap(ap(ap(c_2Eoption_2EOPTREL(X4,X2),X3),X5),X1))|~mem(X3,arr(X4,arr(X2,bool)))|~mem(X1,ty_2Eoption_2Eoption(X2))|~mem(X5,ty_2Eoption_2Eoption(X4))|~ne(X2)|~ne(X4))). % 13.28/2.05 cnf(i_0_77, plain, (X1=c_2Eoption_2ENONE(X2)|p(ap(ap(X3,esk5_5(X2,X4,X3,X1,X5)),esk6_5(X2,X4,X3,X1,X5)))|~p(ap(ap(ap(c_2Eoption_2EOPTREL(X2,X4),X3),X1),X5))|~mem(X3,arr(X2,arr(X4,bool)))|~mem(X5,ty_2Eoption_2Eoption(X4))|~mem(X1,ty_2Eoption_2Eoption(X2))|~ne(X4)|~ne(X2))). % 13.28/2.05 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 13.28/2.05 # Begin printing tableau % 13.28/2.05 # Found 15 steps % 13.28/2.05 cnf(i_0_82, negated_conjecture, (p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),ap(c_2Eoption_2ESOME(esk7_0),esk9_0)),ap(c_2Eoption_2ESOME(esk7_0),esk10_0)))|p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),ap(c_2Eoption_2ESOME(esk7_0),esk9_0)),c_2Eoption_2ENONE(esk7_0)))|p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),c_2Eoption_2ENONE(esk7_0)),ap(c_2Eoption_2ESOME(esk7_0),esk10_0)))|p(ap(ap(esk8_0,esk9_0),esk10_0))|~p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),c_2Eoption_2ENONE(esk7_0)),c_2Eoption_2ENONE(esk7_0)))), inference(start_rule)). % 13.28/2.05 cnf(i_0_121, plain, (p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),ap(c_2Eoption_2ESOME(esk7_0),esk9_0)),ap(c_2Eoption_2ESOME(esk7_0),esk10_0)))), inference(extension_rule, [i_0_72])). % 13.28/2.05 cnf(i_0_437, plain, (~mem(esk8_0,arr(esk7_0,arr(esk7_0,bool)))), inference(closure_rule, [i_0_86])). % 13.28/2.05 cnf(i_0_440, plain, (~ne(esk7_0)), inference(closure_rule, [i_0_87])). % 13.28/2.05 cnf(i_0_441, plain, (~ne(esk7_0)), inference(closure_rule, [i_0_87])). % 13.28/2.05 cnf(i_0_434, plain, (ap(c_2Eoption_2ESOME(esk7_0),esk10_0)=c_2Eoption_2ENONE(esk7_0)), inference(extension_rule, [i_0_110])). % 13.28/2.05 cnf(i_0_501, plain, (~mem(esk10_0,esk7_0)), inference(closure_rule, [i_0_84])). % 13.28/2.05 cnf(i_0_122, plain, (p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),ap(c_2Eoption_2ESOME(esk7_0),esk9_0)),c_2Eoption_2ENONE(esk7_0)))), inference(etableau_closure_rule, [i_0_122, ...])). % 13.28/2.05 cnf(i_0_123, plain, (p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),c_2Eoption_2ENONE(esk7_0)),ap(c_2Eoption_2ESOME(esk7_0),esk10_0)))), inference(etableau_closure_rule, [i_0_123, ...])). % 13.28/2.05 cnf(i_0_124, plain, (p(ap(ap(esk8_0,esk9_0),esk10_0))), inference(etableau_closure_rule, [i_0_124, ...])). % 13.28/2.05 cnf(i_0_125, plain, (~p(ap(ap(ap(c_2Eoption_2EOPTREL(esk7_0,esk7_0),esk8_0),c_2Eoption_2ENONE(esk7_0)),c_2Eoption_2ENONE(esk7_0)))), inference(etableau_closure_rule, [i_0_125, ...])). % 13.28/2.05 cnf(i_0_435, plain, (p(ap(ap(esk8_0,esk5_5(esk7_0,esk7_0,esk8_0,ap(c_2Eoption_2ESOME(esk7_0),esk9_0),ap(c_2Eoption_2ESOME(esk7_0),esk10_0))),esk6_5(esk7_0,esk7_0,esk8_0,ap(c_2Eoption_2ESOME(esk7_0),esk9_0),ap(c_2Eoption_2ESOME(esk7_0),esk10_0))))), inference(etableau_closure_rule, [i_0_435, ...])). % 13.28/2.05 cnf(i_0_438, plain, (~mem(ap(c_2Eoption_2ESOME(esk7_0),esk10_0),ty_2Eoption_2Eoption(esk7_0))), inference(etableau_closure_rule, [i_0_438, ...])). % 13.28/2.05 cnf(i_0_439, plain, (~mem(ap(c_2Eoption_2ESOME(esk7_0),esk9_0),ty_2Eoption_2Eoption(esk7_0))), inference(etableau_closure_rule, [i_0_439, ...])). % 13.28/2.05 cnf(i_0_500, plain, (~epred4_5(esk7_0,X9,X10,X11,X12)), inference(etableau_closure_rule, [i_0_500, ...])). % 13.28/2.05 # End printing tableau % 13.28/2.05 # SZS output end % 13.28/2.05 # Branches closed with saturation will be marked with an "s" % 13.28/2.06 # Child (9148) has found a proof. % 13.28/2.06 % 13.28/2.06 # Proof search is over... % 13.28/2.06 # Freeing feature tree %------------------------------------------------------------------------------