TSTP Solution File: SEU008+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU008+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 : n016.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:26 EDT 2022
% Result : Theorem 0.23s 0.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SEU008+1 : TPTP v8.1.0. Released v3.2.0.
% 0.09/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.37 % Computer : n016.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 600
% 0.14/0.37 % DateTime : Mon Jun 20 03:24:39 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Auto-Mode selected heuristic G_E___107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.14/0.41 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.14/0.41 #
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41 # Number of axioms: 67 Number of unprocessed: 62
% 0.14/0.41 # Tableaux proof search.
% 0.14/0.41 # APR header successfully linked.
% 0.14/0.41 # Hello from C++
% 0.14/0.41 # The folding up rule is enabled...
% 0.14/0.41 # Local unification is enabled...
% 0.14/0.41 # Any saturation attempts will use folding labels...
% 0.14/0.41 # 62 beginning clauses after preprocessing and clausification
% 0.14/0.41 # Creating start rules for all 4 conjectures.
% 0.14/0.41 # There are 4 start rule candidates:
% 0.14/0.41 # Found 27 unit axioms.
% 0.14/0.41 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.41 # 4 start rule tableaux created.
% 0.14/0.41 # 35 extension rule candidate clauses
% 0.14/0.41 # 27 unit axiom clauses
% 0.14/0.41
% 0.14/0.41 # Requested 8, 32 cores available to the main process.
% 0.14/0.41 # There are not enough tableaux to fork, creating more from the initial 4
% 0.14/0.41 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.41 # We now have 14 tableaux to operate on
% 0.23/0.42 # There were 1 total branch saturation attempts.
% 0.23/0.42 # There were 0 of these attempts blocked.
% 0.23/0.42 # There were 0 deferred branch saturation attempts.
% 0.23/0.42 # There were 0 free duplicated saturations.
% 0.23/0.42 # There were 1 total successful branch saturations.
% 0.23/0.42 # There were 0 successful branch saturations in interreduction.
% 0.23/0.42 # There were 0 successful branch saturations on the branch.
% 0.23/0.42 # There were 1 successful branch saturations after the branch.
% 0.23/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.42 # Begin clausification derivation
% 0.23/0.42
% 0.23/0.42 # End clausification derivation
% 0.23/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.23/0.42 cnf(i_0_59, negated_conjecture, (function(esk14_0))).
% 0.23/0.42 cnf(i_0_60, negated_conjecture, (relation(esk14_0))).
% 0.23/0.42 cnf(i_0_24, plain, (function(identity_relation(X1)))).
% 0.23/0.42 cnf(i_0_12, plain, (relation(identity_relation(X1)))).
% 0.23/0.42 cnf(i_0_34, plain, (function(esk3_0))).
% 0.23/0.42 cnf(i_0_17, plain, (relation(empty_set))).
% 0.23/0.42 cnf(i_0_18, plain, (empty(empty_set))).
% 0.23/0.42 cnf(i_0_35, plain, (relation(esk3_0))).
% 0.23/0.42 cnf(i_0_36, plain, (relation(esk4_0))).
% 0.23/0.42 cnf(i_0_41, plain, (relation(esk7_0))).
% 0.23/0.42 cnf(i_0_47, plain, (relation(esk10_0))).
% 0.23/0.42 cnf(i_0_37, plain, (empty(esk4_0))).
% 0.23/0.42 cnf(i_0_40, plain, (empty(esk6_0))).
% 0.23/0.42 cnf(i_0_33, plain, (set_intersection2(X1,X1)=X1)).
% 0.23/0.42 cnf(i_0_16, plain, (relation_empty_yielding(empty_set))).
% 0.23/0.42 cnf(i_0_46, plain, (relation_empty_yielding(esk10_0))).
% 0.23/0.42 cnf(i_0_51, plain, (set_intersection2(X1,empty_set)=empty_set)).
% 0.23/0.42 cnf(i_0_48, plain, (subset(X1,X1))).
% 0.23/0.42 cnf(i_0_43, plain, (empty(esk8_1(X1)))).
% 0.23/0.42 cnf(i_0_13, plain, (element(esk2_1(X1),X1))).
% 0.23/0.42 cnf(i_0_44, plain, (element(esk8_1(X1),powerset(X1)))).
% 0.23/0.42 cnf(i_0_58, negated_conjecture, (in(esk13_0,set_intersection2(esk12_0,relation_dom(esk14_0))))).
% 0.23/0.42 cnf(i_0_4, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.23/0.42 cnf(i_0_42, plain, (~empty(esk7_0))).
% 0.23/0.42 cnf(i_0_45, plain, (~empty(esk9_0))).
% 0.23/0.42 cnf(i_0_22, plain, (~empty(powerset(X1)))).
% 0.23/0.42 cnf(i_0_57, negated_conjecture, (apply(relation_composition(identity_relation(esk12_0),esk14_0),esk13_0)!=apply(esk14_0,esk13_0))).
% 0.23/0.42 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.23/0.42 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 0.23/0.42 cnf(i_0_65, plain, (X1=empty_set|~empty(X1))).
% 0.23/0.42 cnf(i_0_29, plain, (relation(relation_dom(X1))|~empty(X1))).
% 0.23/0.42 cnf(i_0_66, plain, (~empty(X1)|~in(X2,X1))).
% 0.23/0.42 cnf(i_0_21, plain, (relation(set_intersection2(X1,X2))|~relation(X2)|~relation(X1))).
% 0.23/0.42 cnf(i_0_11, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~relation(X1))).
% 0.23/0.42 cnf(i_0_67, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.23/0.42 cnf(i_0_49, plain, (element(X1,X2)|~in(X1,X2))).
% 0.23/0.42 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.23/0.42 cnf(i_0_30, plain, (empty(relation_dom(X1))|~empty(X1))).
% 0.23/0.42 cnf(i_0_14, plain, (relation(relation_composition(X1,X2))|~relation(X1)|~empty(X2))).
% 0.23/0.42 cnf(i_0_31, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~empty(X1))).
% 0.23/0.42 cnf(i_0_19, plain, (function(relation_composition(X1,X2))|~relation(X2)|~relation(X1)|~function(X2)|~function(X1))).
% 0.23/0.42 cnf(i_0_38, plain, (empty(X1)|~empty(esk5_1(X1)))).
% 0.23/0.42 cnf(i_0_28, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))).
% 0.23/0.42 cnf(i_0_56, plain, (relation_dom(X1)=X2|X1!=identity_relation(X2)|~relation(X1)|~function(X1))).
% 0.23/0.42 cnf(i_0_52, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.23/0.42 cnf(i_0_15, plain, (empty(relation_composition(X1,X2))|~relation(X1)|~empty(X2))).
% 0.23/0.42 cnf(i_0_32, plain, (empty(relation_composition(X1,X2))|~relation(X2)|~empty(X1))).
% 0.23/0.42 cnf(i_0_9, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))).
% 0.23/0.42 cnf(i_0_39, plain, (element(esk5_1(X1),powerset(X1))|empty(X1))).
% 0.23/0.42 cnf(i_0_10, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))).
% 0.23/0.42 cnf(i_0_61, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.23/0.42 cnf(i_0_62, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.23/0.42 cnf(i_0_64, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))).
% 0.23/0.42 cnf(i_0_55, plain, (apply(X1,X2)=X2|X1!=identity_relation(X3)|~relation(X1)|~function(X1)|~in(X2,X3))).
% 0.23/0.42 cnf(i_0_8, plain, (in(X1,X2)|X2!=set_intersection2(X3,X4)|~in(X1,X4)|~in(X1,X3))).
% 0.23/0.42 cnf(i_0_54, plain, (X1=identity_relation(X2)|in(esk11_2(X2,X1),X2)|relation_dom(X1)!=X2|~relation(X1)|~function(X1))).
% 0.23/0.42 cnf(i_0_63, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 0.23/0.42 cnf(i_0_53, plain, (X1=identity_relation(X2)|apply(X1,esk11_2(X2,X1))!=esk11_2(X2,X1)|relation_dom(X1)!=X2|~relation(X1)|~function(X1))).
% 0.23/0.42 cnf(i_0_50, plain, (apply(relation_composition(X1,X2),X3)=apply(X2,apply(X1,X3))|~relation(X2)|~relation(X1)|~function(X2)|~function(X1)|~in(X3,relation_dom(X1)))).
% 0.23/0.42 cnf(i_0_5, plain, (X1=set_intersection2(X2,X3)|in(esk1_3(X2,X3,X1),X3)|in(esk1_3(X2,X3,X1),X1))).
% 0.23/0.42 cnf(i_0_6, plain, (X1=set_intersection2(X2,X3)|in(esk1_3(X2,X3,X1),X2)|in(esk1_3(X2,X3,X1),X1))).
% 0.23/0.42 cnf(i_0_7, plain, (X1=set_intersection2(X2,X3)|~in(esk1_3(X2,X3,X1),X1)|~in(esk1_3(X2,X3,X1),X3)|~in(esk1_3(X2,X3,X1),X2))).
% 0.23/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.23/0.42 # Begin printing tableau
% 0.23/0.42 # Found 5 steps
% 0.23/0.42 cnf(i_0_58, negated_conjecture, (in(esk13_0,set_intersection2(esk12_0,relation_dom(esk14_0)))), inference(start_rule)).
% 0.23/0.42 cnf(i_0_69, plain, (in(esk13_0,set_intersection2(esk12_0,relation_dom(esk14_0)))), inference(extension_rule, [i_0_64])).
% 0.23/0.42 cnf(i_0_246, plain, (~empty(empty_set)), inference(closure_rule, [i_0_18])).
% 0.23/0.42 cnf(i_0_245, plain, (~element(set_intersection2(esk12_0,relation_dom(esk14_0)),powerset(empty_set))), inference(extension_rule, [i_0_49])).
% 0.23/0.42 cnf(i_0_306, plain, (~in(set_intersection2(esk12_0,relation_dom(esk14_0)),powerset(empty_set))), inference(etableau_closure_rule, [i_0_306, ...])).
% 0.23/0.42 # End printing tableau
% 0.23/0.42 # SZS output end
% 0.23/0.42 # Branches closed with saturation will be marked with an "s"
% 0.23/0.42 # Child (15055) has found a proof.
% 0.23/0.42
% 0.23/0.42 # Proof search is over...
% 0.23/0.42 # Freeing feature tree
%------------------------------------------------------------------------------