%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : CSR041-10 : TPTP v8.1.0. Released 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 : n021.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:07:37 EDT 2022

% Result   : Unsatisfiable 0.20s 0.40s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : CSR041-10 : TPTP v8.1.0. Released v7.5.0.
% 0.03/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.35  % Computer : n021.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jun 11 05:10:40 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.38  # No SInE strategy applied
% 0.20/0.38  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.38  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.38  #
% 0.20/0.38  # Presaturation interreduction done
% 0.20/0.38  # Number of axioms: 78 Number of unprocessed: 65
% 0.20/0.38  # Tableaux proof search.
% 0.20/0.38  # APR header successfully linked.
% 0.20/0.38  # Hello from C++
% 0.20/0.39  # The folding up rule is enabled...
% 0.20/0.39  # Local unification is enabled...
% 0.20/0.39  # Any saturation attempts will use folding labels...
% 0.20/0.39  # 65 beginning clauses after preprocessing and clausification
% 0.20/0.39  # Creating start rules for all 3 conjectures.
% 0.20/0.39  # There are 3 start rule candidates:
% 0.20/0.39  # Found 65 unit axioms.
% 0.20/0.39  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.39  # 3 start rule tableaux created.
% 0.20/0.39  # 0 extension rule candidate clauses
% 0.20/0.39  # 65 unit axiom clauses
% 0.20/0.39  
% 0.20/0.39  # Requested 8, 32 cores available to the main process.
% 0.20/0.39  # There are not enough tableaux to fork, creating more from the initial 3
% 0.20/0.39  # Creating equality axioms
% 0.20/0.39  # Ran out of tableaux, making start rules for all clauses
% 0.20/0.39  # Returning from population with 114 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.39  # We now have 114 tableaux to operate on
% 0.20/0.40  # There were 1 total branch saturation attempts.
% 0.20/0.40  # There were 0 of these attempts blocked.
% 0.20/0.40  # There were 0 deferred branch saturation attempts.
% 0.20/0.40  # There were 0 free duplicated saturations.
% 0.20/0.40  # There were 1 total successful branch saturations.
% 0.20/0.40  # There were 0 successful branch saturations in interreduction.
% 0.20/0.40  # There were 0 successful branch saturations on the branch.
% 0.20/0.40  # There were 1 successful branch saturations after the branch.
% 0.20/0.40  # There were 1 total branch saturation attempts.
% 0.20/0.40  # There were 0 of these attempts blocked.
% 0.20/0.40  # There were 0 deferred branch saturation attempts.
% 0.20/0.40  # There were 0 free duplicated saturations.
% 0.20/0.40  # There were 1 total successful branch saturations.
% 0.20/0.40  # There were 0 successful branch saturations in interreduction.
% 0.20/0.40  # There were 0 successful branch saturations on the branch.
% 0.20/0.40  # There were 1 successful branch saturations after the branch.
% 0.20/0.40  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40  # Begin clausification derivation
% 0.20/0.40  
% 0.20/0.40  # End clausification derivation
% 0.20/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (mtvisible(c_tptp_member2831_mt)=true)).
% 0.20/0.40  cnf(i_0_155, negated_conjecture, (ifeq2(aspatialthing(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_wwwinformationblastcomtechnical_university_of_munichhtml)),c_translation_3)),true,a,b)=b)).
% 0.20/0.40  cnf(i_0_111, plain, (mtvisible(c_basekb)=true)).
% 0.20/0.40  cnf(i_0_152, plain, (mtvisible(c_universalvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_87, plain, (transitivebinarypredicate(c_genlmt)=true)).
% 0.20/0.40  cnf(i_0_114, plain, (uniformresourcelocator(f_urlfn(X1))=true)).
% 0.20/0.40  cnf(i_0_117, plain, (computerdataartifact(f_urlreferentfn(X1))=true)).
% 0.20/0.40  cnf(i_0_82, plain, (genls(c_aspatialinformationstore,c_aspatialthing)=true)).
% 0.20/0.40  cnf(i_0_84, plain, (genls(c_microtheory,c_aspatialinformationstore)=true)).
% 0.20/0.40  cnf(i_0_86, plain, (genlmt(c_calendarsmt,c_calendarsvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_93, plain, (genlmt(c_tptp_member2831_mt,c_tptp_spindleheadmt)=true)).
% 0.20/0.40  cnf(i_0_91, plain, (genlmt(c_calendarsvocabularymt,c_basekb)=true)).
% 0.20/0.40  cnf(i_0_89, plain, (genlmt(c_basekb,c_universalvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_90, plain, (genlmt(c_cyclistsmt,c_calendarsmt)=true)).
% 0.20/0.40  cnf(i_0_92, plain, (genlmt(c_tptp_spindleheadmt,c_cyclistsmt)=true)).
% 0.20/0.40  cnf(i_0_112, plain, (natfunction(f_urlfn(X1),c_urlfn)=true)).
% 0.20/0.40  cnf(i_0_121, plain, (microtheory(f_contentmtofcdafromeventfn(X1,X2))=true)).
% 0.20/0.40  cnf(i_0_79, plain, (ifeq3(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_80, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_81, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_115, plain, (natfunction(f_urlreferentfn(X1),c_urlreferentfn)=true)).
% 0.20/0.40  cnf(i_0_118, plain, (natfunction(f_contentmtofcdafromeventfn(X1,X2),c_contentmtofcdafromeventfn)=true)).
% 0.20/0.40  cnf(i_0_113, plain, (natargument(f_urlfn(X1),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_116, plain, (natargument(f_urlreferentfn(X1),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_83, plain, (ifeq3(aspatialinformationstore(X1),true,aspatialthing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_119, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_120, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_2,X2)=true)).
% 0.20/0.40  cnf(i_0_85, plain, (ifeq3(microtheory(X1),true,aspatialinformationstore(X1),true)=true)).
% 0.20/0.40  cnf(i_0_135, plain, (ifeq3(microtheory(X1),true,genlmt(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_100, plain, (ifeq3(predicate(X1),true,genlpreds(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_140, plain, (ifeq3(aspatialthing(X1),true,isa(X1,c_aspatialthing),true)=true)).
% 0.20/0.40  cnf(i_0_139, plain, (ifeq3(isa(X1,c_aspatialthing),true,aspatialthing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_142, plain, (ifeq3(aspatialinformationstore(X1),true,isa(X1,c_aspatialinformationstore),true)=true)).
% 0.20/0.40  cnf(i_0_138, plain, (ifeq3(microtheory(X1),true,isa(X1,c_microtheory),true)=true)).
% 0.20/0.40  cnf(i_0_123, plain, (ifeq3(transitivebinarypredicate(X1),true,isa(X1,c_transitivebinarypredicate),true)=true)).
% 0.20/0.40  cnf(i_0_141, plain, (ifeq3(isa(X1,c_aspatialinformationstore),true,aspatialinformationstore(X1),true)=true)).
% 0.20/0.40  cnf(i_0_137, plain, (ifeq3(isa(X1,c_microtheory),true,microtheory(X1),true)=true)).
% 0.20/0.40  cnf(i_0_148, plain, (ifeq3(collection(X1),true,genls(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_143, plain, (ifeq3(genls(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_122, plain, (ifeq3(isa(X1,c_transitivebinarypredicate),true,transitivebinarypredicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_145, plain, (ifeq3(genls(X1,X2),true,collection(X1),true)=true)).
% 0.20/0.40  cnf(i_0_130, plain, (ifeq3(genlmt(X1,X2),true,microtheory(X2),true)=true)).
% 0.20/0.40  cnf(i_0_132, plain, (ifeq3(genlmt(X1,X2),true,microtheory(X1),true)=true)).
% 0.20/0.40  cnf(i_0_102, plain, (ifeq3(genlinverse(X1,X2),true,binarypredicate(X2),true)=true)).
% 0.20/0.40  cnf(i_0_103, plain, (ifeq3(genlinverse(X1,X2),true,binarypredicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_95, plain, (ifeq3(genlpreds(X1,X2),true,predicate(X2),true)=true)).
% 0.20/0.40  cnf(i_0_97, plain, (ifeq3(genlpreds(X1,X2),true,predicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_106, plain, (ifeq3(disjointwith(X1,X2),true,collection(X2)# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40  # Begin clausification derivation
% 0.20/0.40  
% 0.20/0.40  # End clausification derivation
% 0.20/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (mtvisible(c_tptp_member2831_mt)=true)).
% 0.20/0.40  cnf(i_0_155, negated_conjecture, (ifeq2(aspatialthing(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_wwwinformationblastcomtechnical_university_of_munichhtml)),c_translation_3)),true,a,b)=b)).
% 0.20/0.40  cnf(i_0_111, plain, (mtvisible(c_basekb)=true)).
% 0.20/0.40  cnf(i_0_152, plain, (mtvisible(c_universalvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_87, plain, (transitivebinarypredicate(c_genlmt)=true)).
% 0.20/0.40  cnf(i_0_114, plain, (uniformresourcelocator(f_urlfn(X1))=true)).
% 0.20/0.40  cnf(i_0_117, plain, (computerdataartifact(f_urlreferentfn(X1))=true)).
% 0.20/0.40  cnf(i_0_82, plain, (genls(c_aspatialinformationstore,c_aspatialthing)=true)).
% 0.20/0.40  cnf(i_0_84, plain, (genls(c_microtheory,c_aspatialinformationstore)=true)).
% 0.20/0.40  cnf(i_0_86, plain, (genlmt(c_calendarsmt,c_calendarsvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_93, plain, (genlmt(c_tptp_member2831_mt,c_tptp_spindleheadmt)=true)).
% 0.20/0.40  cnf(i_0_91, plain, (genlmt(c_calendarsvocabularymt,c_basekb)=true)).
% 0.20/0.40  cnf(i_0_89, plain, (genlmt(c_basekb,c_universalvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_90, plain, (genlmt(c_cyclistsmt,c_calendarsmt)=true)).
% 0.20/0.40  cnf(i_0_92, plain, (genlmt(c_tptp_spindleheadmt,c_cyclistsmt)=true)).
% 0.20/0.40  cnf(i_0_112, plain, (natfunction(f_urlfn(X1),c_urlfn)=true)).
% 0.20/0.40  cnf(i_0_121, plain, (microtheory(f_contentmtofcdafromeventfn(X1,X2))=true)).
% 0.20/0.40  cnf(i_0_79, plain, (ifeq3(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_80, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_81, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_115, plain, (natfunction(f_urlreferentfn(X1),c_urlreferentfn)=true)).
% 0.20/0.40  cnf(i_0_118, plain, (natfunction(f_contentmtofcdafromeventfn(X1,X2),c_contentmtofcdafromeventfn)=true)).
% 0.20/0.40  cnf(i_0_113, plain, (natargument(f_urlfn(X1),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_116, plain, (natargument(f_urlreferentfn(X1),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_83, plain, (ifeq3(aspatialinformationstore(X1),true,aspatialthing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_119, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_120, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_2,X2)=true)).
% 0.20/0.40  cnf(i_0_85, plain, (ifeq3(microtheory(X1),true,aspatialinformationstore(X1),true)=true)).
% 0.20/0.40  cnf(i_0_135, plain, (ifeq3(microtheory(X1),true,genlmt(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_100, plain, (ifeq3(predicate(X1),true,genlpreds(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_140, plain, (ifeq3(aspatialthing(X1),true,isa(X1,c_aspatialthing),true)=true)).
% 0.20/0.40  cnf(i_0_139, plain, (ifeq3(isa(X1,c_aspatialthing),true,aspatialthing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_142, plain, (ifeq3(aspatialinformationstore(X1),true,isa(X1,c_aspatialinformationstore),true)=true)).
% 0.20/0.40  cnf(i_0_138, plain, (ifeq3(microtheory(X1),true,isa(X1,c_microtheory),true)=true)).
% 0.20/0.40  cnf(i_0_123, plain, (ifeq3(transitivebinarypredicate(X1),true,isa(X1,c_transitivebinarypredicate),true)=true)).
% 0.20/0.40  cnf(i_0_141, plain, (ifeq3(isa(X1,c_aspatialinformationstore),true,aspatialinformationstore(X1),true)=true)).
% 0.20/0.40  cnf(i_0_137, plain, (ifeq3(isa(X1,c_microtheory),true,microtheory(X1),true)=true)).
% 0.20/0.40  cnf(i_0_148, plain, (ifeq3(collection(X1),true,genls(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_143, plain, (ifeq3(genls(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_122, plain, (ifeq3(isa(X1,c_transitivebinarypredicate),true,transitivebinarypredicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_145, plain, (ifeq3(genls(X1,X2),true,collection(X1),true)=true)).
% 0.20/0.40  cnf(i_0_130, plain, (ifeq3(genlmt(X1,X2),true,microtheory(X2),true)=true)).
% 0.20/0.40  cnf(i_0_132, plain, (ifeq3(genlmt(X1,X2),true,microtheory(X1),true)=true)).
% 0.20/0.40  cnf(i_0_102, plain, (ifeq3(genlinverse(X1,X2),true,binarypredicate(X2),true)=true)).
% 0.20/0.40  cnf(i_0_103, plain, (ifeq3(genlinverse(X1,X2),true,binarypredicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_95, plain, (ifeq3(genlpreds(X1,X2),true,predicate(X2),true)=true)).
% 0.20/0.40  cnf(i_0_97, plain, (ifeq3(genlpreds(X1,X2),true,predicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_106, plain, (ifeq3(disjointwith(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_107, plain, (ifeq3(disjointwith(X1,X2),true,collection(X1),true)=true)).
% 0.20/0.40  cnf(i_0_124, plain, (ifeq3(isa(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_126, plain, (ifeq3(isa(X1,X2),true,thing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_108, plain, (ifeq3(disjointwith(X1,X2),true,disjointwith(X2,X1),true)=true)).
% 0.20/0.40  cnf(i_0_129, plain, (ifeq3(mtvisible(X1),true,ifeq3(genlmt(X1,X2),true,mtvisible(X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_147, plain, (ifeq3(genls(X1,X2),true,ifeq3(genls(X3,X1),true,genls(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_150, plain, (ifeq3(genls(X1,X2),true,ifeq3(genls(X2,X3),true,genls(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_109, plain, (ifeq3(genls(X1,X2),true,ifeq3(disjointwith(X3,X2),true,disjointwith(X3,X1),true),true)=true)).
% 0.20/0.40  cnf(i_0_110, plain, (ifeq3(genls(X1,X2),true,ifeq3(disjointwith(X2,X3),true,disjointwith(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_154, plain, (ifeq(tuple(isa(X1,X2),isa(X1,X3),disjointwith(X2,X3)),tuple(true,true,true),a,b)=b)).
% 0.20/0.40  cnf(i_0_128, plain, (ifeq3(genls(X1,X2),true,ifeq3(isa(X3,X1),true,isa(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_134, plain, (ifeq3(genlmt(X1,X2),true,ifeq3(genlmt(X3,X1),true,genlmt(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_94, plain, (ifeq3(genlinverse(X1,X2),true,ifeq3(genlinverse(X3,X1),true,genlpreds(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_105, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlinverse(X3,X1),true,genlinverse(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_104, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlinverse(X2,X3),true,genlinverse(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_99, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlpreds(X3,X1),true,genlpreds(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_156, negated_conjecture, (a!=b)).
% 0.20/0.40  cnf(i_0_160, plain, (X4=X4)).
% 0.20/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.20/0.40  # Begin printing tableau
% 0.20/0.40  # Found 9 steps
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (mtvisible(c_tptp_member2831_mt)=true), inference(start_rule)).
% 0.20/0.40  cnf(i_0_190, plain, (mtvisible(c_tptp_member2831_mt)=true), inference(extension_rule, [i_0_189])).
% 0.20/0.40  cnf(i_0_333, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_334, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_332, plain, (tuple(mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt))=tuple(true,true,true)), inference(extension_rule, [i_0_164])).
% 0.20/0.40  cnf(i_0_656, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_657, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_658, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_654, plain, (ifeq3(tuple(mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt)),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt))=ifeq3(tuple(true,true,true),true,true,true)), inference(etableau_closure_rule, [i_0_654, ...])).
% 0.20/0.40  # End printing tableau
% 0.20/0.40  # SZS output end
% 0.20/0.40  # Branches closed with saturation will be marked with an "s"
% 0.20/0.40  # There were 1 total branch saturation attempts.
% 0.20/0.40  # There were 0 of these attempts blocked.
% 0.20/0.40  # There were 0 deferred branch saturation attempts.
% 0.20/0.40  # There were 0 free duplicated saturations.
% 0.20/0.40  # There were 1 total successful branch saturations.
% 0.20/0.40  # There were 0 successful branch saturations in interreduction.
% 0.20/0.40  # There were 0 successful branch saturations on the branch.
% 0.20/0.40  # There were 1 successful branch saturations after the branch.
% 0.20/0.40  ,true)=true)).
% 0.20/0.40  cnf(i_0_107, plain, (ifeq3(disjointwith(X1,X2),true,collection(X1),true)=true)).
% 0.20/0.40  cnf(i_0_124, plain, (ifeq3(isa(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_126, plain, (ifeq3(isa(X1,X2),true,thing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_108, plain, (ifeq3(disjointwith(X1,X2),true,disjointwith(X2,X1),true)=true)).
% 0.20/0.40  cnf(i_0_129, plain, (ifeq3(mtvisible(X1),true,ifeq3(genlmt(X1,X2),true,mtvisible(X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_147, plain, (ifeq3(genls(X1,X2),true,ifeq3(genls(X3,X1),true,genls(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_150, plain, (ifeq3(genls(X1,X2),true,ifeq3(genls(X2,X3),true,genls(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_109, plain, (ifeq3(genls(X1,X2),true,ifeq3(disjointwith(X3,X2),true,disjointwith(X3,X1),true),true)=true)).
% 0.20/0.40  cnf(i_0_110, plain, (ifeq3(genls(X1,X2),true,ifeq3(disjointwith(X2,X3),true,disjointwith(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_154, plain, (ifeq(tuple(isa(X1,X2),isa(X1,X3),disjointwith(X2,X3)),tuple(true,true,true),a,b)=b)).
% 0.20/0.40  cnf(i_0_128, plain, (ifeq3(genls(X1,X2),true,ifeq3(isa(X3,X1),true,isa(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_134, plain, (ifeq3(genlmt(X1,X2),true,ifeq3(genlmt(X3,X1),true,genlmt(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_94, plain, (ifeq3(genlinverse(X1,X2),true,ifeq3(genlinverse(X3,X1),true,genlpreds(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_105, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlinverse(X3,X1),true,genlinverse(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_104, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlinverse(X2,X3),true,genlinverse(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_99, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlpreds(X3,X1),true,genlpreds(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_156, negated_conjecture, (a!=b)).
% 0.20/0.40  cnf(i_0_160, plain, (X4=X4)).
% 0.20/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.20/0.40  # Begin printing tableau
% 0.20/0.40  # Found 9 steps
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (mtvisible(c_tptp_member2831_mt)=true), inference(start_rule)).
% 0.20/0.40  cnf(i_0_190, plain, (mtvisible(c_tptp_member2831_mt)=true), inference(extension_rule, [i_0_189])).
% 0.20/0.40  cnf(i_0_333, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_335, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_332, plain, (tuple(mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt))=tuple(true,true,true)), inference(extension_rule, [i_0_164])).
% 0.20/0.40  cnf(i_0_656, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_657, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_658, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_654, plain, (ifeq3(tuple(mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt)),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt))=ifeq3(tuple(true,true,true),true,true,true)), inference(etableau_closure_rule, [i_0_654, ...])).
% 0.20/0.40  # End printing tableau
% 0.20/0.40  # SZS output end
% 0.20/0.40  # Branches closed with saturation will be marked with an "s"
% 0.20/0.40  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40  # Begin clausification derivation
% 0.20/0.40  
% 0.20/0.40  # End clausification derivation
% 0.20/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (mtvisible(c_tptp_member2831_mt)=true)).
% 0.20/0.40  cnf(i_0_155, negated_conjecture, (ifeq2(aspatialthing(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_wwwinformationblastcomtechnical_university_of_munichhtml)),c_translation_3)),true,a,b)=b)).
% 0.20/0.40  cnf(i_0_111, plain, (mtvisible(c_basekb)=true)).
% 0.20/0.40  cnf(i_0_152, plain, (mtvisible(c_universalvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_87, plain, (transitivebinarypredicate(c_genlmt)=true)).
% 0.20/0.40  cnf(i_0_114, plain, (uniformresourcelocator(f_urlfn(X1))=true)).
% 0.20/0.40  cnf(i_0_117, plain, (computerdataartifact(f_urlreferentfn(X1))=true)).
% 0.20/0.40  cnf(i_0_82, plain, (genls(c_aspatialinformationstore,c_aspatialthing)=true)).
% 0.20/0.40  cnf(i_0_84, plain, (genls(c_microtheory,c_aspatialinformationstore)=true)).
% 0.20/0.40  cnf(i_0_86, plain, (genlmt(c_calendarsmt,c_calendarsvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_93, plain, (genlmt(c_tptp_member2831_mt,c_tptp_spindleheadmt)=true)).
% 0.20/0.40  cnf(i_0_91, plain, (genlmt(c_calendarsvocabularymt,c_basekb)=true)).
% 0.20/0.40  cnf(i_0_89, plain, (genlmt(c_basekb,c_universalvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_90, plain, (genlmt(c_cyclistsmt,c_calendarsmt)=true)).
% 0.20/0.40  cnf(i_0_92, plain, (genlmt(c_tptp_spindleheadmt,c_cyclistsmt)=true)).
% 0.20/0.40  cnf(i_0_112, plain, (natfunction(f_urlfn(X1),c_urlfn)=true)).
% 0.20/0.40  cnf(i_0_121, plain, (microtheory(f_contentmtofcdafromeventfn(X1,X2))=true)).
% 0.20/0.40  cnf(i_0_79, plain, (ifeq3(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_80, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_81, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_115, plain, (natfunction(f_urlreferentfn(X1),c_urlreferentfn)=true)).
% 0.20/0.40  cnf(i_0_118, plain, (natfunction(f_contentmtofcdafromeventfn(X1,X2),c_contentmtofcdafromeventfn)=true)).
% 0.20/0.40  cnf(i_0_113, plain, (natargument(f_urlfn(X1),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_116, plain, (natargument(f_urlreferentfn(X1),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_83, plain, (ifeq3(aspatialinformationstore(X1),true,aspatialthing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_119, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_120, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_2,X2)=true)).
% 0.20/0.40  cnf(i_0_85, plain, (ifeq3(microtheory(X1),true,aspatialinformationstore(X1),true)=true)).
% 0.20/0.40  cnf(i_0_135, plain, (ifeq3(microtheory(X1),true,genlmt(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_100, plain, (ifeq3(predicate(X1),true,genlpreds(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_140, plain, (ifeq3(aspatialthing(X1),true,isa(X1,c_aspatialthing),true)=true)).
% 0.20/0.40  cnf(i_0_139, plain, (ifeq3(isa(X1,c_aspatialthing),true,aspatialthing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_142, plain, (ifeq3(aspatialinformationstore(X1),true,isa(X1,c_aspatialinformationstore),true)=true)).
% 0.20/0.40  cnf(i_0_138, plain, (ifeq3(microtheory(X1),true,isa(X1,c_microtheory),true)=true)).
% 0.20/0.40  cnf(i_0_123, plain, (ifeq3(transitivebinarypredicate(X1),true,isa(X1,c_transitivebinarypredicate),true)=true)).
% 0.20/0.40  cnf(i_0_141, plain, (ifeq3(isa(X1,c_aspatialinformationstore),true,aspatialinformationstore(X1),true)=true)).
% 0.20/0.40  cnf(i_0_137, plain, (ifeq3(isa(X1,c_microtheory),true,microtheory(X1),true)=true)).
% 0.20/0.40  cnf(i_0_148, plain, (ifeq3(collection(X1),true,genls(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_143, plain, (ifeq3(genls(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_122, plain, (ifeq3(isa(X1,c_transitivebinarypredicate),true,transitivebinarypredicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_145, plain, (ifeq3(genls(X1,X2),true,collection(X1),true)=true)).
% 0.20/0.40  cnf(i_0_130, plain, (ifeq3(genlmt(X1,X2),true,microtheory(X2),true)=true)).
% 0.20/0.40  cnf(i_0_132, plain, (ifeq3(genlmt(X1,X2),true,microtheory(X1),true)=true)).
% 0.20/0.40  cnf(i_0_102, plain, (ifeq3(genlinverse(X1,X2),true,binarypredicate(X2),true)=true)).
% 0.20/0.40  cnf(i_0_103, plain, (ifeq3(genlinverse(X1,X2),true,binarypredicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_95, plain, (ifeq3(genlpreds(X1,X2),true,predicate(X2),true)=true)).
% 0.20/0.40  cnf(i_0_97, plain, (ifeq3(genlpreds(X1,X2),true,predicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_106, plain, (ifeq3(disjointwith(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_107, plain, (ifeq3(disjointwith(X1,X2),true,collection(X1),true)=true)).
% 0.20/0.40  cnf(i_0_124, plain, (ifeq3(isa(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_126, plain, (ifeq3(isa(X1,X2),true,thing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_108, plain, (ifeq3(disjointwith(X1,X2),true,disjointwith(X2,X1),true)=true)).
% 0.20/0.40  cnf(i_0_129, plain, (ifeq3(mtvisible(X1),true,ifeq3(genlmt(X1,X2),true,mtvisible(X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_147, plain, (ifeq3(genls(X1,X2),true,ifeq3(genls(X3,X1),true,genls(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_150, plain, (ifeq3(genls(X1,X2),true,ifeq3(genls(X2,X3),true,genls(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_109, plain, (ifeq3(genls(X1,X2),true,ifeq3(disjointwith(X3,X2),true,disjointwith(X3,X1),true),true)=true)).
% 0.20/0.40  cnf(i_0_110, plain, (ifeq3(genls(X1,X2),true,ifeq3(disjointwith(X2,X3),true,disjointwith(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_154, plain, (ifeq(tuple(isa(X1,X2),isa(X1,X3),disjointwith(X2,X3)),tuple(true,true,true),a,b)=b)).
% 0.20/0.40  cnf(i_0_128, plain, (ifeq3(genls(X1,X2),true,ifeq3(isa(X3,X1),true,isa(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_134, plain, (ifeq3(genlmt(X1,X2),true,ifeq3(genlmt(X3,X1),true,genlmt(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_94, plain, (ifeq3(genlinverse(X1,X2),true,ifeq3(genlinverse(X3,X1),true,genlpreds(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_105, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlinverse(X3,X1),true,genlinverse(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_104, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlinverse(X2,X3),true,genlinverse(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_99, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlpreds(X3,X1),true,genlpreds(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_156, negated_conjecture, (a!=b)).
% 0.20/0.40  cnf(i_0_160, plain, (X4=X4)).
% 0.20/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.20/0.40  # Begin printing tableau
% 0.20/0.40  # Found 7 steps
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (mtvisible(c_tptp_member2831_mt)=true), inference(start_rule)).
% 0.20/0.40  cnf(i_0_190, plain, (mtvisible(c_tptp_member2831_mt)=true), inference(extension_rule, [i_0_188])).
% 0.20/0.40  cnf(i_0_330, plain, (thing(mtvisible(c_tptp_member2831_mt))=thing(true)), inference(extension_rule, [i_0_164])).
% 0.20/0.40  cnf(i_0_654, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_655, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_656, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_652, plain, (ifeq3(thing(mtvisible(c_tptp_member2831_mt)),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt))=ifeq3(thing(true),true,true,true)), inference(etableau_closure_rule, [i_0_652, ...])).
% 0.20/0.40  # End printing tableau
% 0.20/0.40  # SZS output end
% 0.20/0.40  # Branches closed with saturation will be marked with an "s"
% 0.20/0.40  # There were 1 total branch saturation attempts.
% 0.20/0.40  # There were 0 of these attempts blocked.
% 0.20/0.40  # There were 0 deferred branch saturation attempts.
% 0.20/0.40  # There were 0 free duplicated saturations.
% 0.20/0.40  # There were 1 total successful branch saturations.
% 0.20/0.40  # There were 0 successful branch saturations in interreduction.
% 0.20/0.40  # There were 0 successful branch saturations on the branch.
% 0.20/0.40  # There were 1 successful branch saturations after the branch.
% 0.20/0.40  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40  # Begin clausification derivation
% 0.20/0.40  
% 0.20/0.40  # End clausification derivation
% 0.20/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (mtvisible(c_tptp_member2831_mt)=true)).
% 0.20/0.40  cnf(i_0_155, negated_conjecture, (ifeq2(aspatialthing(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_wwwinformationblastcomtechnical_university_of_munichhtml)),c_translation_3)),true,a,b)=b)).
% 0.20/0.40  cnf(i_0_111, plain, (mtvisible(c_basekb)=true)).
% 0.20/0.40  cnf(i_0_152, plain, (mtvisible(c_universalvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_87, plain, (transitivebinarypredicate(c_genlmt)=true)).
% 0.20/0.40  cnf(i_0_114, plain, (uniformresourcelocator(f_urlfn(X1))=true)).
% 0.20/0.40  cnf(i_0_117, plain, (computerdataartifact(f_urlreferentfn(X1))=true)).
% 0.20/0.40  cnf(i_0_82, plain, (genls(c_aspatialinformationstore,c_aspatialthing)=true)).
% 0.20/0.40  cnf(i_0_84, plain, (genls(c_microtheory,c_aspatialinformationstore)=true)).
% 0.20/0.40  cnf(i_0_86, plain, (genlmt(c_calendarsmt,c_calendarsvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_93, plain, (genlmt(c_tptp_member2831_mt,c_tptp_spindleheadmt)=true)).
% 0.20/0.40  cnf(i_0_91, plain, (genlmt(c_calendarsvocabularymt,c_basekb)=true)).
% 0.20/0.40  cnf(i_0_89, plain, (genlmt(c_basekb,c_universalvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_90, plain, (genlmt(c_cyclistsmt,c_calendarsmt)=true)).
% 0.20/0.40  cnf(i_0_92, plain, (genlmt(c_tptp_spindleheadmt,c_cyclistsmt)=true)).
% 0.20/0.40  cnf(i_0_112, plain, (natfunction(f_urlfn(X1),c_urlfn)=true)).
% 0.20/0.40  cnf(i_0_121, plain, (microtheory(f_contentmtofcdafromeventfn(X1,X2))=true)).
% 0.20/0.40  cnf(i_0_79, plain, (ifeq3(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_80, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_81, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_115, plain, (natfunction(f_urlreferentfn(X1),c_urlreferentfn)=true)).
% 0.20/0.40  cnf(i_0_118, plain, (natfunction(f_contentmtofcdafromeventfn(X1,X2),c_contentmtofcdafromeventfn)=true)).
% 0.20/0.40  cnf(i_0_113, plain, (natargument(f_urlfn(X1),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_116, plain, (natargument(f_urlreferentfn(X1),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_83, plain, (ifeq3(aspatialinformationstore(X1),true,aspatialthing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_119, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_120, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_2,X2)=true)).
% 0.20/0.40  cnf(i_0_85, plain, (ifeq3(microtheory(X1),true,aspatialinformationstore(X1),true)=true)).
% 0.20/0.40  cnf(i_0_135, plain, (ifeq3(microtheory(X1),true,genlmt(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_100, plain, (ifeq3(predicate(X1),true,genlpreds(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_140, plain, (ifeq3(aspatialthing(X1),true,isa(X1,c_aspatialthing),true)=true)).
% 0.20/0.40  cnf(i_0_139, plain, (ifeq3(isa(X1,c_aspatialthing),true,aspatialthing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_142, plain, (ifeq3(aspatialinformationstore(X1),true,isa(X1,c_aspatialinformationstore),true)=true)).
% 0.20/0.40  cnf(i_0_138, plain, (ifeq3(microtheory(X1),true,isa(X1,c_microtheory),true)=true)).
% 0.20/0.40  cnf(i_0_123, plain, (ifeq3(transitivebinarypredicate(X1),true,isa(X1,c_transitivebinarypredicate),true)=true)).
% 0.20/0.40  cnf(i_0_141, plain, (ifeq3(isa(X1,c_aspatialinformationstore),true,aspatialinformationstore(X1),true)=true)).
% 0.20/0.40  cnf(i_0_137, plain, (ifeq3(isa(X1,c_microtheory),true,microtheory(X1),true)=true)).
% 0.20/0.40  cnf(i_0_148, plain, (ifeq3(collection(X1),true,genls(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_143, plain, (ifeq3(genls(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_122, plain, (ifeq3(isa(X1,c_transitivebinarypredicate),true,transitivebinarypredicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_145, plain, (ifeq3(genls(X1,X2),true,collection(X1),true)=true)).
% 0.20/0.40  cnf(i_0_130, plain, (ifeq3(genlmt(X1,X2),true,microtheory(X2),true)=true)).
% 0.20/0.40  cnf(i_0_132, plain, (ifeq3(genlmt(X1,X2),true,microtheory(X1),true)=true)).
% 0.20/0.40  cnf(i_0_102, plain, (ifeq3(genlinverse(X1,X2),true,binarypredicate(X2),true)=true)).
% 0.20/0.40  cnf(i_0_103, plain, (ifeq3(genlinverse(X1,X2),true,binarypredicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_95, plain, (ifeq3(genlpreds(X1,X2),true,predicate(X2),true)=true)).
% 0.20/0.40  cnf(i_0_97, plain, (ifeq3(genlpreds(X1,X2),true,predicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_106, plain, (ifeq3(disjointwith(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_107, plain, (ifeq3(disjointwith(X1,X2),true,collection(X1),true)=true)).
% 0.20/0.40  cnf(i_0_124, plain, (ifeq3(isa(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_126, plain, (ifeq3(isa(X1,X2),true,thing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_108, plain, (ifeq3(disjointwith(X1,X2),true,disjointwith(X2,X1),true)=true)).
% 0.20/0.40  cnf(i_0_129, plain, (ifeq3(mtvisible(X1),true,ifeq3(genlmt(X1,X2),true,mtvisible(X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_147, plain, (ifeq3(genls(X1,X2),true,ifeq3(genls(X3,X1),true,genls(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_150, plain, (ifeq3(genls(X1,X2),true,ifeq3(genls(X2,X3),true,genls(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_109, plain, (ifeq3(genls(X1,X2),true,ifeq3(disjointwith(X3,X2),true,disjointwith(X3,X1),true),true)=true)).
% 0.20/0.40  cnf(i_0_110, plain, (ifeq3(genls(X1,X2),true,ifeq3(disjointwith(X2,X3),true,disjointwith(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_154, plain, (ifeq(tuple(isa(X1,X2),isa(X1,X3),disjointwith(X2,X3)),tuple(true,true,true),a,b)=b)).
% 0.20/0.40  cnf(i_0_128, plain, (ifeq3(genls(X1,X2),true,ifeq3(isa(X3,X1),true,isa(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_134, plain, (ifeq3(genlmt(X1,X2),true,ifeq3(genlmt(X3,X1),true,genlmt(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_94, plain, (ifeq3(genlinverse(X1,X2),true,ifeq3(genlinverse(X3,X1),true,genlpreds(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_105, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlinverse(X3,X1),true,genlinverse(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_104, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlinverse(X2,X3),true,genlinverse(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_99, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlpreds(X3,X1),true,genlpreds(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_156, negated_conjecture, (a!=b)).
% 0.20/0.40  cnf(i_0_160, plain, (X4=X4)).
% 0.20/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.20/0.40  # Begin printing tableau
% 0.20/0.40  # Found 8 steps
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (mtvisible(c_tptp_member2831_mt)=true), inference(start_rule)).
% 0.20/0.40  cnf(i_0_190, plain, (mtvisible(c_tptp_member2831_mt)=true), inference(extension_rule, [i_0_187])).
% 0.20/0.40  cnf(i_0_328, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_327, plain, (isa(mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt))=isa(true,true)), inference(extension_rule, [i_0_164])).
% 0.20/0.40  cnf(i_0_651, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_652, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_653, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_649, plain, (ifeq3(isa(mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt)),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt))=ifeq3(isa(true,true),true,true,true)), inference(etableau_closure_rule, [i_0_649, ...])).
% 0.20/0.40  # End printing tableau
% 0.20/0.40  # SZS output end
% 0.20/0.40  # Branches closed with saturation will be marked with an "s"
% 0.20/0.40  # There were 1 total branch saturation attempts.
% 0.20/0.40  # There were 0 of these attempts blocked.
% 0.20/0.40  # There were 0 deferred branch saturation attempts.
% 0.20/0.40  # There were 0 free duplicated saturations.
% 0.20/0.40  # There were 1 total successful branch saturations.
% 0.20/0.40  # There were 0 successful branch saturations in interreduction.
% 0.20/0.40  # There were 0 successful branch saturations on the branch.
% 0.20/0.40  # There were 1 successful branch saturations after the branch.
% 0.20/0.40  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40  # Begin clausification derivation
% 0.20/0.40  
% 0.20/0.40  # End clausification derivation
% 0.20/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (mtvisible(c_tptp_member2831_mt)=true)).
% 0.20/0.40  cnf(i_0_155, negated_conjecture, (ifeq2(aspatialthing(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_wwwinformationblastcomtechnical_university_of_munichhtml)),c_translation_3)),true,a,b)=b)).
% 0.20/0.40  cnf(i_0_111, plain, (mtvisible(c_basekb)=true)).
% 0.20/0.40  cnf(i_0_152, plain, (mtvisible(c_universalvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_87, plain, (transitivebinarypredicate(c_genlmt)=true)).
% 0.20/0.40  cnf(i_0_114, plain, (uniformresourcelocator(f_urlfn(X1))=true)).
% 0.20/0.40  cnf(i_0_117, plain, (computerdataartifact(f_urlreferentfn(X1))=true)).
% 0.20/0.40  cnf(i_0_82, plain, (genls(c_aspatialinformationstore,c_aspatialthing)=true)).
% 0.20/0.40  cnf(i_0_84, plain, (genls(c_microtheory,c_aspatialinformationstore)=true)).
% 0.20/0.40  cnf(i_0_86, plain, (genlmt(c_calendarsmt,c_calendarsvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_93, plain, (genlmt(c_tptp_member2831_mt,c_tptp_spindleheadmt)=true)).
% 0.20/0.40  cnf(i_0_91, plain, (genlmt(c_calendarsvocabularymt,c_basekb)=true)).
% 0.20/0.40  cnf(i_0_89, plain, (genlmt(c_basekb,c_universalvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_90, plain, (genlmt(c_cyclistsmt,c_calendarsmt)=true)).
% 0.20/0.40  cnf(i_0_92, plain, (genlmt(c_tptp_spindleheadmt,c_cyclistsmt)=true)).
% 0.20/0.40  cnf(i_0_112, plain, (natfunction(f_urlfn(X1),c_urlfn)=true)).
% 0.20/0.40  cnf(i_0_121, plain, (microtheory(f_contentmtofcdafromeventfn(X1,X2))=true)).
% 0.20/0.40  cnf(i_0_79, plain, (ifeq3(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_80, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_81, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_115, plain, (natfunction(f_urlreferentfn(X1),c_urlreferentfn)=true)).
% 0.20/0.40  cnf(i_0_118, plain, (natfunction(f_contentmtofcdafromeventfn(X1,X2),c_contentmtofcdafromeventfn)=true)).
% 0.20/0.40  cnf(i_0_113, plain, (natargument(f_urlfn(X1),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_116, plain, (natargument(f_urlreferentfn(X1),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_83, plain, (ifeq3(aspatialinformationstore(X1),true,aspatialthing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_119, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_120, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_2,X2)=true)).
% 0.20/0.40  cnf(i_0_85, plain, (ifeq3(microtheory(X1),true,aspatialinformationstore(X1),true)=true)).
% 0.20/0.40  cnf(i_0_135, plain, (ifeq3(microtheory(X1),true,genlmt(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_100, plain, (ifeq3(predicate(X1),true,genlpreds(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_140, plain, (ifeq3(aspatialthing(X1),true,isa(X1,c_aspatialthing),true)=true)).
% 0.20/0.40  cnf(i_0_139, plain, (ifeq3(isa(X1,c_aspatialthing),true,aspatialthing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_142, plain, (ifeq3(aspatialinformationstore(X1),true,isa(X1,c_aspatialinformationstore),true)=true)).
% 0.20/0.40  cnf(i_0_138, plain, (ifeq3(microtheory(X1),true,isa(X1,c_microtheory),true)=true)).
% 0.20/0.40  cnf(i_0_123, plain, (ifeq3(transitivebinarypredicate(X1),true,isa(X1,c_transitivebinarypredicate),true)=true)).
% 0.20/0.40  cnf(i_0_141, plain, (ifeq3(isa(X1,c_aspatialinformationstore),true,aspatialinformationstore(X1),true)=true)).
% 0.20/0.40  cnf(i_0_137, plain, (ifeq3(isa(X1,c_microtheory),true,microtheory(X1),true)=true)).
% 0.20/0.40  cnf(i_0_148, plain, (ifeq3(collection(X1),true,genls(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_143, plain, (ifeq3(genls(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_122, plain, (ifeq3(isa(X1,c_transitivebinarypredicate),true,transitivebinarypredicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_145, plain, (ifeq3(genls(X1,X2),true,collection(X1),true)=true)).
% 0.20/0.40  cnf(i_0_130, plain, (ifeq3(genlmt(X1,X2),true,microtheory(X2),true)=true)).
% 0.20/0.40  cnf(i_0_132, plain, (ifeq3(genlmt(X1,X2),true,microtheory(X1),true)=true)).
% 0.20/0.40  cnf(i_0_102, plain, (ifeq3(genlinverse(X1,X2),true,binarypredicate(X2),true)=true)).
% 0.20/0.40  cnf(i_0_103, plain, (ifeq3(genlinverse(X1,X2),true,binarypredicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_95, plain, (ifeq3(genlpreds(X1,X2),true,predicate(X2),true)=true)).
% 0.20/0.40  cnf(i_0_97, plain, (ifeq3(genlpreds(X1,X2),true,predicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_106, plain, (ifeq3(disjointwith(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_107, plain, (ifeq3(disjointwith(X1,X2),true,collection(X1),true)=true)).
% 0.20/0.40  cnf(i_0_124, plain, (ifeq3(isa(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_126, plain, (ifeq3(isa(X1,X2),true,thing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_108, plain, (ifeq3(disjointwith(X1,X2),true,disjointwith(X2,X1),true)=true)).
% 0.20/0.40  cnf(i_0_129, plain, (ifeq3(mtvisible(X1),true,ifeq3(genlmt(X1,X2),true,mtvisible(X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_147, plain, (ifeq3(genls(X1,X2),true,ifeq3(genls(X3,X1),true,genls(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_150, plain, (ifeq3(genls(X1,X2),true,ifeq3(genls(X2,X3),true,genls(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_109, plain, (ifeq3(genls(X1,X2),true,ifeq3(disjointwith(X3,X2),true,disjointwith(X3,X1),true),true)=true)).
% 0.20/0.40  cnf(i_0_110, plain, (ifeq3(genls(X1,X2),true,ifeq3(disjointwith(X2,X3),true,disjointwith(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_154, plain, (ifeq(tuple(isa(X1,X2),isa(X1,X3),disjointwith(X2,X3)),tuple(true,true,true),a,b)=b)).
% 0.20/0.40  cnf(i_0_128, plain, (ifeq3(genls(X1,X2),true,ifeq3(isa(X3,X1),true,isa(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_134, plain, (ifeq3(genlmt(X1,X2),true,ifeq3(genlmt(X3,X1),true,genlmt(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_94, plain, (ifeq3(genlinverse(X1,X2),true,ifeq3(genlinverse(X3,X1),true,genlpreds(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_105, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlinverse(X3,X1),true,genlinverse(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_104, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlinverse(X2,X3),true,genlinverse(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_99, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlpreds(X3,X1),true,genlpreds(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_156, negated_conjecture, (a!=b)).
% 0.20/0.40  cnf(i_0_160, plain, (X4=X4)).
% 0.20/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.20/0.40  # Begin printing tableau
% 0.20/0.40  # Found 8 steps
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (mtvisible(c_tptp_member2831_mt)=true), inference(start_rule)).
% 0.20/0.40  cnf(i_0_190, plain, (mtvisible(c_tptp_member2831_mt)=true), inference(extension_rule, [i_0_187])).
% 0.20/0.40  cnf(i_0_329, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_327, plain, (isa(mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt))=isa(true,true)), inference(extension_rule, [i_0_164])).
% 0.20/0.40  cnf(i_0_651, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_652, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_653, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_649, plain, (ifeq3(isa(mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt)),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt))=ifeq3(isa(true,true),true,true,true)), inference(etableau_closure_rule, [i_0_649, ...])).
% 0.20/0.40  # End printing tableau
% 0.20/0.40  # SZS output end
% 0.20/0.40  # Branches closed with saturation will be marked with an "s"
% 0.20/0.40  # There were 1 total branch saturation attempts.
% 0.20/0.40  # There were 0 of these attempts blocked.
% 0.20/0.40  # There were 0 deferred branch saturation attempts.
% 0.20/0.40  # There were 0 free duplicated saturations.
% 0.20/0.40  # There were 1 total successful branch saturations.
% 0.20/0.40  # There were 0 successful branch saturations in interreduction.
% 0.20/0.40  # There were 0 successful branch saturations on the branch.
% 0.20/0.40  # There were 1 successful branch saturations after the branch.
% 0.20/0.40  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40  # Begin clausification derivation
% 0.20/0.40  
% 0.20/0.40  # End clausification derivation
% 0.20/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (mtvisible(c_tptp_member2831_mt)=true)).
% 0.20/0.40  cnf(i_0_155, negated_conjecture, (ifeq2(aspatialthing(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_wwwinformationblastcomtechnical_university_of_munichhtml)),c_translation_3)),true,a,b)=b)).
% 0.20/0.40  cnf(i_0_111, plain, (mtvisible(c_basekb)=true)).
% 0.20/0.40  cnf(i_0_152, plain, (mtvisible(c_universalvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_87, plain, (transitivebinarypredicate(c_genlmt)=true)).
% 0.20/0.40  cnf(i_0_114, plain, (uniformresourcelocator(f_urlfn(X1))=true)).
% 0.20/0.40  cnf(i_0_117, plain, (computerdataartifact(f_urlreferentfn(X1))=true)).
% 0.20/0.40  cnf(i_0_82, plain, (genls(c_aspatialinformationstore,c_aspatialthing)=true)).
% 0.20/0.40  cnf(i_0_84, plain, (genls(c_microtheory,c_aspatialinformationstore)=true)).
% 0.20/0.40  cnf(i_0_86, plain, (genlmt(c_calendarsmt,c_calendarsvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_93, plain, (genlmt(c_tptp_member2831_mt,c_tptp_spindleheadmt)=true)).
% 0.20/0.40  cnf(i_0_91, plain, (genlmt(c_calendarsvocabularymt,c_basekb)=true)).
% 0.20/0.40  cnf(i_0_89, plain, (genlmt(c_basekb,c_universalvocabularymt)=true)).
% 0.20/0.40  cnf(i_0_90, plain, (genlmt(c_cyclistsmt,c_calendarsmt)=true)).
% 0.20/0.40  cnf(i_0_92, plain, (genlmt(c_tptp_spindleheadmt,c_cyclistsmt)=true)).
% 0.20/0.40  cnf(i_0_112, plain, (natfunction(f_urlfn(X1),c_urlfn)=true)).
% 0.20/0.40  cnf(i_0_121, plain, (microtheory(f_contentmtofcdafromeventfn(X1,X2))=true)).
% 0.20/0.40  cnf(i_0_79, plain, (ifeq3(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_80, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_81, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.20/0.40  cnf(i_0_115, plain, (natfunction(f_urlreferentfn(X1),c_urlreferentfn)=true)).
% 0.20/0.40  cnf(i_0_118, plain, (natfunction(f_contentmtofcdafromeventfn(X1,X2),c_contentmtofcdafromeventfn)=true)).
% 0.20/0.40  cnf(i_0_113, plain, (natargument(f_urlfn(X1),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_116, plain, (natargument(f_urlreferentfn(X1),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_83, plain, (ifeq3(aspatialinformationstore(X1),true,aspatialthing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_119, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_1,X1)=true)).
% 0.20/0.40  cnf(i_0_120, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_2,X2)=true)).
% 0.20/0.40  cnf(i_0_85, plain, (ifeq3(microtheory(X1),true,aspatialinformationstore(X1),true)=true)).
% 0.20/0.40  cnf(i_0_135, plain, (ifeq3(microtheory(X1),true,genlmt(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_100, plain, (ifeq3(predicate(X1),true,genlpreds(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_140, plain, (ifeq3(aspatialthing(X1),true,isa(X1,c_aspatialthing),true)=true)).
% 0.20/0.40  cnf(i_0_139, plain, (ifeq3(isa(X1,c_aspatialthing),true,aspatialthing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_142, plain, (ifeq3(aspatialinformationstore(X1),true,isa(X1,c_aspatialinformationstore),true)=true)).
% 0.20/0.40  cnf(i_0_138, plain, (ifeq3(microtheory(X1),true,isa(X1,c_microtheory),true)=true)).
% 0.20/0.40  cnf(i_0_123, plain, (ifeq3(transitivebinarypredicate(X1),true,isa(X1,c_transitivebinarypredicate),true)=true)).
% 0.20/0.40  cnf(i_0_141, plain, (ifeq3(isa(X1,c_aspatialinformationstore),true,aspatialinformationstore(X1),true)=true)).
% 0.20/0.40  cnf(i_0_137, plain, (ifeq3(isa(X1,c_microtheory),true,microtheory(X1),true)=true)).
% 0.20/0.40  cnf(i_0_148, plain, (ifeq3(collection(X1),true,genls(X1,X1),true)=true)).
% 0.20/0.40  cnf(i_0_143, plain, (ifeq3(genls(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_122, plain, (ifeq3(isa(X1,c_transitivebinarypredicate),true,transitivebinarypredicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_145, plain, (ifeq3(genls(X1,X2),true,collection(X1),true)=true)).
% 0.20/0.40  cnf(i_0_130, plain, (ifeq3(genlmt(X1,X2),true,microtheory(X2),true)=true)).
% 0.20/0.40  cnf(i_0_132, plain, (ifeq3(genlmt(X1,X2),true,microtheory(X1),true)=true)).
% 0.20/0.40  cnf(i_0_102, plain, (ifeq3(genlinverse(X1,X2),true,binarypredicate(X2),true)=true)).
% 0.20/0.40  cnf(i_0_103, plain, (ifeq3(genlinverse(X1,X2),true,binarypredicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_95, plain, (ifeq3(genlpreds(X1,X2),true,predicate(X2),true)=true)).
% 0.20/0.40  cnf(i_0_97, plain, (ifeq3(genlpreds(X1,X2),true,predicate(X1),true)=true)).
% 0.20/0.40  cnf(i_0_106, plain, (ifeq3(disjointwith(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_107, plain, (ifeq3(disjointwith(X1,X2),true,collection(X1),true)=true)).
% 0.20/0.40  cnf(i_0_124, plain, (ifeq3(isa(X1,X2),true,collection(X2),true)=true)).
% 0.20/0.40  cnf(i_0_126, plain, (ifeq3(isa(X1,X2),true,thing(X1),true)=true)).
% 0.20/0.40  cnf(i_0_108, plain, (ifeq3(disjointwith(X1,X2),true,disjointwith(X2,X1),true)=true)).
% 0.20/0.40  cnf(i_0_129, plain, (ifeq3(mtvisible(X1),true,ifeq3(genlmt(X1,X2),true,mtvisible(X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_147, plain, (ifeq3(genls(X1,X2),true,ifeq3(genls(X3,X1),true,genls(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_150, plain, (ifeq3(genls(X1,X2),true,ifeq3(genls(X2,X3),true,genls(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_109, plain, (ifeq3(genls(X1,X2),true,ifeq3(disjointwith(X3,X2),true,disjointwith(X3,X1),true),true)=true)).
% 0.20/0.40  cnf(i_0_110, plain, (ifeq3(genls(X1,X2),true,ifeq3(disjointwith(X2,X3),true,disjointwith(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_154, plain, (ifeq(tuple(isa(X1,X2),isa(X1,X3),disjointwith(X2,X3)),tuple(true,true,true),a,b)=b)).
% 0.20/0.40  cnf(i_0_128, plain, (ifeq3(genls(X1,X2),true,ifeq3(isa(X3,X1),true,isa(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_134, plain, (ifeq3(genlmt(X1,X2),true,ifeq3(genlmt(X3,X1),true,genlmt(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_94, plain, (ifeq3(genlinverse(X1,X2),true,ifeq3(genlinverse(X3,X1),true,genlpreds(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_105, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlinverse(X3,X1),true,genlinverse(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_104, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlinverse(X2,X3),true,genlinverse(X1,X3),true),true)=true)).
% 0.20/0.40  cnf(i_0_99, plain, (ifeq3(genlpreds(X1,X2),true,ifeq3(genlpreds(X3,X1),true,genlpreds(X3,X2),true),true)=true)).
% 0.20/0.40  cnf(i_0_156, negated_conjecture, (a!=b)).
% 0.20/0.40  cnf(i_0_160, plain, (X4=X4)).
% 0.20/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.20/0.40  # Begin printing tableau
% 0.20/0.40  # Found 7 steps
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (mtvisible(c_tptp_member2831_mt)=true), inference(start_rule)).
% 0.20/0.40  cnf(i_0_190, plain, (mtvisible(c_tptp_member2831_mt)=true), inference(extension_rule, [i_0_186])).
% 0.20/0.40  cnf(i_0_325, plain, (computerdataartifact(mtvisible(c_tptp_member2831_mt))=computerdataartifact(true)), inference(extension_rule, [i_0_164])).
% 0.20/0.40  cnf(i_0_649, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_650, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_651, plain, (mtvisible(c_tptp_member2831_mt)!=true), inference(closure_rule, [i_0_153])).
% 0.20/0.40  cnf(i_0_647, plain, (ifeq3(computerdataartifact(mtvisible(c_tptp_member2831_mt)),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt),mtvisible(c_tptp_member2831_mt))=ifeq3(computerdataartifact(true),true,true,true)), inference(etableau_closure_rule, [i_0_647, ...])).
% 0.20/0.40  # End printing tableau
% 0.20/0.40  # SZS output end
% 0.20/0.40  # Branches closed with saturation will be marked with an "s"
% 0.20/0.40  # Child (17363) has found a proof.
% 0.20/0.40  
% 0.20/0.41  # Proof search is over...
% 0.20/0.41  # Freeing feature tree
%------------------------------------------------------------------------------