%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ITP018+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 : n019.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:18 EDT 2022 % Result : Theorem 0.12s 0.38s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : ITP018+2 : TPTP v8.1.0. Bugfixed v7.5.0. % 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n019.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Thu Jun 2 12:56:55 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___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 34 Number of unprocessed: 34 % 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 # 34 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 9 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 # 25 extension rule candidate clauses % 0.12/0.37 # 9 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 33 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 33 tableaux to operate on % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 1 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 1 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_36, negated_conjecture, (ne(esk3_0))). % 0.12/0.38 cnf(i_0_35, negated_conjecture, (ne(esk4_0))). % 0.12/0.38 cnf(i_0_1, plain, (ne(bool))). % 0.12/0.38 cnf(i_0_2, plain, (ne(ind))). % 0.12/0.38 cnf(i_0_11, plain, (ne(ty_2Erealax_2Ereal))). % 0.12/0.38 cnf(i_0_22, plain, (p(c_2Ebool_2ET))). % 0.12/0.38 cnf(i_0_21, plain, (mem(c_2Ebool_2ET,bool))). % 0.12/0.38 cnf(i_0_12, plain, (mem(c_2Erealax_2Ereal__neg,arr(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)))). % 0.12/0.38 cnf(i_0_34, negated_conjecture, (ap(c_2Ebinary__ieee_2Efloat__to__real(esk3_0,esk4_0),ap(c_2Ebinary__ieee_2Efloat__negate(esk3_0,esk4_0),ap(c_2Ebinary__ieee_2Efloat__plus__min(esk3_0,esk4_0),c_2Ebool_2Ethe__value(ty_2Epair_2Eprod(esk3_0,esk4_0)))))!=ap(c_2Erealax_2Ereal__neg,ap(c_2Ebinary__ieee_2Eulp(esk3_0,esk4_0),c_2Ebool_2Ethe__value(ty_2Epair_2Eprod(esk3_0,esk4_0)))))). % 0.12/0.38 cnf(i_0_16, plain, (ne(ty_2Ebool_2Eitself(X1))|~ne(X1))). % 0.12/0.38 cnf(i_0_3, plain, (ne(arr(X1,X2))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_13, plain, (ne(ty_2Ebinary__ieee_2Efloat(X1,X2))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_15, plain, (ne(ty_2Epair_2Eprod(X1,X2))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_19, plain, (mem(c_2Ebool_2Ethe__value(X1),ty_2Ebool_2Eitself(X1))|~ne(X1))). % 0.12/0.38 cnf(i_0_10, plain, (ap(i(X1),X2)=X2|~mem(X2,X1))). % 0.12/0.38 cnf(i_0_9, plain, (ap(k(X1,X2),X3)=X2|~mem(X3,X1))). % 0.12/0.38 cnf(i_0_5, plain, (X1=X2|p(X1)|p(X2)|~mem(X2,bool)|~mem(X1,bool))). % 0.12/0.38 cnf(i_0_26, plain, (mem(c_2Ebool_2E_21(X1),arr(arr(X1,bool),bool))|~ne(X1))). % 0.12/0.38 cnf(i_0_6, plain, (X1=X2|~p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 0.12/0.38 cnf(i_0_25, plain, (X1=X2|~p(ap(ap(c_2Emin_2E_3D(X3),X1),X2))|~mem(X2,X3)|~mem(X1,X3)|~ne(X3))). % 0.12/0.38 cnf(i_0_4, plain, (mem(ap(X1,X2),X3)|~mem(X1,arr(X4,X3))|~mem(X2,X4))). % 0.12/0.38 cnf(i_0_27, plain, (p(ap(c_2Ebool_2E_21(X1),X2))|~p(ap(X2,esk2_2(X1,X2)))|~mem(X2,arr(X1,bool))|~ne(X1))). % 0.12/0.38 cnf(i_0_23, plain, (mem(c_2Emin_2E_3D(X1),arr(X1,arr(X1,bool)))|~ne(X1))). % 0.12/0.38 cnf(i_0_18, plain, (mem(c_2Ebinary__ieee_2Efloat__to__real(X1,X2),arr(ty_2Ebinary__ieee_2Efloat(X1,X2),ty_2Erealax_2Ereal))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_20, plain, (mem(c_2Ebinary__ieee_2Eulp(X1,X2),arr(ty_2Ebool_2Eitself(ty_2Epair_2Eprod(X1,X2)),ty_2Erealax_2Ereal))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_24, plain, (p(ap(ap(c_2Emin_2E_3D(X1),X2),X2))|~mem(X2,X1)|~ne(X1))). % 0.12/0.38 cnf(i_0_28, plain, (p(ap(c_2Ebool_2E_21(X1),X2))|mem(esk2_2(X1,X2),X1)|~mem(X2,arr(X1,bool))|~ne(X1))). % 0.12/0.38 cnf(i_0_14, plain, (mem(c_2Ebinary__ieee_2Efloat__negate(X1,X2),arr(ty_2Ebinary__ieee_2Efloat(X1,X2),ty_2Ebinary__ieee_2Efloat(X1,X2)))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_29, plain, (p(ap(X1,X2))|~p(ap(c_2Ebool_2E_21(X3),X1))|~mem(X1,arr(X3,bool))|~mem(X2,X3)|~ne(X3))). % 0.12/0.38 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)))). % 0.12/0.38 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)))). % 0.12/0.38 cnf(i_0_17, plain, (mem(c_2Ebinary__ieee_2Efloat__plus__min(X1,X2),arr(ty_2Ebool_2Eitself(ty_2Epair_2Eprod(X1,X2)),ty_2Ebinary__ieee_2Efloat(X1,X2)))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_31, plain, (ap(c_2Ebinary__ieee_2Efloat__to__real(X1,X2),ap(c_2Ebinary__ieee_2Efloat__plus__min(X1,X2),c_2Ebool_2Ethe__value(ty_2Epair_2Eprod(X1,X2))))=ap(c_2Ebinary__ieee_2Eulp(X1,X2),c_2Ebool_2Ethe__value(ty_2Epair_2Eprod(X1,X2)))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_30, plain, (ap(c_2Ebinary__ieee_2Efloat__to__real(X1,X2),ap(c_2Ebinary__ieee_2Efloat__negate(X1,X2),X3))=ap(c_2Erealax_2Ereal__neg,ap(c_2Ebinary__ieee_2Efloat__to__real(X1,X2),X3))|~mem(X3,ty_2Ebinary__ieee_2Efloat(X1,X2))|~ne(X2)|~ne(X1))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 5 steps % 0.12/0.38 cnf(i_0_36, negated_conjecture, (ne(esk3_0)), inference(start_rule)). % 0.12/0.38 cnf(i_0_40, plain, (ne(esk3_0)), inference(extension_rule, [i_0_16])). % 0.12/0.38 cnf(i_0_205, plain, (ne(ty_2Ebool_2Eitself(esk3_0))), inference(extension_rule, [i_0_3])). % 0.12/0.38 cnf(i_0_209, plain, (~ne(bool)), inference(closure_rule, [i_0_1])). % 0.12/0.38 cnf(i_0_207, plain, (ne(arr(bool,ty_2Ebool_2Eitself(esk3_0)))), inference(etableau_closure_rule, [i_0_207, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 1 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 1 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_36, negated_conjecture, (ne(esk3_0))). % 0.12/0.38 cnf(i_0_35, negated_conjecture, (ne(esk4_0))). % 0.12/0.38 cnf(i_0_1, plain, (ne(bool))). % 0.12/0.38 cnf(i_0_2, plain, (ne(ind))). % 0.12/0.38 cnf(i_0_11, plain, (ne(ty_2Erealax_2Ereal))). % 0.12/0.38 cnf(i_0_22, plain, (p(c_2Ebool_2ET))). % 0.12/0.38 cnf(i_0_21, plain, (mem(c_2Ebool_2ET,bool))). % 0.12/0.38 cnf(i_0_12, plain, (mem(c_2Erealax_2Ereal__neg,arr(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)))). % 0.12/0.38 cnf(i_0_34, negated_conjecture, (ap(c_2Ebinary__ieee_2Efloat__to__real(esk3_0,esk4_0),ap(c_2Ebinary__ieee_2Efloat__negate(esk3_0,esk4_0),ap(c_2Ebinary__ieee_2Efloat__plus__min(esk3_0,esk4_0),c_2Ebool_2Ethe__value(ty_2Epair_2Eprod(esk3_0,esk4_0)))))!=ap(c_2Erealax_2Ereal__neg,ap(c_2Ebinary__ieee_2Eulp(esk3_0,esk4_0),c_2Ebool_2Ethe__value(ty_2Epair_2Eprod(esk3_0,esk4_0)))))). % 0.12/0.38 cnf(i_0_16, plain, (ne(ty_2Ebool_2Eitself(X1))|~ne(X1))). % 0.12/0.38 cnf(i_0_3, plain, (ne(arr(X1,X2))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_13, plain, (ne(ty_2Ebinary__ieee_2Efloat(X1,X2))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_15, plain, (ne(ty_2Epair_2Eprod(X1,X2))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_19, plain, (mem(c_2Ebool_2Ethe__value(X1),ty_2Ebool_2Eitself(X1))|~ne(X1))). % 0.12/0.38 cnf(i_0_10, plain, (ap(i(X1),X2)=X2|~mem(X2,X1))). % 0.12/0.38 cnf(i_0_9, plain, (ap(k(X1,X2),X3)=X2|~mem(X3,X1))). % 0.12/0.38 cnf(i_0_5, plain, (X1=X2|p(X1)|p(X2)|~mem(X2,bool)|~mem(X1,bool))). % 0.12/0.38 cnf(i_0_26, plain, (mem(c_2Ebool_2E_21(X1),arr(arr(X1,bool),bool))|~ne(X1))). % 0.12/0.38 cnf(i_0_6, plain, (X1=X2|~p(X2)|~p(X1)|~mem(X2,bool)|~mem(X1,bool))). % 0.12/0.38 cnf(i_0_25, plain, (X1=X2|~p(ap(ap(c_2Emin_2E_3D(X3),X1),X2))|~mem(X2,X3)|~mem(X1,X3)|~ne(X3))). % 0.12/0.38 cnf(i_0_4, plain, (mem(ap(X1,X2),X3)|~mem(X1,arr(X4,X3))|~mem(X2,X4))). % 0.12/0.38 cnf(i_0_27, plain, (p(ap(c_2Ebool_2E_21(X1),X2))|~p(ap(X2,esk2_2(X1,X2)))|~mem(X2,arr(X1,bool))|~ne(X1))). % 0.12/0.38 cnf(i_0_23, plain, (mem(c_2Emin_2E_3D(X1),arr(X1,arr(X1,bool)))|~ne(X1))). % 0.12/0.38 cnf(i_0_18, plain, (mem(c_2Ebinary__ieee_2Efloat__to__real(X1,X2),arr(ty_2Ebinary__ieee_2Efloat(X1,X2),ty_2Erealax_2Ereal))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_20, plain, (mem(c_2Ebinary__ieee_2Eulp(X1,X2),arr(ty_2Ebool_2Eitself(ty_2Epair_2Eprod(X1,X2)),ty_2Erealax_2Ereal))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_24, plain, (p(ap(ap(c_2Emin_2E_3D(X1),X2),X2))|~mem(X2,X1)|~ne(X1))). % 0.12/0.38 cnf(i_0_28, plain, (p(ap(c_2Ebool_2E_21(X1),X2))|mem(esk2_2(X1,X2),X1)|~mem(X2,arr(X1,bool))|~ne(X1))). % 0.12/0.38 cnf(i_0_14, plain, (mem(c_2Ebinary__ieee_2Efloat__negate(X1,X2),arr(ty_2Ebinary__ieee_2Efloat(X1,X2),ty_2Ebinary__ieee_2Efloat(X1,X2)))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_29, plain, (p(ap(X1,X2))|~p(ap(c_2Ebool_2E_21(X3),X1))|~mem(X1,arr(X3,bool))|~mem(X2,X3)|~ne(X3))). % 0.12/0.38 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)))). % 0.12/0.38 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)))). % 0.12/0.38 cnf(i_0_17, plain, (mem(c_2Ebinary__ieee_2Efloat__plus__min(X1,X2),arr(ty_2Ebool_2Eitself(ty_2Epair_2Eprod(X1,X2)),ty_2Ebinary__ieee_2Efloat(X1,X2)))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_31, plain, (ap(c_2Ebinary__ieee_2Efloat__to__real(X1,X2),ap(c_2Ebinary__ieee_2Efloat__plus__min(X1,X2),c_2Ebool_2Ethe__value(ty_2Epair_2Eprod(X1,X2))))=ap(c_2Ebinary__ieee_2Eulp(X1,X2),c_2Ebool_2Ethe__value(ty_2Epair_2Eprod(X1,X2)))|~ne(X2)|~ne(X1))). % 0.12/0.38 cnf(i_0_30, plain, (ap(c_2Ebinary__ieee_2Efloat__to__real(X1,X2),ap(c_2Ebinary__ieee_2Efloat__negate(X1,X2),X3))=ap(c_2Erealax_2Ereal__neg,ap(c_2Ebinary__ieee_2Efloat__to__real(X1,X2),X3))|~mem(X3,ty_2Ebinary__ieee_2Efloat(X1,X2))|~ne(X2)|~ne(X1))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 5 steps % 0.12/0.38 cnf(i_0_35, negated_conjecture, (ne(esk4_0)), inference(start_rule)). % 0.12/0.38 cnf(i_0_39, plain, (ne(esk4_0)), inference(extension_rule, [i_0_14])). % 0.12/0.38 cnf(i_0_181, plain, (~ne(bool)), inference(closure_rule, [i_0_1])). % 0.12/0.38 cnf(i_0_179, plain, (mem(c_2Ebinary__ieee_2Efloat__negate(bool,esk4_# Child (14508) has found a proof. % 0.12/0.38 % 0.12/0.38 0),arr(ty_2Ebinary__ieee_2Efloat(bool,esk4_0),ty_2Ebinary__ieee_2Efloat(bool,esk4_0)))), inference(extension_rule, [i_0_10])). % 0.12/0.38 cnf(i_0_300, plain, (ap(i(arr(ty_2Ebinary__ieee_2Efloat(bool,esk4_0),ty_2Ebinary__ieee_2Efloat(bool,esk4_0))),c_2Ebinary__ieee_2Efloat__negate(bool,esk4_0))=c_2Ebinary__ieee_2Efloat__negate(bool,esk4_0)), inference(etableau_closure_rule, [i_0_300, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------