TSTP Solution File: CSR034+1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : CSR034+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 : n026.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:06:25 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : CSR034+1 : TPTP v8.1.0. Released v3.4.0.
% 0.12/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 : n026.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 : Sat Jun 11 19:23:49 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.38  # No SInE strategy applied
% 0.13/0.38  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38  #
% 0.13/0.38  # Presaturation interreduction done
% 0.13/0.38  # Number of axioms: 72 Number of unprocessed: 59
% 0.13/0.38  # Tableaux proof search.
% 0.13/0.38  # APR header successfully linked.
% 0.13/0.38  # Hello from C++
% 0.13/0.38  # The folding up rule is enabled...
% 0.13/0.38  # Local unification is enabled...
% 0.13/0.38  # Any saturation attempts will use folding labels...
% 0.13/0.38  # 59 beginning clauses after preprocessing and clausification
% 0.13/0.38  # Creating start rules for all 2 conjectures.
% 0.13/0.38  # There are 2 start rule candidates:
% 0.13/0.38  # Found 23 unit axioms.
% 0.13/0.38  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38  # 2 start rule tableaux created.
% 0.13/0.38  # 36 extension rule candidate clauses
% 0.13/0.38  # 23 unit axiom clauses
% 0.13/0.38  
% 0.13/0.38  # Requested 8, 32 cores available to the main process.
% 0.13/0.38  # There are not enough tableaux to fork, creating more from the initial 2
% 0.13/0.38  # There were 1 total branch saturation attempts.
% 0.13/0.38  # There were 0 of these attempts blocked.
% 0.13/0.38  # There were 0 deferred branch saturation attempts.
% 0.13/0.38  # There were 0 free duplicated saturations.
% 0.13/0.38  # There were 1 total successful branch saturations.
% 0.13/0.38  # There were 0 successful branch saturations in interreduction.
% 0.13/0.38  # There were 0 successful branch saturations on the branch.
% 0.13/0.38  # There were 1 successful branch saturations after the branch.
% 0.13/0.38  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38  # Begin clausification derivation
% 0.13/0.38  
% 0.13/0.38  # End clausification derivation
% 0.13/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38  cnf(i_0_72, negated_conjecture, (mtvisible(c_tptp_member3515_mt))).
% 0.13/0.38  cnf(i_0_38, plain, (mtvisible(c_basekb))).
% 0.13/0.38  cnf(i_0_70, plain, (mtvisible(c_universalvocabularymt))).
% 0.13/0.38  cnf(i_0_13, plain, (transitivebinarypredicate(c_genlmt))).
% 0.13/0.38  cnf(i_0_19, plain, (genlmt(c_tptp_member3515_mt,c_tptp_spindleheadmt))).
% 0.13/0.38  cnf(i_0_41, plain, (microtheory(f_contextofpcwfn(X1)))).
% 0.13/0.38  cnf(i_0_1, plain, (genlmt(c_worldgeographydualistmt,c_worldgeographymt))).
% 0.13/0.38  cnf(i_0_2, plain, (genlmt(c_ethnicgroupsvocabularymt,c_worldcompletedualistgeographymt))).
% 0.13/0.38  cnf(i_0_11, plain, (genlmt(c_worldcompletedualistgeographymt,c_unitedstatesgeographydualistmt))).
% 0.13/0.38  cnf(i_0_3, plain, (genlmt(c_cyclistsmt,c_hpkbvocabmt))).
% 0.13/0.38  cnf(i_0_9, plain, (genlmt(c_cyclistsmt,c_keinteractionresourcetestmt))).
% 0.13/0.38  cnf(i_0_4, plain, (genlmt(c_nooescapearchitecturemt,c_organizationdatamt))).
% 0.13/0.38  cnf(i_0_5, plain, (genlmt(c_testvocabularymt,c_nooescapearchitecturemt))).
% 0.13/0.38  cnf(i_0_8, plain, (genlmt(c_unitedstatesgeographydualistmt,c_worldgeographydualistmt))).
% 0.13/0.38  cnf(i_0_10, plain, (genlmt(c_keinteractionresourcetestmt,c_testvocabularymt))).
% 0.13/0.38  cnf(i_0_12, plain, (genlmt(c_massmediadatamt,c_ethnicgroupsmt))).
% 0.13/0.38  cnf(i_0_15, plain, (genlmt(c_ethnicgroupsmt,c_ethnicgroupsvocabularymt))).
% 0.13/0.38  cnf(i_0_18, plain, (genlmt(c_tptp_spindleheadmt,c_cyclistsmt))).
% 0.13/0.38  cnf(i_0_16, plain, (genlmt(c_organizationdatamt,f_contextofpcwfn(c_ap_martha_stewart_omnimedia_names_chairman)))).
% 0.13/0.38  cnf(i_0_17, plain, (genlmt(f_contextofpcwfn(c_ap_martha_stewart_omnimedia_names_chairman),c_massmediadatamt))).
% 0.13/0.38  cnf(i_0_39, plain, (natfunction(f_contextofpcwfn(X1),c_contextofpcwfn))).
% 0.13/0.38  cnf(i_0_40, plain, (natargument(f_contextofpcwfn(X1),n_1,X1))).
% 0.13/0.38  cnf(i_0_71, negated_conjecture, (~isa(c_wanica_districtsuriname,X1))).
% 0.13/0.38  cnf(i_0_14, plain, (state_geopolitical(c_wanica_districtsuriname)|~mtvisible(c_worldgeographymt))).
% 0.13/0.38  cnf(i_0_33, plain, (collection(X1)|~disjointwith(X2,X1))).
% 0.13/0.38  cnf(i_0_34, plain, (collection(X1)|~disjointwith(X1,X2))).
% 0.13/0.38  cnf(i_0_51, plain, (state_geopolitical(X1)|~isa(X1,c_state_geopolitical))).
% 0.13/0.38  cnf(i_0_49, plain, (hpkb_subnationalagent(X1)|~isa(X1,c_hpkb_subnationalagent))).
% 0.13/0.38  cnf(i_0_6, plain, (genls(c_state_geopolitical,c_hpkb_subnationalagent)|~mtvisible(c_hpkbvocabmt))).
% 0.13/0.38  cnf(i_0_52, plain, (isa(X1,c_state_geopolitical)|~state_geopolitical(X1))).
% 0.13/0.38  cnf(i_0_50, plain, (isa(X1,c_hpkb_subnationalagent)|~hpkb_subnationalagent(X1))).
% 0.13/0.38  cnf(i_0_43, plain, (isa(X1,c_transitivebinarypredicate)|~transitivebinarypredicate(X1))).
% 0.13/0.38  cnf(i_0_42, plain, (transitivebinarypredicate(X1)|~isa(X1,c_transitivebinarypredicate))).
% 0.13/0.38  cnf(i_0_22, plain, (predicate(X1)|~genlpreds(X2,X1))).
% 0.13/0.38  cnf(i_0_24, plain, (predicate(X1)|~genlpreds(X1,X2))).
% 0.13/0.38  cnf(i_0_29, plain, (binarypredicate(X1)|~genlinverse(X2,X1))).
% 0.13/0.38  cnf(i_0_30, plain, (binarypredicate(X1)|~genlinverse(X1,X2))).
% 0.13/0.38  cnf(i_0_53, plain, (collection(X1)|~genls(X2,X1))).
% 0.13/0.38  cnf(i_0_7, plain, (hpkb_subnationalagent(X1)|~state_geopolitical(X1)|~mtvisible(c_hpkbvocabmt))).
% 0.13/0.38  cnf(i_0_44, plain, (collection(X1)|~isa(X2,X1))).
% 0.13/0.38  cnf(i_0_55, plain, (collection(X1)|~genls(X1,X2))).
% 0.13/0.38  cnf(i_0_46, plain, (thing(X1)|~isa(X1,X2))).
% 0.13/0.38  cnf(i_0_62, plain, (mtvisible(X1)|~mtvisible(X2)|~genlmt(X2,X1))).
% 0.13/0.38  cnf(i_0_63, plain, (microtheory(X1)|~genlmt(X2,X1))).
% 0.13/0.38  cnf(i_0_68, plain, (genlmt(X1,X1)|~microtheory(X1))).
% 0.13/0.38  cnf(i_0_65, plain, (microtheory(X1)|~genlmt(X1,X2))).
% 0.13/0.38  cnf(i_0_58, plain, (genls(X1,X1)|~collection(X1))).
% 0.13/0.38  cnf(i_0_27, plain, (genlpreds(X1,X1)|~predicate(X1))).
% 0.13/0.38  cnf(i_0_20, plain, (~disjointwith(X1,X2)|~isa(X3,X2)|~isa(X3,X1))).
% 0.13/0.38  cnf(i_0_35, plain, (disjointwith(X1,X2)|~disjointwith(X2,X1))).
% 0.13/0.38  cnf(i_0_48, plain, (isa(X1,X2)|~isa(X1,X3)|~genls(X3,X2))).
% 0.13/0.38  cnf(i_0_67, plain, (genlmt(X1,X2)|~genlmt(X3,X2)|~genlmt(X1,X3))).
% 0.13/0.38  cnf(i_0_60, plain, (genls(X1,X2)|~genls(X1,X3)|~genls(X3,X2))).
% 0.13/0.38  cnf(i_0_37, plain, (disjointwith(X1,X2)|~disjointwith(X3,X2)|~genls(X1,X3))).
% 0.13/0.38  cnf(i_0_36, plain, (disjointwith(X1,X2)|~disjointwith(X1,X3)|~genls(X2,X3))).
% 0.13/0.38  cnf(i_0_31, plain, (genlinverse(X1,X2)|~genlpreds(X1,X3)|~genlinverse(X3,X2))).
% 0.13/0.38  cnf(i_0_32, plain, (genlinverse(X1,X2)|~genlpreds(X3,X2)|~genlinverse(X1,X3))).
% 0.13/0.38  cnf(i_0_21, plain, (genlpreds(X1,X2)|~genlinverse(X3,X2)|~genlinverse(X1,X3))).
% 0.13/0.38  cnf(i_0_26, plain, (genlpreds(X1,X2)|~genlpreds(X3,X2)|~genlpreds(X1,X3))).
% 0.13/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.38  # Begin printing tableau
% 0.13/0.38  # Found 6 steps
% 0.13/0.38  cnf(i_0_72, negated_conjecture, (mtvisible(c_tptp_member3515_mt)), inference(start_rule)).
% 0.13/0.38  cnf(i_0_74, plain, (mtvisible(c_tptp_member3515_mt)), inference(extension_rule, [i_0_62])).
% 0.13/0.38  cnf(i_0_200, plain, (~genlmt(c_tptp_member3515_mt,c_tptp_spindleheadmt)), inference(closure_rule, [i_0_19])).
% 0.13/0.38  cnf(i_0_198, plain, (mtvisible(c_tptp_spindleheadmt)), inference(extension_rule, [i_0_62])).
% 0.13/0.38  cnf(i_0_284, plain, (~genlmt(c_tptp_spindleheadmt,c_cyclistsmt)), inference(closure_rule, [i_0_18])).
% 0.13/0.38  cnf(i_0_282, plain, (mtvisible(c_cyclistsmt)), inference(etableau_closure_rule, [i_0_282, ...])).
% 0.13/0.38  # End printing tableau
% 0.13/0.38  # SZS output end
% 0.13/0.38  # Branches closed with saturation will be marked with an "s"
% 0.13/0.38  # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38  # We now have 4 tableaux to operate on
% 0.13/0.38  # Found closed tableau during pool population.
% 0.13/0.38  # Proof search is over...
% 0.13/0.38  # Freeing feature tree
%------------------------------------------------------------------------------