%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ITP004+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 : n029.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:47:57 EDT 2022 % Result : Theorem 1.35s 0.54s % Output : CNFRefutation 1.35s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : ITP004+2 : TPTP v8.1.0. Bugfixed v7.5.0. % 0.06/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 : n029.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 02:22:47 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.12/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Number of axioms: 44 Number of unprocessed: 44 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 44 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 3 conjectures. % 0.12/0.37 # There are 3 start rule candidates: % 0.12/0.37 # Found 8 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 3 start rule tableaux created. % 0.12/0.37 # 36 extension rule candidate clauses % 0.12/0.37 # 8 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.12/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 13 tableaux to operate on % 1.35/0.54 # There were 2 total branch saturation attempts. % 1.35/0.54 # There were 0 of these attempts blocked. % 1.35/0.54 # There were 0 deferred branch saturation attempts. % 1.35/0.54 # There were 0 free duplicated saturations. % 1.35/0.54 # There were 2 total successful branch saturations. % 1.35/0.54 # There were 0 successful branch saturations in interreduction. % 1.35/0.54 # There were 0 successful branch saturations on the branch. % 1.35/0.54 # There were 2 successful branch saturations after the branch. % 1.35/0.54 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.35/0.54 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.35/0.54 # Begin clausification derivation % 1.35/0.54 % 1.35/0.54 # End clausification derivation % 1.35/0.54 # Begin listing active clauses obtained from FOF to CNF conversion % 1.35/0.54 cnf(i_0_1, plain, (ne(bool))). % 1.35/0.54 cnf(i_0_2, plain, (ne(ind))). % 1.35/0.54 cnf(i_0_44, negated_conjecture, (ne(esk4_0))). % 1.35/0.54 cnf(i_0_16, plain, (mem(c_2Ebool_2E_7E,arr(bool,bool)))). % 1.35/0.54 cnf(i_0_43, negated_conjecture, (mem(esk5_0,arr(esk4_0,bool)))). % 1.35/0.54 cnf(i_0_10, plain, (ap(i(X2),X1)=X1|~mem(X1,X2))). % 1.35/0.54 cnf(i_0_3, plain, (ne(arr(X1,X2))|~ne(X2)|~ne(X1))). % 1.35/0.54 cnf(i_0_5, plain, (X1=X2|p(X2)|p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 1.35/0.54 cnf(i_0_17, plain, (p(X1)|p(ap(c_2Ebool_2E_7E,X1))|~mem(X1,bool))). % 1.35/0.54 cnf(i_0_6, plain, (X1=X2|~p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 1.35/0.54 cnf(i_0_9, plain, (ap(k(X2,X3),X1)=X3|~mem(X1,X2))). % 1.35/0.54 cnf(i_0_18, plain, (~p(X1)|~mem(X1,bool)|~p(ap(c_2Ebool_2E_7E,X1)))). % 1.35/0.54 cnf(i_0_11, plain, (mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))))). % 1.35/0.54 cnf(i_0_19, plain, (mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))))). % 1.35/0.54 cnf(i_0_30, plain, (mem(c_2Ebool_2E_21(X1),arr(arr(X1,bool),bool))|~ne(X1))). % 1.35/0.54 cnf(i_0_27, plain, (mem(c_2Emin_2E_3D(X1),arr(X1,arr(X1,bool)))|~ne(X1))). % 1.35/0.54 cnf(i_0_24, plain, (mem(c_2Epred__set_2ECHOICE(X1),arr(arr(X1,bool),X1))|~ne(X1))). % 1.35/0.54 cnf(i_0_13, plain, (p(X1)|p(ap(ap(c_2Emin_2E_3D_3D_3E,X1),X2))|~mem(X2,bool)|~mem(X1,bool))). % 1.35/0.54 cnf(i_0_12, plain, (p(ap(ap(c_2Emin_2E_3D_3D_3E,X2),X1))|~p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 1.35/0.54 cnf(i_0_4, plain, (mem(ap(X1,X4),X3)|~mem(X4,X2)|~mem(X1,arr(X2,X3)))). % 1.35/0.54 cnf(i_0_20, plain, (p(ap(ap(c_2Ebool_2E_2F_5C,X1),X2))|~p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 1.35/0.54 cnf(i_0_26, plain, (mem(c_2Epred__set_2EREST(X1),arr(arr(X1,bool),arr(X1,bool)))|~ne(X1))). % 1.35/0.54 cnf(i_0_32, plain, (mem(esk2_2(X1,X2),X1)|p(ap(c_2Ebool_2E_21(X1),X2))|~ne(X1)|~mem(X2,arr(X1,bool)))). % 1.35/0.54 cnf(i_0_28, plain, (p(ap(ap(c_2Emin_2E_3D(X3),X1),X2))|X1!=X2|~ne(X3)|~mem(X2,X3)|~mem(X1,X3))). % 1.35/0.54 cnf(i_0_21, plain, (p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Ebool_2E_2F_5C,X2),X1)))). % 1.35/0.54 cnf(i_0_22, plain, (p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Ebool_2E_2F_5C,X1),X2)))). % 1.35/0.54 cnf(i_0_14, plain, (p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool)|~p(ap(ap(c_2Emin_2E_3D_3D_3E,X1),X2)))). % 1.35/0.54 cnf(i_0_41, plain, (ap(ap(c_2Epred__set_2EDELETE(X1),X2),ap(c_2Epred__set_2ECHOICE(X1),X2))=ap(c_2Epred__set_2EREST(X1),X2)|~ne(X1)|~mem(X2,arr(X1,bool)))). % 1.35/0.54 cnf(i_0_33, plain, (p(ap(X2,X3))|~ne(X1)|~mem(X3,X1)|~p(ap(c_2Ebool_2E_21(X1),X2))|~mem(X2,arr(X1,bool)))). % 1.35/0.54 cnf(i_0_23, plain, (mem(c_2Ebool_2EIN(X1),arr(X1,arr(arr(X1,bool),bool)))|~ne(X1))). % 1.35/0.54 cnf(i_0_29, plain, (X2=X3|~ne(X1)|~mem(X3,X1)|~mem(X2,X1)|~p(ap(ap(c_2Emin_2E_3D(X1),X2),X3)))). % 1.35/0.54 cnf(i_0_15, plain, (mem(c_2Epred__set_2ESUBSET(X1),arr(arr(X1,bool),arr(arr(X1,bool),bool)))|~ne(X1))). % 1.35/0.54 cnf(i_0_31, plain, (p(ap(c_2Ebool_2E_21(X2),X1))|~ne(X2)|~mem(X1,arr(X2,bool))|~p(ap(X1,esk2_2(X2,X1))))). % 1.35/0.54 cnf(i_0_25, plain, (mem(c_2Epred__set_2EDELETE(X1),arr(arr(X1,bool),arr(X1,arr(X1,bool))))|~ne(X1))). % 1.35/0.54 cnf(i_0_42, negated_conjecture, (~p(ap(ap(c_2Epred__set_2ESUBSET(esk4_0),ap(c_2Epred__set_2EREST(esk4_0),esk5_0)),esk5_0)))). % 1.35/0.54 cnf(i_0_36, plain, (mem(esk3_3(X1,X2,X3),X1)|p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))|~ne(X1)|~mem(X3,arr(X1,bool))|~mem(X2,arr(X1,bool)))). % 1.35/0.54 cnf(i_0_37, plain, (p(ap(ap(c_2Ebool_2EIN(X1),X4),X3))|~ne(X1)|~mem(X4,X1)|~mem(X3,arr(X1,bool))|~mem(X2,arr(X1,bool))|~p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))|~p(ap(ap(c_2Ebool_2EIN(X1),X4),X2)))). % 1.35/0.54 cnf(i_0_38, plain, (X2=X4|p(ap(ap(c_2Ebool_2EIN(X1),X2),ap(ap(c_2Epred__set_2EDELETE(X1),X3),X4)))|~ne(X1)|~mem(X4,X1)|~mem(X2,X1)|~mem(X3,arr(X1,bool))|~p(ap(ap(c_2Ebool_2EIN(X1),X2),X3)))). % 1.35/0.54 cnf(i_0_39, plain, (X1!=X2|~ne(X3)|~mem(X2,X3)|~mem(X1,X3)|~mem(X4,arr(X3,bool))|~p(ap(ap(c_2Ebool_2EIN(X3),X1),ap(ap(c_2Epred__set_2EDELETE(X3),X4),X2))))). % 1.35/0.54 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)))). % 1.35/0.54 cnf(i_0_40, plain, (p(ap(ap(c_2Ebool_2EIN(X1),X2),X3))|~ne(X1)|~mem(X4,X1)|~mem(X2,X1)|~mem(X3,arr(X1,bool))|~p(ap(ap(c_2Ebool_2EIN(X1),X2),ap(ap(c_2Epred__set_2EDELETE(X1),X3),X4))))). % 1.35/0.54 cnf(i_0_35, plain, (p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))|p(ap(ap(c_2Ebool_2EIN(X1),esk3_3(X1,X2,X3)),X2))|~ne(X1)|~mem(X3,arr(X1,bool))|~mem(X2,arr(X1,bool)))). % 1.35/0.54 cnf(i_0_34, plain, (p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))|~ne(X1)|~mem(X3,arr(X1,bool))|~mem(X2,arr(X1,bool))|~p(ap(ap(c_2Ebool_2EIN(X1),esk3_3(X1,X2,X3)),X3)))). % 1.35/0.54 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)))). % 1.35/0.54 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.35/0.54 # Begin printing tableau % 1.35/0.54 # Found 7 steps % 1.35/0.54 cnf(i_0_42, negated_conjecture, (~p(ap(ap(c_2Epred__set_2ESUBSET(esk4_0),ap(c_2Epred__set_2EREST(esk4_0),esk5_0)),esk5_0))), inference(start_rule)). % 1.35/0.54 cnf(i_0_45, plain, (~p(ap(ap(c_2Epred__set_2ESUBSET(esk4_0),ap(c_2Epred__set_2EREST(esk4_0),esk5_0)),esk5_0))), inference(extension_rule, [i_0_36])). % 1.35/0.54 cnf(i_0_142, plain, (~ne(esk4_0)), inference(closure_rule, [i_0_44])). % 1.35/0.54 cnf(i_0_143, plain, (~mem(esk5_0,arr(esk4_0,bool))), inference(closure_rule, [i_0_43])). % 1.35/0.54 cnf(i_0_140, plain, (mem(esk3_3(esk4_0,ap(c_2Epred__set_2EREST(esk4_0),esk5_0),esk5_0),esk4_0)), inference(extension_rule, [i_0_10])). % 1.35/0.54 cnf(i_0_144, plain, (~mem(ap(c_2Epred__set_2EREST(esk4_0),esk5_0),arr(esk4_0,bool))), inference(etableau_closure_rule, [i_0_144, ...])). % 1.35/0.54 cnf(i_0_189, plain, (ap(i(esk4_0),esk3_3(esk4_0,ap(c_2Epred__set_2EREST(esk4_0),esk5_0),esk5_0))=esk3_3(esk4_0,ap(c_2Epred__set_2EREST(esk4_0),esk5_0),esk5_0)), inference(etableau_closure_rule, [i_0_189, ...])). % 1.35/0.54 # End printing tableau % 1.35/0.54 # SZS output end % 1.35/0.54 # Branches closed with saturation will be marked with an "s" % 1.35/0.54 # Child (11995) has found a proof. % 1.35/0.54 % 1.35/0.54 # Proof search is over... % 1.35/0.54 # Freeing feature tree %------------------------------------------------------------------------------