TSTP Solution File: SEU047+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU047+1 : TPTP v8.1.0. Released v3.2.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 : n013.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 : Tue Jul 19 09:23:36 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU047+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 06:37:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 51 Number of unprocessed: 47
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 47 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 4 conjectures.
% 0.12/0.37 # There are 4 start rule candidates:
% 0.12/0.37 # Found 27 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 4 start rule tableaux created.
% 0.12/0.37 # 20 extension rule candidate clauses
% 0.12/0.37 # 27 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 4
% 0.12/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 9 tableaux to operate on
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_51, negated_conjecture, (relation(esk14_0))).
% 0.12/0.37 cnf(i_0_50, negated_conjecture, (function(esk14_0))).
% 0.12/0.37 cnf(i_0_49, negated_conjecture, (subset(esk12_0,esk13_0))).
% 0.12/0.37 cnf(i_0_2, plain, (relation(empty_set))).
% 0.12/0.37 cnf(i_0_3, plain, (empty(empty_set))).
% 0.12/0.37 cnf(i_0_27, plain, (relation(esk2_0))).
% 0.12/0.37 cnf(i_0_30, plain, (relation(esk3_0))).
% 0.12/0.37 cnf(i_0_33, plain, (relation(esk4_0))).
% 0.12/0.37 cnf(i_0_38, plain, (relation(esk7_0))).
% 0.12/0.37 cnf(i_0_40, plain, (relation(esk8_0))).
% 0.12/0.37 cnf(i_0_43, plain, (relation(esk9_0))).
% 0.12/0.37 cnf(i_0_29, plain, (empty(esk3_0))).
% 0.12/0.37 cnf(i_0_39, plain, (empty(esk7_0))).
% 0.12/0.37 cnf(i_0_44, plain, (empty(esk10_0))).
% 0.12/0.37 cnf(i_0_26, plain, (function(esk2_0))).
% 0.12/0.37 cnf(i_0_28, plain, (function(esk3_0))).
% 0.12/0.37 cnf(i_0_32, plain, (function(esk4_0))).
% 0.12/0.37 cnf(i_0_4, plain, (relation_empty_yielding(empty_set))).
% 0.12/0.38 cnf(i_0_42, plain, (relation_empty_yielding(esk9_0))).
% 0.12/0.38 cnf(i_0_31, plain, (one_to_one(esk4_0))).
% 0.12/0.38 cnf(i_0_22, plain, (subset(X1,X1))).
% 0.12/0.38 cnf(i_0_36, plain, (empty(esk6_1(X1)))).
% 0.12/0.38 cnf(i_0_11, plain, (element(esk1_1(X1),X1))).
% 0.12/0.38 cnf(i_0_37, plain, (element(esk6_1(X1),powerset(X1)))).
% 0.12/0.38 cnf(i_0_41, plain, (~empty(esk8_0))).
% 0.12/0.38 cnf(i_0_45, plain, (~empty(esk11_0))).
% 0.12/0.38 cnf(i_0_16, plain, (~empty(powerset(X1)))).
% 0.12/0.38 cnf(i_0_48, negated_conjecture, (relation_rng_restriction(esk12_0,relation_rng_restriction(esk13_0,esk14_0))!=relation_rng_restriction(esk12_0,esk14_0)|relation_rng_restriction(esk13_0,relation_rng_restriction(esk12_0,esk14_0))!=relation_rng_restriction(esk12_0,esk14_0))).
% 0.12/0.38 cnf(i_0_20, plain, (~empty(X1)|~in(X2,X1))).
% 0.12/0.38 cnf(i_0_17, plain, (relation(X1)|~empty(X1))).
% 0.12/0.38 cnf(i_0_12, plain, (function(X1)|~empty(X1))).
% 0.12/0.38 cnf(i_0_19, plain, (X1=empty_set|~empty(X1))).
% 0.12/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.12/0.38 cnf(i_0_23, plain, (relation(relation_rng_restriction(X1,X2))|~relation(X2))).
% 0.12/0.38 cnf(i_0_24, plain, (function(relation_rng_restriction(X1,X2))|~function(X2)|~relation(X2))).
% 0.12/0.38 cnf(i_0_34, plain, (empty(X1)|~empty(esk5_1(X1)))).
% 0.12/0.38 cnf(i_0_21, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.12/0.38 cnf(i_0_8, plain, (element(X1,X2)|~in(X1,X2))).
% 0.12/0.38 cnf(i_0_13, plain, (one_to_one(X1)|~empty(X1))).
% 0.12/0.38 cnf(i_0_47, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.12/0.38 cnf(i_0_10, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))).
% 0.12/0.38 cnf(i_0_46, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.12/0.38 cnf(i_0_18, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.12/0.38 cnf(i_0_52, plain, (relation_rng_restriction(X1,relation_rng_restriction(X2,X3))=relation_rng_restriction(X2,X3)|~subset(X2,X1)|~relation(X3))).
% 0.12/0.38 cnf(i_0_53, plain, (relation_rng_restriction(X1,relation_rng_restriction(X2,X3))=relation_rng_restriction(X1,X3)|~subset(X1,X2)|~relation(X3))).
% 0.12/0.38 cnf(i_0_35, plain, (element(esk5_1(X1),powerset(X1))|empty(X1))).
% 0.12/0.38 cnf(i_0_9, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 5 steps
% 0.12/0.38 cnf(i_0_51, negated_conjecture, (relation(esk14_0)), inference(start_rule)).
% 0.12/0.38 cnf(i_0_58, plain, (relation(esk14_0)), inference(extension_rule, [i_0_23])).
% 0.12/0.38 cnf(i_0_257, plain, (relation(relation_rng_restriction(X3,esk14_0))), inference(extension_rule, [i_0_52])).
% 0.12/0.38 cnf(i_0_492, plain, (~subset(X5,X5)), inference(closure_rule, [i_0_22])).
% 0.12/0.38 cnf(i_0_491, plain, (relation_rng_restriction(X5,relation_rng_restriction(X5,relation_rng_restriction(X3,esk14_0)))=relation_rng_restriction(X5,relation_rng_restriction(X3,esk14_0))), inference(etableau_closure_rule, [i_0_491, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # Child (12214) has found a proof.
% 0.12/0.38
% 0.12/0.38 # Proof search is over...
% 0.12/0.38 # Freeing feature tree
%------------------------------------------------------------------------------