TSTP Solution File: CSR044+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : CSR044+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 : n017.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:08:17 EDT 2022
% Result : Theorem 0.23s 0.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : CSR044+1 : TPTP v8.1.0. Released v3.4.0.
% 0.08/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.37 % Computer : n017.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Fri Jun 10 06:28:50 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.23/0.40 # No SInE strategy applied
% 0.23/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.40 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.23/0.40 #
% 0.23/0.40 # Presaturation interreduction done
% 0.23/0.40 # Number of axioms: 66 Number of unprocessed: 58
% 0.23/0.40 # Tableaux proof search.
% 0.23/0.40 # APR header successfully linked.
% 0.23/0.40 # Hello from C++
% 0.23/0.41 # The folding up rule is enabled...
% 0.23/0.41 # Local unification is enabled...
% 0.23/0.41 # Any saturation attempts will use folding labels...
% 0.23/0.41 # 58 beginning clauses after preprocessing and clausification
% 0.23/0.41 # Creating start rules for all 2 conjectures.
% 0.23/0.41 # There are 2 start rule candidates:
% 0.23/0.41 # Found 18 unit axioms.
% 0.23/0.41 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.23/0.41 # 2 start rule tableaux created.
% 0.23/0.41 # 40 extension rule candidate clauses
% 0.23/0.41 # 18 unit axiom clauses
% 0.23/0.41
% 0.23/0.41 # Requested 8, 32 cores available to the main process.
% 0.23/0.41 # There are not enough tableaux to fork, creating more from the initial 2
% 0.23/0.41 # There were 1 total branch saturation attempts.
% 0.23/0.41 # There were 0 of these attempts blocked.
% 0.23/0.41 # There were 0 deferred branch saturation attempts.
% 0.23/0.41 # There were 0 free duplicated saturations.
% 0.23/0.41 # There were 1 total successful branch saturations.
% 0.23/0.41 # There were 0 successful branch saturations in interreduction.
% 0.23/0.41 # There were 0 successful branch saturations on the branch.
% 0.23/0.41 # There were 1 successful branch saturations after the branch.
% 0.23/0.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/0.41 # Begin clausification derivation
% 0.23/0.41
% 0.23/0.41 # End clausification derivation
% 0.23/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.23/0.41 cnf(i_0_66, negated_conjecture, (mtvisible(c_tptp_member3633_mt))).
% 0.23/0.41 cnf(i_0_40, plain, (mtvisible(c_basekb))).
% 0.23/0.41 cnf(i_0_64, plain, (mtvisible(c_universalvocabularymt))).
% 0.23/0.41 cnf(i_0_12, plain, (executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90))).
% 0.23/0.41 cnf(i_0_4, plain, (transitivebinarypredicate(c_genlmt))).
% 0.23/0.41 cnf(i_0_9, plain, (genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt))).
% 0.23/0.41 cnf(i_0_2, plain, (resultisaarg(c_relationallexistsfn,n_4))).
% 0.23/0.41 cnf(i_0_3, plain, (genlmt(c_calendarsmt,c_calendarsvocabularymt))).
% 0.23/0.41 cnf(i_0_7, plain, (genlmt(c_calendarsvocabularymt,c_basekb))).
% 0.23/0.41 cnf(i_0_5, plain, (genlmt(c_basekb,c_universalvocabularymt))).
% 0.23/0.41 cnf(i_0_6, plain, (genlmt(c_cyclistsmt,c_calendarsmt))).
% 0.23/0.41 cnf(i_0_8, plain, (genlmt(c_tptp_spindleheadmt,c_cyclistsmt))).
% 0.23/0.41 cnf(i_0_61, plain, (thing(f_relationallexistsfn(X1,X2,X3,X4)))).
% 0.23/0.41 cnf(i_0_56, plain, (natfunction(f_relationallexistsfn(X1,X2,X3,X4),c_relationallexistsfn))).
% 0.23/0.41 cnf(i_0_60, plain, (natargument(f_relationallexistsfn(X1,X2,X3,X4),n_4,X4))).
% 0.23/0.41 cnf(i_0_57, plain, (natargument(f_relationallexistsfn(X1,X2,X3,X4),n_1,X1))).
% 0.23/0.41 cnf(i_0_58, plain, (natargument(f_relationallexistsfn(X1,X2,X3,X4),n_2,X2))).
% 0.23/0.41 cnf(i_0_59, plain, (natargument(f_relationallexistsfn(X1,X2,X3,X4),n_3,X3))).
% 0.23/0.41 cnf(i_0_65, negated_conjecture, (~tptpcol_16_29490(X1)|~tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1))).
% 0.23/0.41 cnf(i_0_36, plain, (executionbyfiringsquad(X1)|~tptp_9_720(X1,X2))).
% 0.23/0.41 cnf(i_0_41, plain, (transitivebinarypredicate(X1)|~isa(X1,c_transitivebinarypredicate))).
% 0.23/0.41 cnf(i_0_33, plain, (executionbyfiringsquad(X1)|~isa(X1,c_executionbyfiringsquad))).
% 0.23/0.41 cnf(i_0_31, plain, (tptpcol_16_29490(X1)|~isa(X1,c_tptpcol_16_29490))).
% 0.23/0.41 cnf(i_0_32, plain, (isa(X1,c_tptpcol_16_29490)|~tptpcol_16_29490(X1))).
% 0.23/0.41 cnf(i_0_34, plain, (isa(X1,c_executionbyfiringsquad)|~executionbyfiringsquad(X1))).
% 0.23/0.41 cnf(i_0_42, plain, (isa(X1,c_transitivebinarypredicate)|~transitivebinarypredicate(X1))).
% 0.23/0.41 cnf(i_0_37, plain, (collection(X1)|~relationallexists(X2,X3,X1))).
% 0.23/0.41 cnf(i_0_38, plain, (collection(X1)|~relationallexists(X2,X1,X3))).
% 0.23/0.41 cnf(i_0_35, plain, (tptpcol_5_28674(X1)|~tptp_9_720(X2,X1))).
% 0.23/0.41 cnf(i_0_48, plain, (mtvisible(X1)|~mtvisible(X2)|~genlmt(X2,X1))).
% 0.23/0.41 cnf(i_0_15, plain, (predicate(X1)|~genlpreds(X2,X1))).
% 0.23/0.41 cnf(i_0_17, plain, (predicate(X1)|~genlpreds(X1,X2))).
% 0.23/0.41 cnf(i_0_54, plain, (genlmt(X1,X1)|~microtheory(X1))).
% 0.23/0.41 cnf(i_0_11, plain, (relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)|~mtvisible(c_cyclistsmt))).
% 0.23/0.41 cnf(i_0_22, plain, (binarypredicate(X1)|~genlinverse(X2,X1))).
% 0.23/0.41 cnf(i_0_23, plain, (binarypredicate(X1)|~genlinverse(X1,X2))).
% 0.23/0.41 cnf(i_0_43, plain, (collection(X1)|~isa(X2,X1))).
% 0.23/0.41 cnf(i_0_26, plain, (collection(X1)|~disjointwith(X2,X1))).
% 0.23/0.41 cnf(i_0_27, plain, (collection(X1)|~disjointwith(X1,X2))).
% 0.23/0.41 cnf(i_0_45, plain, (thing(X1)|~isa(X1,X2))).
% 0.23/0.41 cnf(i_0_20, plain, (genlpreds(X1,X1)|~predicate(X1))).
% 0.23/0.41 cnf(i_0_49, plain, (microtheory(X1)|~genlmt(X2,X1))).
% 0.23/0.41 cnf(i_0_51, plain, (microtheory(X1)|~genlmt(X1,X2))).
% 0.23/0.41 cnf(i_0_62, plain, (positiveinteger(X1)|~resultisaarg(X2,X1))).
% 0.23/0.41 cnf(i_0_63, plain, (function_denotational(X1)|~resultisaarg(X1,X2))).
% 0.23/0.41 cnf(i_0_39, plain, (binarypredicate(X1)|~relationallexists(X1,X2,X3))).
% 0.23/0.41 cnf(i_0_28, plain, (disjointwith(X1,X2)|~disjointwith(X2,X1))).
% 0.23/0.41 cnf(i_0_47, plain, (isa(X1,X2)|~genls(X3,X2)|~isa(X1,X3))).
% 0.23/0.41 cnf(i_0_13, plain, (~disjointwith(X1,X2)|~isa(X3,X2)|~isa(X3,X1))).
% 0.23/0.41 cnf(i_0_53, plain, (genlmt(X1,X2)|~genlmt(X3,X2)|~genlmt(X1,X3))).
% 0.23/0.41 cnf(i_0_30, plain, (disjointwith(X1,X2)|~genls(X1,X3)|~disjointwith(X3,X2))).
% 0.23/0.41 cnf(i_0_29, plain, (disjointwith(X1,X2)|~genls(X2,X3)|~disjointwith(X1,X3))).
% 0.23/0.41 cnf(i_0_24, plain, (genlinverse(X1,X2)|~genlpreds(X1,X3)|~genlinverse(X3,X2))).
% 0.23/0.41 cnf(i_0_25, plain, (genlinverse(X1,X2)|~genlpreds(X3,X2)|~genlinverse(X1,X3))).
% 0.23/0.41 cnf(i_0_14, plain, (genlpreds(X1,X2)|~genlinverse(X3,X2)|~genlinverse(X1,X3))).
% 0.23/0.41 cnf(i_0_19, plain, (genlpreds(X1,X2)|~genlpreds(X3,X2)|~genlpreds(X1,X3))).
% 0.23/0.41 cnf(i_0_10, plain, (tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))|~executionbyfiringsquad(X1)|~mtvisible(c_cyclistsmt))).
% 0.23/0.41 cnf(i_0_1, plain, (isa(f_relationallexistsfn(X1,X2,X3,X4),X4)|~relationallexists(X2,X3,X4)|~isa(X1,X3))).
% 0.23/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.23/0.41 # Begin printing tableau
% 0.23/0.41 # Found 6 steps
% 0.23/0.41 cnf(i_0_66, negated_conjecture, (mtvisible(c_tptp_member3633_mt)), inference(start_rule)).
% 0.23/0.41 cnf(i_0_69, plain, (mtvisible(c_tptp_member3633_mt)), inference(extension_rule, [i_0_48])).
% 0.23/0.41 cnf(i_0_276, plain, (~genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt)), inference(closure_rule, [i_0_9])).
% 0.23/0.41 cnf(i_0_274, plain, (mtvisible(c_tptp_spindleheadmt)), inference(extension_rule, [i_0_48])).
% 0.23/0.41 cnf(i_0_368, plain, (~genlmt(c_tptp_spindleheadmt,c_cyclistsmt)), inference(closure_rule, [i_0_8])).
% 0.23/0.41 cnf(i_0_366, plain, (mtvisible(c_cyclistsmt)), inference(etableau_closure_rule, [i_0_366, ...])).
% 0.23/0.41 # End printing tableau
% 0.23/0.41 # SZS output end
% 0.23/0.41 # Branches closed with saturation will be marked with an "s"
% 0.23/0.41 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
% 0.23/0.41 # We now have 3 tableaux to operate on
% 0.23/0.41 # Found closed tableau during pool population.
% 0.23/0.41 # Proof search is over...
% 0.23/0.41 # Freeing feature tree
%------------------------------------------------------------------------------