TSTP Solution File: ITP010+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : ITP010+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 : n025.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:06 EDT 2022
% Result : Theorem 0.19s 0.37s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ITP010+2 : TPTP v8.1.0. Bugfixed v7.5.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.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jun 3 03:16:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.19/0.37 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Number of axioms: 67 Number of unprocessed: 67
% 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 # 67 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 10 unit axioms.
% 0.19/0.37 # Closed tableau found in foldup close cycle with 0 folds and 0 closures done.
% 0.19/0.37 # Found closed tableau while making start rule
% 0.19/0.37 # There were 0 total branch saturation attempts.
% 0.19/0.37 # There were 0 of these attempts blocked.
% 0.19/0.37 # There were 0 deferred branch saturation attempts.
% 0.19/0.37 # There were 0 free duplicated saturations.
% 0.19/0.37 # There were 0 total successful branch saturations.
% 0.19/0.37 # There were 0 successful branch saturations in interreduction.
% 0.19/0.37 # There were 0 successful branch saturations on the branch.
% 0.19/0.37 # There were 0 successful branch saturations after the branch.
% 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 # Begin clausification derivation
% 0.19/0.37
% 0.19/0.37 # End clausification derivation
% 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.37 cnf(i_0_91, negated_conjecture, ($false)).
% 0.19/0.37 cnf(i_0_1, plain, (ne(bool))).
% 0.19/0.37 cnf(i_0_2, plain, (ne(ind))).
% 0.19/0.37 cnf(i_0_12, plain, (p(c_2Ebool_2ET))).
% 0.19/0.37 cnf(i_0_15, plain, (~p(c_2Ebool_2EF))).
% 0.19/0.37 cnf(i_0_11, plain, (mem(c_2Ebool_2ET,bool))).
% 0.19/0.37 cnf(i_0_14, plain, (mem(c_2Ebool_2EF,bool))).
% 0.19/0.37 cnf(i_0_43, plain, (epred1_1(X1)|~mem(X1,bool))).
% 0.19/0.37 cnf(i_0_46, plain, (epred2_1(X1)|~mem(X1,bool))).
% 0.19/0.37 cnf(i_0_28, plain, (mem(c_2Ebool_2E_7E,arr(bool,bool)))).
% 0.19/0.37 cnf(i_0_10, plain, (ap(i(X2),X1)=X1|~mem(X1,X2))).
% 0.19/0.37 cnf(i_0_3, plain, (ne(arr(X1,X2))|~ne(X2)|~ne(X1))).
% 0.19/0.37 cnf(i_0_5, plain, (X1=X2|p(X2)|p(X1)|~mem(X2,bool)|~mem(X1,bool))).
% 0.19/0.37 cnf(i_0_29, plain, (p(X1)|p(ap(c_2Ebool_2E_7E,X1))|~mem(X1,bool))).
% 0.19/0.37 cnf(i_0_6, plain, (X1=X2|~p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool))).
% 0.19/0.37 cnf(i_0_9, plain, (ap(k(X2,X3),X1)=X3|~mem(X1,X2))).
% 0.19/0.37 cnf(i_0_108, plain, (p(X2)|epred3_3(X3,X1,X2)|~p(X1))).
% 0.19/0.37 cnf(i_0_107, plain, (p(X1)|epred3_3(X3,X2,X1)|~p(X2))).
% 0.19/0.37 cnf(i_0_116, plain, (p(X1)|epred3_3(X2,X3,X1)|~p(X2))).
% 0.19/0.37 cnf(i_0_119, plain, (p(X1)|epred3_3(X2,X3,X1)|~p(X2))).
% 0.19/0.37 cnf(i_0_111, plain, (epred3_3(X2,X1,X3)|~p(X2)|~p(X1))).
% 0.19/0.37 cnf(i_0_120, plain, (epred3_3(X2,X1,X3)|~p(X2)|~p(X1))).
% 0.19/0.37 cnf(i_0_30, plain, (~p(X1)|~mem(X1,bool)|~p(ap(c_2Ebool_2E_7E,X1)))).
% 0.19/0.37 cnf(i_0_113, plain, (p(X2)|p(X1)|epred3_3(X3,X2,X1)|~p(X3))).
% 0.19/0.37 cnf(i_0_106, plain, (p(X2)|p(X1)|epred3_3(X1,X3,X2)|~p(X3))).
% 0.19/0.37 cnf(i_0_94, plain, (p(X2)|p(X1)|epred3_3(X1,X2,X3)|~p(X3))).
% 0.19/0.37 cnf(i_0_42, plain, (p(X2)|mem(esk3_2(X1,X2),X1)|~ne(X1)|~mem(X2,bool))).
% 0.19/0.37 cnf(i_0_117, plain, (p(X2)|epred3_3(X3,X1,X2)|~p(X3)|~p(X1))).
% 0.19/0.37 cnf(i_0_110, plain, (p(X1)|epred3_3(X2,X3,X1)|~p(X3)|~p(X2))).
% 0.19/0.37 cnf(i_0_16, plain, (mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))))).
% 0.19/0.37 cnf(i_0_20, plain, (mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))))).
% 0.19/0.37 cnf(i_0_24, plain, (mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))))).
% 0.19/0.37 cnf(i_0_102, plain, (epred3_3(X2,X1,X3)|~p(X3)|~p(X2)|~p(X1))).
% 0.19/0.37 cnf(i_0_34, plain, (mem(c_2Ebool_2E_21(X1),arr(arr(X1,bool),bool))|~ne(X1))).
% 0.19/0.37 cnf(i_0_31, plain, (mem(c_2Emin_2E_3D(X1),arr(X1,arr(X1,bool)))|~ne(X1))).
% 0.19/0.37 cnf(i_0_123, plain, (p(X3)|p(X2)|p(X1)|~epred3_3(X1,X2,X3))).
% 0.19/0.37 cnf(i_0_121, plain, (p(X1)|~p(X3)|~p(X2)|~epred3_3(X3,X1,X2))).
% 0.19/0.37 cnf(i_0_122, plain, (p(X1)|~p(X3)|~p(X2)|~epred3_3(X1,X3,X2))).
% 0.19/0.37 cnf(i_0_18, plain, (p(X1)|p(ap(ap(c_2Emin_2E_3D_3D_3E,X1),X2))|~mem(X2,bool)|~mem(X1,bool))).
% 0.19/0.37 cnf(i_0_17, plain, (p(ap(ap(c_2Emin_2E_3D_3D_3E,X2),X1))|~p(X1)|~mem(X2,bool)|~mem(X1,bool))).
% 0.19/0.37 cnf(i_0_21, plain, (p(ap(ap(c_2Ebool_2E_5C_2F,X2),X1))|~p(X1)|~mem(X2,bool)|~mem(X1,bool))).
% 0.19/0.37 cnf(i_0_22, plain, (p(ap(ap(c_2Ebool_2E_5C_2F,X1),X2))|~p(X1)|~mem(X2,bool)|~mem(X1,bool))).
% 0.19/0.37 cnf(i_0_4, plain, (mem(ap(X1,X4),X3)|~mem(X4,X2)|~mem(X1,arr(X2,X3)))).
% 0.19/0.37 cnf(i_0_25, plain, (p(ap(ap(c_2Ebool_2E_2F_5C,X1),X2))|~p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool))).
% 0.19/0.37 cnf(i_0_76, plain, (p(X3)|p(X2)|epred3_3(X1,X2,X3)|~p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool))).
% 0.19/0.37 cnf(i_0_74, plain, (p(X3)|p(X1)|epred3_3(X1,X2,X3)|~p(X2)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool))).
% 0.19/0.37 cnf(i_0_72, plain, (p(X2)|p(X1)|epred3_3(X1,X2,X3)|~p(X3)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool))).
% 0.19/0.37 cnf(i_0_78, plain, (epred3_3(X1,X2,X3)|~p(X3)|~p(X2)|~p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool))).
% 0.19/0.37 cnf(i_0_36, plain, (mem(esk2_2(X1,X2),X1)|p(ap(c_2Ebool_2E_21(X1),X2))|~ne(X1)|~mem(X2,arr(X1,bool)))).
% 0.19/0.37 cnf(i_0_59, plain, (p(X3)|p(X2)|p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool)|~epred3_3(X3,X1,X2))).
% 0.19/0.37 cnf(i_0_63, plain, (p(X3)|p(X2)|p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool)|~epred3_3(X3,X1,X2))).
% 0.19/0.37 cnf(i_0_32, plain, (p(ap(ap(c_2Emin_2E_3D(X3),X1),X2))|X1!=X2|~ne(X3)|~mem(X2,X3)|~mem(X1,X3))).
% 0.19/0.37 cnf(i_0_26, plain, (p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Ebool_2E_2F_5C,X2),X1)))).
% 0.19/0.37 cnf(i_0_27, plain, (p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Ebool_2E_2F_5C,X1),X2)))).
% 0.19/0.37 cnf(i_0_60, plain, (p(X3)|~p(X2)|~p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool)|~epred3_3(X3,X1,X2))).
% 0.19/0.37 cnf(i_0_68, plain, (p(X3)|~p(X2)|~p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool)|~epred3_3(X3,X1,X2))).
% 0.19/0.37 cnf(i_0_65, plain, (p(X2)|~p(X3)|~p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool)|~epred3_3(X3,X2,X1))).
% 0.19/0.37 cnf(i_0_69, plain, (p(X2)|~p(X3)|~p(X1)|~mem(X3,bool)|~mem(X2,bool)|~mem(X1,bool)|~epred3_3(X3,X2,X1))).
% 0.19/0.37 cnf(i_0_23, plain, (p(X2)|p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Ebool_2E_5C_2F,X1),X2)))).
% 0.19/0.37 cnf(i_0_19, plain, (p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Emin_2E_3D_3D_3E,X1),X2)))).
% 0.19/0.37 cnf(i_0_37, plain, (p(ap(X2,X3))|~ne(X1)|~mem(X3,X1)|~p(ap(c_2Ebool_2E_21(X1),X2))|~mem(X2,arr(X1,bool)))).
% 0.19/0.37 cnf(i_0_33, plain, (X2=X3|~ne(X1)|~mem(X3,X1)|~mem(X2,X1)|~p(ap(ap(c_2Emin_2E_3D(X1),X2),X3)))).
% 0.19/0.37 cnf(i_0_35, plain, (p(ap(c_2Ebool_2E_21(X2),X1))|~ne(X2)|~mem(X1,arr(X2,bool))|~p(ap(X1,esk2_2(X2,X1))))).
% 0.19/0.37 cnf(i_0_13, plain, (mem(c_2Ecardinal_2Ecardleq(X1,X2),arr(arr(X1,bool),arr(arr(X2,bool),bool)))|~ne(X2)|~ne(X1))).
% 0.19/0.37 cnf(i_0_47, plain, (p(ap(ap(c_2Ecardinal_2Ecardleq(X2,X1),X4),X3))|p(ap(ap(c_2Ecardinal_2Ecardleq(X1,X2),X3),X4))|~ne(X2)|~ne(X1)|~mem(X4,arr(X2,bool))|~mem(X3,arr(X1,bool)))).
% 0.19/0.37 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)))).
% 0.19/0.37 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)))).
% 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.37 # Begin printing tableau
% 0.19/0.37 # Found 1 steps
% 0.19/0.37 cnf(i_0_91, negated_conjecture, ($false), inference(start_rule)).
% 0.19/0.37 # End printing tableau
% 0.19/0.37 # SZS output end
% 0.19/0.37 # Branches closed with saturation will be marked with an "s"
% 0.19/0.37 # NOT attempting initial tableau saturation
% 0.19/0.37 # 1 start rule tableaux created.
% 0.19/0.37 # 57 extension rule candidate clauses
% 0.19/0.37 # 10 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Proof search is over...
% 0.19/0.37 # Freeing feature tree
%------------------------------------------------------------------------------