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