%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ITP021+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 : n018.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:22 EDT 2022 % Result : Theorem 13.60s 2.14s % Output : CNFRefutation 13.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : ITP021+2 : TPTP v8.1.0. Bugfixed v7.5.0. % 0.13/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 : n018.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 : Fri Jun 3 21:45:17 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.39 # No SInE strategy applied % 0.20/0.39 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.20/0.39 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.20/0.39 # % 0.20/0.39 # Number of axioms: 82 Number of unprocessed: 82 % 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.39 # The folding up rule is enabled... % 0.20/0.39 # Local unification is enabled... % 0.20/0.39 # Any saturation attempts will use folding labels... % 0.20/0.39 # 82 beginning clauses after preprocessing and clausification % 0.20/0.39 # Creating start rules for all 6 conjectures. % 0.20/0.39 # There are 6 start rule candidates: % 0.20/0.39 # Found 16 unit axioms. % 0.20/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.39 # 6 start rule tableaux created. % 0.20/0.39 # 66 extension rule candidate clauses % 0.20/0.39 # 16 unit axiom clauses % 0.20/0.39 % 0.20/0.39 # Requested 8, 32 cores available to the main process. % 0.20/0.39 # There are not enough tableaux to fork, creating more from the initial 6 % 0.20/0.39 # Returning from population with 51 new_tableaux and 0 remaining starting tableaux. % 0.20/0.39 # We now have 51 tableaux to operate on % 13.60/2.14 # There were 5 total branch saturation attempts. % 13.60/2.14 # There were 0 of these attempts blocked. % 13.60/2.14 # There were 0 deferred branch saturation attempts. % 13.60/2.14 # There were 0 free duplicated saturations. % 13.60/2.14 # There were 5 total successful branch saturations. % 13.60/2.14 # There were 0 successful branch saturations in interreduction. % 13.60/2.14 # There were 0 successful branch saturations on the branch. % 13.60/2.14 # There were 5 successful branch saturations after the branch. % 13.60/2.14 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 13.60/2.14 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 13.60/2.14 # Begin clausification derivation % 13.60/2.14 % 13.60/2.14 # End clausification derivation % 13.60/2.14 # Begin listing active clauses obtained from FOF to CNF conversion % 13.60/2.14 cnf(i_0_1, plain, (ne(bool))). % 13.60/2.14 cnf(i_0_2, plain, (ne(ind))). % 13.60/2.14 cnf(i_0_13, plain, (ne(ty_2Eextreal_2Eextreal))). % 13.60/2.14 cnf(i_0_12, plain, (p(c_2Ebool_2ET))). % 13.60/2.14 cnf(i_0_18, plain, (~p(c_2Ebool_2EF))). % 13.60/2.14 cnf(i_0_11, plain, (mem(c_2Ebool_2ET,bool))). % 13.60/2.14 cnf(i_0_17, plain, (mem(c_2Ebool_2EF,bool))). % 13.60/2.14 cnf(i_0_121, negated_conjecture, (mem(esk3_0,ty_2Eextreal_2Eextreal))). % 13.60/2.14 cnf(i_0_120, negated_conjecture, (mem(esk4_0,ty_2Eextreal_2Eextreal))). % 13.60/2.14 cnf(i_0_119, negated_conjecture, (mem(esk5_0,ty_2Eextreal_2Eextreal))). % 13.60/2.14 cnf(i_0_54, plain, (epred1_1(X1)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_58, plain, (epred2_1(X1)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_31, plain, (mem(c_2Ebool_2E_7E,arr(bool,bool)))). % 13.60/2.14 cnf(i_0_10, plain, (ap(i(X2),X1)=X1|~mem(X1,X2))). % 13.60/2.14 cnf(i_0_3, plain, (ne(arr(X1,X2))|~ne(X2)|~ne(X1))). % 13.60/2.14 cnf(i_0_5, plain, (X1=X2|p(X2)|p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_32, plain, (p(X1)|p(ap(c_2Ebool_2E_7E,X1))|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_66, plain, (epred3_2(X2,X1)|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_6, plain, (X1=X2|~p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_9, plain, (ap(k(X2,X3),X1)=X3|~mem(X1,X2))). % 13.60/2.14 cnf(i_0_146, plain, (p(X2)|epred4_3(X3,X1,X2)|~p(X1))). % 13.60/2.14 cnf(i_0_145, plain, (p(X1)|epred4_3(X3,X2,X1)|~p(X2))). % 13.60/2.14 cnf(i_0_154, plain, (p(X1)|epred4_3(X2,X3,X1)|~p(X2))). % 13.60/2.14 cnf(i_0_157, plain, (p(X1)|epred4_3(X2,X3,X1)|~p(X2))). % 13.60/2.14 cnf(i_0_149, plain, (epred4_3(X2,X1,X3)|~p(X2)|~p(X1))). % 13.60/2.14 cnf(i_0_158, plain, (epred4_3(X2,X1,X3)|~p(X2)|~p(X1))). % 13.60/2.14 cnf(i_0_33, plain, (~p(X1)|~mem(X1,bool)|~p(ap(c_2Ebool_2E_7E,X1)))). % 13.60/2.14 cnf(i_0_151, plain, (p(X2)|p(X1)|epred4_3(X3,X2,X1)|~p(X3))). % 13.60/2.14 cnf(i_0_144, plain, (p(X2)|p(X1)|epred4_3(X1,X3,X2)|~p(X3))). % 13.60/2.14 cnf(i_0_132, plain, (p(X2)|p(X1)|epred4_3(X1,X2,X3)|~p(X3))). % 13.60/2.14 cnf(i_0_155, plain, (p(X2)|epred4_3(X3,X1,X2)|~p(X3)|~p(X1))). % 13.60/2.14 cnf(i_0_148, plain, (p(X1)|epred4_3(X2,X3,X1)|~p(X3)|~p(X2))). % 13.60/2.14 cnf(i_0_14, plain, (mem(c_2Eextreal_2Eextreal__le,arr(ty_2Eextreal_2Eextreal,arr(ty_2Eextreal_2Eextreal,bool))))). % 13.60/2.14 cnf(i_0_16, plain, (mem(c_2Eextreal_2Eextreal__max,arr(ty_2Eextreal_2Eextreal,arr(ty_2Eextreal_2Eextreal,ty_2Eextreal_2Eextreal))))). % 13.60/2.14 cnf(i_0_19, plain, (mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))))). % 13.60/2.14 cnf(i_0_23, plain, (mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))))). % 13.60/2.14 cnf(i_0_27, plain, (mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))))). % 13.60/2.14 cnf(i_0_140, plain, (epred4_3(X2,X1,X3)|~p(X3)|~p(X2)|~p(X1))). % 13.60/2.14 cnf(i_0_37, plain, (mem(c_2Ebool_2E_21(X1),arr(arr(X1,bool),bool))|~ne(X1))). % 13.60/2.14 cnf(i_0_34, plain, (mem(c_2Emin_2E_3D(X1),arr(X1,arr(X1,bool)))|~ne(X1))). % 13.60/2.14 cnf(i_0_161, plain, (p(X3)|p(X2)|p(X1)|~epred4_3(X1,X2,X3))). % 13.60/2.14 cnf(i_0_159, plain, (p(X1)|~p(X3)|~p(X2)|~epred4_3(X3,X1,X2))). % 13.60/2.14 cnf(i_0_160, plain, (p(X1)|~p(X3)|~p(X2)|~epred4_3(X1,X3,X2))). % 13.60/2.14 cnf(i_0_101, plain, (epred5_3(X1,X2,X3)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_102, plain, (epred6_3(X1,X2,X3)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_103, plain, (epred7_3(X1,X2,X3)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_21, plain, (p(X1)|p(ap(ap(c_2Emin_2E_3D_3D_3E,X1),X2))|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_20, plain, (p(ap(ap(c_2Emin_2E_3D_3D_3E,X2),X1))|~p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_24, plain, (p(ap(ap(c_2Ebool_2E_5C_2F,X2),X1))|~p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_25, plain, (p(ap(ap(c_2Ebool_2E_5C_2F,X1),X2))|~p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_4, plain, (mem(ap(X1,X4),X3)|~mem(X4,X2)|~mem(X1,arr(X2,X3)))). % 13.60/2.14 cnf(i_0_28, plain, (p(ap(ap(c_2Ebool_2E_2F_5C,X1),X2))|~p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_98, plain, (p(X3)|p(X2)|epred4_3(X1,X2,X3)|~p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_96, plain, (p(X3)|p(X1)|epred4_3(X1,X2,X3)|~p(X2)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_94, plain, (p(X2)|p(X1)|epred4_3(X1,X2,X3)|~p(X3)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_100, plain, (epred4_3(X1,X2,X3)|~p(X3)|~p(X2)|~p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool))). % 13.60/2.14 cnf(i_0_39, plain, (mem(esk2_2(X1,X2),X1)|p(ap(c_2Ebool_2E_21(X1),X2))|~ne(X1)|~mem(X2,arr(X1,bool)))). % 13.60/2.14 cnf(i_0_81, plain, (p(X3)|p(X2)|p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool)|~epred4_3(X3,X1,X2))). % 13.60/2.14 cnf(i_0_85, plain, (p(X3)|p(X2)|p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool)|~epred4_3(X3,X1,X2))). % 13.60/2.14 cnf(i_0_35, plain, (p(ap(ap(c_2Emin_2E_3D(X3),X1),X2))|X1!=X2|~ne(X3)|~mem(X2,X3)|~mem(X1,X3))). % 13.60/2.14 cnf(i_0_60, plain, (ap(ap(ap(c_2Ebool_2ECOND(X1),c_2Ebool_2ET),X2),X3)=X2|~ne(X1)|~mem(X3,X1)|~mem(X2,X1))). % 13.60/2.14 cnf(i_0_59, plain, (ap(ap(ap(c_2Ebool_2ECOND(X1),c_2Ebool_2EF),X2),X3)=X3|~ne(X1)|~mem(X3,X1)|~mem(X2,X1))). % 13.60/2.14 cnf(i_0_29, plain, (p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Ebool_2E_2F_5C,X2),X1)))). % 13.60/2.14 cnf(i_0_30, plain, (p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Ebool_2E_2F_5C,X1),X2)))). % 13.60/2.14 cnf(i_0_82, plain, (p(X3)|~p(X2)|~p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool)|~epred4_3(X3,X1,X2))). % 13.60/2.14 cnf(i_0_90, plain, (p(X3)|~p(X2)|~p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool)|~epred4_3(X3,X1,X2))). % 13.60/2.14 cnf(i_0_87, plain, (p(X2)|~p(X3)|~p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool)|~epred4_3(X3,X2,X1))). % 13.60/2.14 cnf(i_0_91, plain, (p(X2)|~p(X3)|~p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool)|~epred4_3(X3,X2,X1))). % 13.60/2.14 cnf(i_0_26, plain, (p(X2)|p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Ebool_2E_5C_2F,X1),X2)))). % 13.60/2.14 cnf(i_0_22, plain, (p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Emin_2E_3D_3D_3E,X1),X2)))). % 13.60/2.14 cnf(i_0_40, plain, (p(ap(X2,X3))|~ne(X1)|~mem(X3,X1)|~p(ap(c_2Ebool_2E_21(X1),X2))|~mem(X2,arr(X1,bool)))). % 13.60/2.14 cnf(i_0_68, plain, (p(ap(ap(c_2Eextreal_2Eextreal__le,X2),X1))|p(ap(ap(c_2Eextreal_2Eextreal__le,X1),X2))|~mem(X2,ty_2Eextreal_2Eextreal)|~mem(X1,ty_2Eextreal_2Eextreal))). % 13.60/2.14 cnf(i_0_15, plain, (mem(c_2Ebool_2ECOND(X1),arr(bool,arr(X1,arr(X1,X1))))|~ne(X1))). % 13.60/2.14 cnf(i_0_36, plain, (X2=X3|~ne(X1)|~mem(X3,X1)|~mem(X2,X1)|~p(ap(ap(c_2Emin_2E_3D(X1),X2),X3)))). % 13.60/2.14 cnf(i_0_38, plain, (p(ap(c_2Ebool_2E_21(X2),X1))|~ne(X2)|~mem(X1,arr(X2,bool))|~p(ap(X1,esk2_2(X2,X1))))). % 13.60/2.14 cnf(i_0_67, plain, (p(ap(ap(c_2Eextreal_2Eextreal__le,X1),X3))|~mem(X3,ty_2Eextreal_2Eextreal)|~mem(X2,ty_2Eextreal_2Eextreal)|~mem(X1,ty_2Eextreal_2Eextreal)|~p(ap(ap(c_2Eextreal_2Eextreal__le,X2),X3))|~p(ap(ap(c_2Eextreal_2Eextreal__le,X1),X2)))). % 13.60/2.14 cnf(i_0_117, negated_conjecture, (p(ap(ap(c_2Eextreal_2Eextreal__le,esk4_0),esk3_0))|p(ap(ap(c_2Eextreal_2Eextreal__le,ap(ap(c_2Eextreal_2Eextreal__max,esk4_0),esk5_0)),esk3_0)))). % 13.60/2.14 cnf(i_0_116, negated_conjecture, (p(ap(ap(c_2Eextreal_2Eextreal__le,esk5_0),esk3_0))|p(ap(ap(c_2Eextreal_2Eextreal__le,ap(ap(c_2Eextreal_2Eextreal__max,esk4_0),esk5_0)),esk3_0)))). % 13.60/2.14 cnf(i_0_69, plain, (ap(ap(ap(c_2Ebool_2ECOND(ty_2Eextreal_2Eextreal),ap(ap(c_2Eextreal_2Eextreal__le,X1),X2)),X2),X1)=ap(ap(c_2Eextreal_2Eextreal__max,X1),X2)|~mem(X2,ty_2Eextreal_2Eextreal)|~mem(X1,ty_2Eextreal_2Eextreal))). % 13.60/2.14 cnf(i_0_8, plain, (X3=X4|mem(esk1_4(X1,X2,X3,X4),X1)|~mem(X4,arr(X1,X2))|~mem(X3,arr(X1,X2)))). % 13.60/2.14 cnf(i_0_118, negated_conjecture, (~p(ap(ap(c_2Eextreal_2Eextreal__le,esk4_0),esk3_0))|~p(ap(ap(c_2Eextreal_2Eextreal__le,esk5_0),esk3_0))|~p(ap(ap(c_2Eextreal_2Eextreal__le,ap(ap(c_2Eextreal_2Eextreal__max,esk4_0),esk5_0)),esk3_0)))). % 13.60/2.14 cnf(i_0_7, plain, (X1=X4|ap(X1,esk1_4(X2,X3,X1,X4))!=ap(X4,esk1_4(X2,X3,X1,X4))|~mem(X4,arr(X2,X3))|~mem(X1,arr(X2,X3)))). % 13.60/2.14 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 13.60/2.14 # Begin printing tableau % 13.60/2.14 # Found 13 steps % 13.60/2.14 cnf(i_0_118, negated_conjecture, (~p(ap(ap(c_2Eextreal_2Eextreal__le,esk4_0),esk3_0))|~p(ap(ap(c_2Eextreal_2Eextreal__le,esk5_0),esk3_0))|~p(ap(ap(c_2Eextreal_2Eextreal__le,ap(ap(c_2Eextreal_2Eextreal__max,esk4_0),esk5_0)),esk3_0))), inference(start_rule)). % 13.60/2.14 cnf(i_0_297, plain, (~p(ap(ap(c_2Eextreal_2Eextreal__le,esk4_0),esk3_0))), inference(extension_rule, [i_0_67])). % 13.60/2.14 cnf(i_0_557, plain, (~mem(esk3_0,ty_2Eextreal_2Eextreal)), inference(closure_rule, [i_0_121])). % 13.60/2.14 cnf(i_0_558, plain, (~mem(esk5_0,ty_2Eextreal_2Eextreal)), inference(closure_rule, [i_0_119])). % 13.60/2.14 cnf(i_0_559, plain, (~mem(esk4_0,ty_2Eextreal_2Eextreal)), inference(closure_rule, [i_0_120])). % 13.60/2.14 cnf(i_0_560, plain, (~p(ap(ap(c_2Eextreal_2Eextreal__le,esk5_0),esk3_0))), inference(extension_rule, [i_0_5])). % 13.60/2.14 cnf(i_0_591, plain, (p(c_2Ebool_2EF)), inference(closure_rule, [i_0_18])). % 13.60/2.14 cnf(i_0_593, plain, (~mem(c_2Ebool_2EF,bool)), inference(closure_rule, [i_0_17])). % 13.60/2.14 cnf(i_0_298, plain, (~p(ap(ap(c_2Eextreal_2Eextreal__le,esk5_0),esk3_0))), inference(etableau_closure_rule, [i_0_298, ...])). % 13.60/2.14 cnf(i_0_299, plain, (~p(ap(ap(c_2Eextreal_2Eextreal__le,ap(ap(c_2Eextreal_2Eextreal__max,esk4_0),esk5_0)),esk3_0))), inference(etableau_closure_rule, [i_0_299, ...])). % 13.60/2.14 cnf(i_0_561, plain, (~p(ap(ap(c_2Eextreal_2Eextreal__le,esk4_0),esk5_0))), inference(etableau_closure_rule, [i_0_561, ...])). % 13.60/2.14 cnf(i_0_589, plain, (c_2Ebool_2EF=ap(ap(c_2Eextreal_2Eextreal__le,esk5_0),esk3_0)), inference(etableau_closure_rule, [i_0_589, ...])). % 13.60/2.14 cnf(i_0_592, plain, (~mem(ap(ap(c_2Eextreal_2Eextreal__le,esk5_0),esk3_0),bool)), inference(etableau_closure_rule, [i_0_592, ...])). % 13.60/2.14 # End printing tableau % 13.60/2.14 # SZS output end % 13.60/2.14 # Branches closed with saturation will be marked with an "s" % 13.74/2.15 # Child (17506) has found a proof. % 13.74/2.15 % 13.74/2.15 # Proof search is over... % 13.74/2.15 # Freeing feature tree %------------------------------------------------------------------------------