↑ Up

Etableau---0.67.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : CSR052+1 : TPTP v8.1.0. Released v3.4.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 : n020.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 : Fri Jul 15 03:10:35 EDT 2022

% Result   : Theorem 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : CSR052+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33  % Computer : n020.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sat Jun 11 01:12:05 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.36  # No SInE strategy applied
% 0.13/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.36  #
% 0.13/0.36  # Presaturation interreduction done
% 0.13/0.36  # Number of axioms: 97 Number of unprocessed: 84
% 0.13/0.36  # Tableaux proof search.
% 0.13/0.36  # APR header successfully linked.
% 0.13/0.36  # Hello from C++
% 0.13/0.37  # The folding up rule is enabled...
% 0.13/0.37  # Local unification is enabled...
% 0.13/0.37  # Any saturation attempts will use folding labels...
% 0.13/0.37  # 84 beginning clauses after preprocessing and clausification
% 0.13/0.37  # Creating start rules for all 2 conjectures.
% 0.13/0.37  # There are 2 start rule candidates:
% 0.13/0.37  # Found 29 unit axioms.
% 0.13/0.37  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37  # 2 start rule tableaux created.
% 0.13/0.37  # 55 extension rule candidate clauses
% 0.13/0.37  # 29 unit axiom clauses
% 0.13/0.37  
% 0.13/0.37  # Requested 8, 32 cores available to the main process.
% 0.13/0.37  # There are not enough tableaux to fork, creating more from the initial 2
% 0.13/0.37  # There were 1 total branch saturation attempts.
% 0.13/0.37  # There were 0 of these attempts blocked.
% 0.13/0.37  # There were 0 deferred branch saturation attempts.
% 0.13/0.37  # There were 0 free duplicated saturations.
% 0.13/0.37  # There were 1 total successful branch saturations.
% 0.13/0.37  # There were 0 successful branch saturations in interreduction.
% 0.13/0.37  # There were 0 successful branch saturations on the branch.
% 0.13/0.37  # There were 1 successful branch saturations after the branch.
% 0.13/0.37  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37  # Begin clausification derivation
% 0.13/0.37  
% 0.13/0.37  # End clausification derivation
% 0.13/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37  cnf(i_0_78, plain, (mtvisible(c_basekb))).
% 0.13/0.37  cnf(i_0_97, negated_conjecture, (mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_ukencartamsncomencyclopedia_761573010_4united_states_of_americahtml)),c_translation_33)))).
% 0.13/0.37  cnf(i_0_95, plain, (mtvisible(c_universalvocabularymt))).
% 0.13/0.37  cnf(i_0_8, plain, (genls(c_tptpcol_8_39940,c_tptpcol_7_39939))).
% 0.13/0.37  cnf(i_0_1, plain, (transitivebinarypredicate(c_genls))).
% 0.13/0.37  cnf(i_0_5, plain, (transitivebinarypredicate(c_genlmt))).
% 0.13/0.37  cnf(i_0_22, plain, (genls(c_tptpcol_15_40430,c_tptpcol_14_40429))).
% 0.13/0.37  cnf(i_0_62, plain, (uniformresourcelocator(f_urlfn(X1)))).
% 0.13/0.37  cnf(i_0_65, plain, (computerdataartifact(f_urlreferentfn(X1)))).
% 0.13/0.37  cnf(i_0_10, plain, (genls(c_tptpcol_9_40196,c_tptpcol_8_39940))).
% 0.13/0.37  cnf(i_0_12, plain, (genls(c_tptpcol_10_40324,c_tptpcol_9_40196))).
% 0.13/0.37  cnf(i_0_2, plain, (genlmt(c_cycorpproductsmt,c_basekb))).
% 0.13/0.37  cnf(i_0_14, plain, (genls(c_tptpcol_11_40388,c_tptpcol_10_40324))).
% 0.13/0.37  cnf(i_0_16, plain, (genls(c_tptpcol_12_40420,c_tptpcol_11_40388))).
% 0.13/0.37  cnf(i_0_18, plain, (genls(c_tptpcol_13_40421,c_tptpcol_12_40420))).
% 0.13/0.37  cnf(i_0_20, plain, (genls(c_tptpcol_14_40429,c_tptpcol_13_40421))).
% 0.13/0.37  cnf(i_0_4, plain, (genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_ukencartamsncomencyclopedia_761573010_4united_states_of_americahtml)),c_translation_33),c_machinelearningspindleheadmt))).
% 0.13/0.37  cnf(i_0_7, plain, (genlmt(c_basekb,c_universalvocabularymt))).
% 0.13/0.37  cnf(i_0_3, plain, (genlmt(c_cycnounlearnermt,c_cycorpproductsmt))).
% 0.13/0.37  cnf(i_0_6, plain, (genlmt(c_machinelearningspindleheadmt,c_cycnounlearnermt))).
% 0.13/0.37  cnf(i_0_60, plain, (natfunction(f_urlfn(X1),c_urlfn))).
% 0.13/0.37  cnf(i_0_63, plain, (natfunction(f_urlreferentfn(X1),c_urlreferentfn))).
% 0.13/0.37  cnf(i_0_69, plain, (microtheory(f_contentmtofcdafromeventfn(X1,X2)))).
% 0.13/0.37  cnf(i_0_66, plain, (natfunction(f_contentmtofcdafromeventfn(X1,X2),c_contentmtofcdafromeventfn))).
% 0.13/0.37  cnf(i_0_61, plain, (natargument(f_urlfn(X1),n_1,X1))).
% 0.13/0.37  cnf(i_0_64, plain, (natargument(f_urlreferentfn(X1),n_1,X1))).
% 0.13/0.37  cnf(i_0_67, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_1,X1))).
% 0.13/0.37  cnf(i_0_68, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_2,X2))).
% 0.13/0.37  cnf(i_0_96, negated_conjecture, (~genls(c_tptpcol_15_40430,c_tptpcol_7_39939))).
% 0.13/0.37  cnf(i_0_11, plain, (tptpcol_8_39940(X1)|~tptpcol_9_40196(X1))).
% 0.13/0.37  cnf(i_0_13, plain, (tptpcol_9_40196(X1)|~tptpcol_10_40324(X1))).
% 0.13/0.37  cnf(i_0_15, plain, (tptpcol_10_40324(X1)|~tptpcol_11_40388(X1))).
% 0.13/0.37  cnf(i_0_17, plain, (tptpcol_11_40388(X1)|~tptpcol_12_40420(X1))).
% 0.13/0.37  cnf(i_0_19, plain, (tptpcol_12_40420(X1)|~tptpcol_13_40421(X1))).
% 0.13/0.37  cnf(i_0_21, plain, (tptpcol_13_40421(X1)|~tptpcol_14_40429(X1))).
% 0.13/0.37  cnf(i_0_23, plain, (tptpcol_14_40429(X1)|~tptpcol_15_40430(X1))).
% 0.13/0.37  cnf(i_0_9, plain, (tptpcol_7_39939(X1)|~tptpcol_8_39940(X1))).
% 0.13/0.37  cnf(i_0_57, plain, (isa(X1,c_tptpcol_7_39939)|~tptpcol_7_39939(X1))).
% 0.13/0.37  cnf(i_0_37, plain, (collection(X1)|~disjointwith(X2,X1))).
% 0.13/0.37  cnf(i_0_38, plain, (collection(X1)|~disjointwith(X1,X2))).
% 0.13/0.37  cnf(i_0_79, plain, (transitivebinarypredicate(X1)|~isa(X1,c_transitivebinarypredicate))).
% 0.13/0.37  cnf(i_0_58, plain, (tptpcol_8_39940(X1)|~isa(X1,c_tptpcol_8_39940))).
% 0.13/0.37  cnf(i_0_43, plain, (isa(X1,c_tptpcol_15_40430)|~tptpcol_15_40430(X1))).
% 0.13/0.37  cnf(i_0_56, plain, (tptpcol_7_39939(X1)|~isa(X1,c_tptpcol_7_39939))).
% 0.13/0.37  cnf(i_0_42, plain, (tptpcol_15_40430(X1)|~isa(X1,c_tptpcol_15_40430))).
% 0.13/0.37  cnf(i_0_54, plain, (tptpcol_9_40196(X1)|~isa(X1,c_tptpcol_9_40196))).
% 0.13/0.37  cnf(i_0_52, plain, (tptpcol_10_40324(X1)|~isa(X1,c_tptpcol_10_40324))).
% 0.13/0.37  cnf(i_0_50, plain, (tptpcol_11_40388(X1)|~isa(X1,c_tptpcol_11_40388))).
% 0.13/0.37  cnf(i_0_48, plain, (tptpcol_12_40420(X1)|~isa(X1,c_tptpcol_12_40420))).
% 0.13/0.37  cnf(i_0_59, plain, (isa(X1,c_tptpcol_8_39940)|~tptpcol_8_39940(X1))).
% 0.13/0.37  cnf(i_0_55, plain, (isa(X1,c_tptpcol_9_40196)|~tptpcol_9_40196(X1))).
% 0.13/0.37  cnf(i_0_53, plain, (isa(X1,c_tptpcol_10_40324)|~tptpcol_10_40324(X1))).
% 0.13/0.37  cnf(i_0_51, plain, (isa(X1,c_tptpcol_11_40388)|~tptpcol_11_40388(X1))).
% 0.13/0.37  cnf(i_0_49, plain, (isa(X1,c_tptpcol_12_40420)|~tptpcol_12_40420(X1))).
% 0.13/0.37  cnf(i_0_47, plain, (isa(X1,c_tptpcol_13_40421)|~tptpcol_13_40421(X1))).
% 0.13/0.37  cnf(i_0_45, plain, (isa(X1,c_tptpcol_14_40429)|~tptpcol_14_40429(X1))).
% 0.13/0.37  cnf(i_0_46, plain, (tptpcol_13_40421(X1)|~isa(X1,c_tptpcol_13_40421))).
% 0.13/0.37  cnf(i_0_44, plain, (tptpcol_14_40429(X1)|~isa(X1,c_tptpcol_14_40429))).
% 0.13/0.37  cnf(i_0_80, plain, (isa(X1,c_transitivebinarypredicate)|~transitivebinarypredicate(X1))).
% 0.13/0.37  cnf(i_0_26, plain, (predicate(X1)|~genlpreds(X2,X1))).
% 0.13/0.37  cnf(i_0_81, plain, (collection(X1)|~genls(X2,X1))).
% 0.13/0.37  cnf(i_0_83, plain, (collection(X1)|~genls(X1,X2))).
% 0.13/0.37  cnf(i_0_76, plain, (genlmt(X1,X1)|~microtheory(X1))).
% 0.13/0.37  cnf(i_0_28, plain, (predicate(X1)|~genlpreds(X1,X2))).
% 0.13/0.37  cnf(i_0_33, plain, (binarypredicate(X1)|~genlinverse(X2,X1))).
% 0.13/0.37  cnf(i_0_86, plain, (genls(X1,X1)|~collection(X1))).
% 0.13/0.37  cnf(i_0_70, plain, (mtvisible(X1)|~mtvisible(X2)|~genlmt(X2,X1))).
% 0.13/0.37  cnf(i_0_34, plain, (binarypredicate(X1)|~genlinverse(X1,X2))).
% 0.13/0.37  cnf(i_0_31, plain, (genlpreds(X1,X1)|~predicate(X1))).
% 0.13/0.37  cnf(i_0_90, plain, (collection(X1)|~isa(X2,X1))).
% 0.13/0.37  cnf(i_0_71, plain, (microtheory(X1)|~genlmt(X2,X1))).
% 0.13/0.37  cnf(i_0_73, plain, (microtheory(X1)|~genlmt(X1,X2))).
% 0.13/0.37  cnf(i_0_92, plain, (thing(X1)|~isa(X1,X2))).
% 0.13/0.37  cnf(i_0_39, plain, (disjointwith(X1,X2)|~disjointwith(X2,X1))).
% 0.13/0.37  cnf(i_0_24, plain, (~disjointwith(X1,X2)|~isa(X3,X2)|~isa(X3,X1))).
% 0.13/0.37  cnf(i_0_75, plain, (genlmt(X1,X2)|~genlmt(X3,X2)|~genlmt(X1,X3))).
% 0.13/0.37  cnf(i_0_88, plain, (genls(X1,X2)|~genls(X1,X3)|~genls(X3,X2))).
% 0.13/0.37  cnf(i_0_94, plain, (isa(X1,X2)|~isa(X1,X3)|~genls(X3,X2))).
% 0.13/0.37  cnf(i_0_41, plain, (disjointwith(X1,X2)|~disjointwith(X3,X2)|~genls(X1,X3))).
% 0.13/0.37  cnf(i_0_40, plain, (disjointwith(X1,X2)|~disjointwith(X1,X3)|~genls(X2,X3))).
% 0.13/0.37  cnf(i_0_35, plain, (genlinverse(X1,X2)|~genlpreds(X1,X3)|~genlinverse(X3,X2))).
% 0.13/0.37  cnf(i_0_36, plain, (genlinverse(X1,X2)|~genlpreds(X3,X2)|~genlinverse(X1,X3))).
% 0.13/0.37  cnf(i_0_25, plain, (genlpreds(X1,X2)|~genlinverse(X3,X2)|~genlinverse(X1,X3))).
% 0.13/0.37  cnf(i_0_30, plain, (genlpreds(X1,X2)|~genlpreds(X3,X2)|~genlpreds(X1,X3))).
% 0.13/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.37  # Begin printing tableau
% 0.13/0.37  # Found 6 steps
% 0.13/0.37  cnf(i_0_97, negated_conjecture, (mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_ukencartamsncomencyclopedia_761573010_4united_states_of_americahtml)),c_translation_33))), inference(start_rule)).
% 0.13/0.37  cnf(i_0_99, plain, (mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_ukencartamsncomencyclopedia_761573010_4united_states_of_americahtml)),c_translation_33))), inference(extension_rule, [i_0_70])).
% 0.13/0.37  cnf(i_0_297, plain, (~genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_ukencartamsncomencyclopedia_761573010_4united_states_of_americahtml)),c_translation_33),c_machinelearningspindleheadmt)), inference(closure_rule, [i_0_4])).
% 0.13/0.37  cnf(i_0_295, plain, (mtvisible(c_machinelearningspindleheadmt)), inference(extension_rule, [i_0_70])).
% 0.13/0.37  cnf(i_0_418, plain, (~genlmt(c_machinelearningspindleheadmt,c_cycnounlearnermt)), inference(closure_rule, [i_0_6])).
% 0.13/0.37  cnf(i_0_416, plain, (mtvisible(c_cycnounlearnermt)), inference(etableau_closure_rule, [i_0_416, ...])).
% 0.13/0.37  # End printing tableau
% 0.13/0.37  # SZS output end
% 0.13/0.37  # Branches closed with saturation will be marked with an "s"
% 0.13/0.37  # Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37  # We now have 2 tableaux to operate on
% 0.13/0.37  # Found closed tableau during pool population.
% 0.13/0.37  # Proof search is over...
% 0.13/0.37  # Freeing feature tree
%------------------------------------------------------------------------------