TSTP Solution File: SEU080+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU080+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 : 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 : Tue Jul 19 09:23:44 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.10/0.11 % Problem : SEU080+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/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 : n017.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 01:21:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 55 Number of unprocessed: 50
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 50 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 6 conjectures.
% 0.12/0.36 # There are 6 start rule candidates:
% 0.12/0.36 # Found 30 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 6 start rule tableaux created.
% 0.12/0.36 # 20 extension rule candidate clauses
% 0.12/0.36 # 30 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 6
% 0.12/0.36 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 12 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 # 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/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/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_47, negated_conjecture, (function(esk14_0))).
% 0.12/0.37 cnf(i_0_48, negated_conjecture, (relation(esk14_0))).
% 0.12/0.37 cnf(i_0_45, negated_conjecture, (subset(esk12_0,relation_rng(esk14_0)))).
% 0.12/0.37 cnf(i_0_44, negated_conjecture, (subset(esk13_0,relation_rng(esk14_0)))).
% 0.12/0.37 cnf(i_0_13, plain, (empty(empty_set))).
% 0.12/0.37 cnf(i_0_21, plain, (function(esk2_0))).
% 0.12/0.37 cnf(i_0_28, plain, (function(esk6_0))).
% 0.12/0.37 cnf(i_0_46, negated_conjecture, (relation_inverse_image(esk14_0,esk13_0)=relation_inverse_image(esk14_0,esk12_0))).
% 0.12/0.37 cnf(i_0_37, plain, (function(esk10_0))).
% 0.12/0.37 cnf(i_0_12, plain, (relation(empty_set))).
% 0.12/0.37 cnf(i_0_22, plain, (relation(esk2_0))).
% 0.12/0.37 cnf(i_0_24, plain, (empty(esk3_0))).
% 0.12/0.37 cnf(i_0_27, plain, (empty(esk5_0))).
% 0.12/0.37 cnf(i_0_29, plain, (empty(esk6_0))).
% 0.12/0.37 cnf(i_0_23, plain, (relation(esk3_0))).
% 0.12/0.37 cnf(i_0_30, plain, (relation(esk6_0))).
% 0.12/0.37 cnf(i_0_31, plain, (relation(esk7_0))).
% 0.12/0.37 cnf(i_0_38, plain, (relation(esk10_0))).
% 0.12/0.37 cnf(i_0_40, plain, (relation(esk11_0))).
% 0.12/0.37 cnf(i_0_36, plain, (one_to_one(esk10_0))).
% 0.12/0.37 cnf(i_0_11, plain, (relation_empty_yielding(empty_set))).
% 0.12/0.37 cnf(i_0_39, plain, (relation_empty_yielding(esk11_0))).
% 0.12/0.37 cnf(i_0_41, plain, (subset(X1,X1))).
% 0.12/0.37 cnf(i_0_33, plain, (empty(esk8_1(X1)))).
% 0.12/0.37 cnf(i_0_10, plain, (element(esk1_1(X1),X1))).
% 0.12/0.37 cnf(i_0_34, plain, (element(esk8_1(X1),powerset(X1)))).
% 0.12/0.37 cnf(i_0_43, negated_conjecture, (esk13_0!=esk12_0)).
% 0.12/0.37 cnf(i_0_32, plain, (~empty(esk7_0))).
% 0.12/0.37 cnf(i_0_35, plain, (~empty(esk9_0))).
% 0.12/0.37 cnf(i_0_14, plain, (~empty(powerset(X1)))).
% 0.12/0.37 cnf(i_0_56, plain, (~empty(X1)|~in(X2,X1))).
% 0.12/0.37 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.12/0.37 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 0.12/0.37 cnf(i_0_55, plain, (X1=empty_set|~empty(X1))).
% 0.12/0.37 cnf(i_0_19, plain, (relation(relation_rng(X1))|~empty(X1))).
% 0.12/0.37 cnf(i_0_57, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.12/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.12/0.37 cnf(i_0_25, plain, (empty(X1)|~empty(esk4_1(X1)))).
% 0.12/0.37 cnf(i_0_49, plain, (element(X1,X2)|~in(X1,X2))).
% 0.12/0.37 cnf(i_0_18, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))).
% 0.12/0.37 cnf(i_0_20, plain, (empty(relation_rng(X1))|~empty(X1))).
% 0.12/0.37 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1))).
% 0.12/0.37 cnf(i_0_52, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.12/0.37 cnf(i_0_7, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.12/0.37 cnf(i_0_51, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.12/0.37 cnf(i_0_26, plain, (element(esk4_1(X1),powerset(X1))|empty(X1))).
% 0.12/0.37 cnf(i_0_54, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))).
% 0.12/0.37 cnf(i_0_50, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.12/0.37 cnf(i_0_53, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 0.12/0.37 cnf(i_0_42, plain, (subset(X1,X2)|~subset(relation_inverse_image(X3,X1),relation_inverse_image(X3,X2))|~subset(X1,relation_rng(X3))|~relation(X3)|~function(X3))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 7 steps
% 0.12/0.37 cnf(i_0_47, negated_conjecture, (function(esk14_0)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_65, plain, (function(esk14_0)), inference(extension_rule, [i_0_42])).
% 0.12/0.37 cnf(i_0_307, plain, (~subset(relation_inverse_image(esk14_0,relation_rng(esk14_0)),relation_inverse_image(esk14_0,relation_rng(esk14_0)))), inference(closure_rule, [i_0_41])).
% 0.12/0.37 cnf(i_0_308, plain, (~subset(relation_rng(esk14_0),relation_rng(esk14_0))), inference(closure_rule, [i_0_41])).
% 0.12/0.37 cnf(i_0_309, plain, (~relation(esk14_0)), inference(closure_rule, [i_0_48])).
% 0.12/0.37 cnf(i_0_306, plain, (subset(relation_rng(esk14_0),relation_rng(esk14_0))), inference(extension_rule, [i_0_51])).
% 0.12/0.37 cnf(i_0_342, plain, (element(relation_rng(esk14_0),powerset(relation_rng(esk14_0)))), inference(etableau_closure_rule, [i_0_342, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/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_47, negated_conjecture, (function(esk14_0))).
% 0.12/0.37 cnf(i_0_48, negated_conjecture, (relation(esk14_0))).
% 0.12/0.37 cnf(i_0_45, negated_conjecture, (subset(esk12_0,relation_rng(esk14_0)))).
% 0.12/0.37 cnf(i_0_44, negated_conjecture, (subset(esk13_0,relation_rng(esk14_0)))).
% 0.12/0.37 cnf(i_0_13, plain, (empty(empty_set))).
% 0.12/0.37 cnf(i_0_21, plain, (function(esk2_0))).
% 0.12/0.37 cnf(i_0_28, plain, (function(esk6_0))).
% 0.12/0.37 cnf(i_0_46, negated_conjecture, (relation_inverse_image(esk14_0,esk13_0)=relation_inverse_image(esk14_0,esk12_0))).
% 0.12/0.37 cnf(i_0_37, plain, (function(esk10_0))).
% 0.12/0.37 cnf(i_0_12, plain, (relation(empty_set))).
% 0.12/0.37 cnf(i_0_22, plain, (relation(esk2_0))).
% 0.12/0.37 cnf(i_0_24, plain, (empty(esk3_0))).
% 0.12/0.37 cnf(i_0_27, plain, (empty(esk5_0))).
% 0.12/0.37 cnf(i_0_29, plain, (empty(esk6_0))).
% 0.12/0.37 cnf(i_0_23, plain, (relation(esk3_0))).
% 0.12/0.37 cnf(i_0_30, plain, (relation(esk6_0))).
% 0.12/0.37 cnf(i_0_31, plain, (relation(esk7_0))).
% 0.12/0.37 cnf(i_0_38, plain, (relation(esk10_0))).
% 0.12/0.37 cnf(i_0_40, plain, (relation(esk11_0))).
% 0.12/0.37 cnf(i_0_36, plain, (one_to_one(esk10_0))).
% 0.12/0.37 cnf(i_0_11, plain, (relation_empty_yielding(empty_set))).
% 0.12/0.37 cnf(i_0_39, plain, (relation_empty_yielding(esk11_0))).
% 0.12/0.37 cnf(i_0_41, plain, (subset(X1,X1))).
% 0.12/0.37 cnf(i_0_33, plain, (empty(esk8_1(X1)))).
% 0.12/0.37 cnf(i_0_10, plain, (element(esk1_1(X1),X1))).
% 0.12/0.37 cnf(i_0_34, plain, (element(esk8_1(X1),powerset(X1)))).
% 0.12/0.37 cnf(i_0_43, negated_conjecture, (esk13_0!=esk12_0)).
% 0.12/0.37 cnf(i_0_32, plain, (~empty(esk7_0))).
% 0.12/0.37 cnf(i_0_35, plain, (~empty(esk9_0))).
% 0.12/0.37 cnf(i_0_14, plain, (~empty(powerset(X1)))).
% 0.12/0.37 cnf(i_0_56, plain, (~empty(X1)|~in(X2,X1))).
% 0.12/0.37 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.12/0.37 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 0.12/0.37 cnf(i_0_55, plain, (X1=empty_set|~empty(X1))).
% 0.12/0.37 cnf(i_0_19, plain, (relation(relation_rng(X1))|~empty(X1))).
% 0.12/0.37 cnf(i_0_57, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.12/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.12/0.37 cnf(i_0_25, plain, (empty(X1)|~empty(esk4_1(X1)))).
% 0.12/0.37 cnf(i_0_49, plain, (element(X1,X2)|~in(X1,X2))).
% 0.12/0.37 cnf(i_0_18, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))).
% 0.12/0.37 cnf(i_0_20, plain, (empty(relation_rng(X1))|~empty(X1))).
% 0.12/0.37 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1))).
% 0.12/0.37 cnf(i_0_52, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.12/0.37 cnf(i_0_7, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 0.12/0.37 cnf(i_0_51, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.12/0.37 cnf(i_0_26, plain, (element(esk4_1(X1),powerset(X1))|empty(X1))).
% 0.12/0.37 cnf(i_0_54, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))).
% 0.12/0.37 cnf(i_0_50, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.12/0.37 cnf(i_0_53, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 0.12/0.37 cnf(i_0_42, plain, (subset(X1,X2)|~subset(relation_inverse_image(X3,X1),relation_inverse_image(X3,X2))|~subset(X1,relation_rng(X3))|~relation(X3)|~function(X3))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 8 steps
% 0.12/0.37 cnf(i_0_45, negated_conjecture, (subset(esk12_0,relation_rng(esk14_0))), inference(start_rule)).
% 0.12/0.37 cnf(i_0_63, plain, (subset(esk12_0,relation_rng(esk14_0))), inference(extension_rule, [i_0_42])).
% 0.12/0.37 cnf(i_0_258, plain, (~subset(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,esk12_0))), inference(closure_rule, [i_0_41])).
% 0.12/0.37 cnf(i_0_260, plain, (~relation(esk14_0)), inference(closure_rule, [i_0_48])).
% 0.12/0.37 cnf(i_0_261, plain, (~function(esk14_0)), inference(closure_rule, [i_0_47])).
% 0.12/0.37 cnf(i_0_257, plain, (subset(esk12_0,esk12_0)), inference(extension_rule, [i_0_7])).
% 0.12/0.37 cnf(i_0_292, plain, (~subset(esk12_0,esk12_0)), inference(closure_rule, [i_0_41])).
% 0.12/0.37 cnf(i_0_290, plain, (esk12_0=esk12_0), inference(etableau_closure_rule, [i_0_290, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # Child (21671) has found a proof.
% 0.12/0.38
% 0.12/0.38 # Proof search is over...
% 0.12/0.38 # Freeing feature tree
%------------------------------------------------------------------------------