TSTP Solution File: CSR055+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : CSR055+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 : n028.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:11:19 EDT 2022
% Result : Theorem 0.14s 0.37s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR055+1 : TPTP v8.1.0. Released v3.4.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.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 21:56:48 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.37 #
% 0.14/0.37 # Presaturation interreduction done
% 0.14/0.37 # Number of axioms: 56 Number of unprocessed: 44
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.14/0.37 # The folding up rule is enabled...
% 0.14/0.37 # Local unification is enabled...
% 0.14/0.37 # Any saturation attempts will use folding labels...
% 0.14/0.37 # 44 beginning clauses after preprocessing and clausification
% 0.14/0.37 # Creating start rules for all 1 conjectures.
% 0.14/0.37 # There are 1 start rule candidates:
% 0.14/0.37 # Found 11 unit axioms.
% 0.14/0.37 # 1 start rule tableaux created.
% 0.14/0.37 # 33 extension rule candidate clauses
% 0.14/0.37 # 11 unit axiom clauses
% 0.14/0.37
% 0.14/0.37 # Requested 8, 32 cores available to the main process.
% 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.37 # We now have 10 tableaux to operate on
% 0.14/0.37 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done.
% 0.14/0.37 # There were 0 total branch saturation attempts.
% 0.14/0.37 # There were 0 of these attempts blocked.
% 0.14/0.37 # There were 0 deferred branch saturation attempts.
% 0.14/0.37 # There were 0 free duplicated saturations.
% 0.14/0.37 # There were 0 total successful branch saturations.
% 0.14/0.37 # There were 0 successful branch saturations in interreduction.
% 0.14/0.37 # There were 0 successful branch saturations on the branch.
% 0.14/0.37 # There were 0 successful branch saturations after the branch.
% 0.14/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 # Begin clausification derivation
% 0.14/0.37
% 0.14/0.37 # End clausification derivation
% 0.14/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.37 cnf(i_0_1, plain, (individual(c_xskijump_thegame))).
% 0.14/0.37 cnf(i_0_56, negated_conjecture, (disjointwith(c_xskijump_thegame,c_tptpcol_16_35301))).
% 0.14/0.37 cnf(i_0_3, plain, (transitivebinarypredicate(c_genlmt))).
% 0.14/0.37 cnf(i_0_55, plain, (mtvisible(c_universalvocabularymt))).
% 0.14/0.37 cnf(i_0_39, plain, (mtvisible(c_corecyclmt))).
% 0.14/0.37 cnf(i_0_36, plain, (mtvisible(c_logicaltruthmt))).
% 0.14/0.37 cnf(i_0_28, plain, (mtvisible(c_basekb))).
% 0.14/0.37 cnf(i_0_6, plain, (disjointwith(c_collection,c_individual))).
% 0.14/0.37 cnf(i_0_2, plain, (genlmt(c_universalvocabularymt,c_corecyclmt))).
% 0.14/0.37 cnf(i_0_4, plain, (genlmt(c_corecyclmt,c_logicaltruthmt))).
% 0.14/0.37 cnf(i_0_9, plain, (arg2isa(c_disjointwith,c_collection))).
% 0.14/0.37 cnf(i_0_5, plain, (~collection(X1)|~individual(X1))).
% 0.14/0.37 cnf(i_0_13, plain, (collection(X1)|~arg2isa(X2,X1))).
% 0.14/0.37 cnf(i_0_48, plain, (individual(X1)|~isa(X1,c_individual))).
% 0.14/0.37 cnf(i_0_37, plain, (transitivebinarypredicate(X1)|~isa(X1,c_transitivebinarypredicate))).
% 0.14/0.37 cnf(i_0_30, plain, (isa(X1,c_collection)|~collection(X1))).
% 0.14/0.37 cnf(i_0_49, plain, (isa(X1,c_individual)|~individual(X1))).
% 0.14/0.37 cnf(i_0_38, plain, (isa(X1,c_transitivebinarypredicate)|~transitivebinarypredicate(X1))).
% 0.14/0.37 cnf(i_0_29, plain, (collection(X1)|~isa(X1,c_collection))).
% 0.14/0.37 cnf(i_0_10, plain, (collection(X1)|~disjointwith(X2,X1))).
% 0.14/0.37 cnf(i_0_50, plain, (collection(X1)|~isa(X2,X1))).
% 0.14/0.37 cnf(i_0_32, plain, (collection(X1)|~disjointwith(X1,X2))).
% 0.14/0.37 cnf(i_0_33, plain, (disjointwith(X1,X2)|~disjointwith(X2,X1))).
% 0.14/0.37 cnf(i_0_14, plain, (relation(X1)|~arg2isa(X1,X2))).
% 0.14/0.37 cnf(i_0_17, plain, (predicate(X1)|~genlpreds(X2,X1))).
% 0.14/0.37 cnf(i_0_46, plain, (genlmt(X1,X1)|~microtheory(X1))).
% 0.14/0.37 cnf(i_0_19, plain, (predicate(X1)|~genlpreds(X1,X2))).
% 0.14/0.37 cnf(i_0_24, plain, (binarypredicate(X1)|~genlinverse(X2,X1))).
% 0.14/0.37 cnf(i_0_22, plain, (genlpreds(X1,X1)|~predicate(X1))).
% 0.14/0.37 cnf(i_0_25, plain, (binarypredicate(X1)|~genlinverse(X1,X2))).
% 0.14/0.38 cnf(i_0_41, plain, (microtheory(X1)|~genlmt(X2,X1))).
% 0.14/0.38 cnf(i_0_43, plain, (microtheory(X1)|~genlmt(X1,X2))).
% 0.14/0.38 cnf(i_0_52, plain, (thing(X1)|~isa(X1,X2))).
% 0.14/0.38 cnf(i_0_7, plain, (~isa(X1,X2)|~isa(X1,X3)|~disjointwith(X3,X2))).
% 0.14/0.38 cnf(i_0_40, plain, (mtvisible(X1)|~mtvisible(X2)|~genlmt(X2,X1))).
% 0.14/0.38 cnf(i_0_35, plain, (disjointwith(X1,X2)|~genls(X1,X3)|~disjointwith(X3,X2))).
% 0.14/0.38 cnf(i_0_34, plain, (disjointwith(X1,X2)|~genls(X2,X3)|~disjointwith(X1,X3))).
% 0.14/0.38 cnf(i_0_45, plain, (genlmt(X1,X2)|~genlmt(X3,X2)|~genlmt(X1,X3))).
% 0.14/0.38 cnf(i_0_54, plain, (isa(X1,X2)|~genls(X3,X2)|~isa(X1,X3))).
% 0.14/0.38 cnf(i_0_26, plain, (genlinverse(X1,X2)|~genlpreds(X1,X3)|~genlinverse(X3,X2))).
% 0.14/0.38 cnf(i_0_27, plain, (genlinverse(X1,X2)|~genlpreds(X3,X2)|~genlinverse(X1,X3))).
% 0.14/0.38 cnf(i_0_8, plain, (genlpreds(X1,X2)|~genlinverse(X3,X2)|~genlinverse(X1,X3))).
% 0.14/0.38 cnf(i_0_21, plain, (genlpreds(X1,X2)|~genlpreds(X3,X2)|~genlpreds(X1,X3))).
% 0.14/0.38 cnf(i_0_15, plain, (arg2isa(X1,X2)|~genls(X3,X2)|~arg2isa(X1,X3))).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 4 steps
% 0.14/0.38 cnf(i_0_56, negated_conjecture, (disjointwith(c_xskijump_thegame,c_tptpcol_16_35301)), inference(start_rule)).
% 0.14/0.38 cnf(i_0_57, plain, (disjointwith(c_xskijump_thegame,c_tptpcol_16_35301)), inference(extension_rule, [i_0_32])).
% 0.14/0.38 cnf(i_0_78, plain, (collection(c_xskijump_thegame)), inference(extension_rule, [i_0_5])).
% 0.14/0.38 cnf(i_0_385, plain, (~individual(c_xskijump_thegame)), inference(closure_rule, [i_0_1])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # Child (3728) has found a proof.
% 0.14/0.38
% 0.14/0.38 # Proof search is over...
% 0.14/0.38 # Freeing feature tree
%------------------------------------------------------------------------------