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