TSTP Solution File: SEU215+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU215+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 : n008.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:50 EDT 2022
% Result : Theorem 0.19s 0.45s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU215+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 : n008.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 07:46:22 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 0.13/0.37 # and selection function SelectCQArNTNpEqFirst.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 53 Number of unprocessed: 47
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 47 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 6 conjectures.
% 0.13/0.37 # There are 6 start rule candidates:
% 0.13/0.37 # Found 23 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 6 start rule tableaux created.
% 0.13/0.37 # 24 extension rule candidate clauses
% 0.13/0.37 # 23 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 6
% 0.13/0.37 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 14 tableaux to operate on
% 0.19/0.43 # Creating equality axioms
% 0.19/0.43 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.45 # There were 1 total branch saturation attempts.
% 0.19/0.45 # There were 0 of these attempts blocked.
% 0.19/0.45 # There were 0 deferred branch saturation attempts.
% 0.19/0.45 # There were 0 free duplicated saturations.
% 0.19/0.45 # There were 1 total successful branch saturations.
% 0.19/0.45 # There were 0 successful branch saturations in interreduction.
% 0.19/0.45 # There were 0 successful branch saturations on the branch.
% 0.19/0.45 # There were 1 successful branch saturations after the branch.
% 0.19/0.45 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Begin clausification derivation
% 0.19/0.45
% 0.19/0.45 # End clausification derivation
% 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.45 cnf(i_0_56, negated_conjecture, (function(esk9_0))).
% 0.19/0.45 cnf(i_0_54, negated_conjecture, (function(esk10_0))).
% 0.19/0.45 cnf(i_0_57, negated_conjecture, (relation(esk9_0))).
% 0.19/0.45 cnf(i_0_55, negated_conjecture, (relation(esk10_0))).
% 0.19/0.45 cnf(i_0_53, negated_conjecture, (in(esk8_0,relation_dom(esk9_0)))).
% 0.19/0.45 cnf(i_0_23, plain, (empty(empty_set))).
% 0.19/0.45 cnf(i_0_37, plain, (function(esk2_0))).
% 0.19/0.45 cnf(i_0_22, plain, (relation(empty_set))).
% 0.19/0.45 cnf(i_0_38, plain, (relation(esk2_0))).
% 0.19/0.45 cnf(i_0_39, plain, (relation(esk3_0))).
% 0.19/0.45 cnf(i_0_42, plain, (relation(esk5_0))).
% 0.19/0.45 cnf(i_0_40, plain, (empty(esk3_0))).
% 0.19/0.45 cnf(i_0_46, plain, (relation(esk7_0))).
% 0.19/0.45 cnf(i_0_41, plain, (empty(esk4_0))).
% 0.19/0.45 cnf(i_0_21, plain, (relation_empty_yielding(empty_set))).
% 0.19/0.45 cnf(i_0_45, plain, (relation_empty_yielding(esk7_0))).
% 0.19/0.45 cnf(i_0_18, plain, (element(esk1_1(X1),X1))).
% 0.19/0.45 cnf(i_0_4, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.19/0.45 cnf(i_0_43, plain, (~empty(esk5_0))).
% 0.19/0.45 cnf(i_0_44, plain, (~empty(esk6_0))).
% 0.19/0.45 cnf(i_0_28, plain, (~empty(singleton(X1)))).
% 0.19/0.45 cnf(i_0_29, plain, (~empty(unordered_pair(X1,X2)))).
% 0.19/0.45 cnf(i_0_52, negated_conjecture, (apply(esk10_0,apply(esk9_0,esk8_0))!=apply(relation_composition(esk9_0,esk10_0),esk8_0))).
% 0.19/0.45 cnf(i_0_60, plain, (~empty(X1)|~in(X2,X1))).
% 0.19/0.45 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 0.19/0.45 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.19/0.45 cnf(i_0_59, plain, (X1=empty_set|~empty(X1))).
% 0.19/0.45 cnf(i_0_33, plain, (relation(relation_dom(X1))|~empty(X1))).
% 0.19/0.45 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.19/0.45 cnf(i_0_32, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))).
% 0.19/0.45 cnf(i_0_47, plain, (element(X1,X2)|~in(X1,X2))).
% 0.19/0.45 cnf(i_0_34, plain, (empty(relation_dom(X1))|~empty(X1))).
% 0.19/0.45 cnf(i_0_16, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~relation(X1))).
% 0.19/0.45 cnf(i_0_19, plain, (relation(relation_composition(X1,X2))|~relation(X1)|~empty(X2))).
% 0.19/0.45 cnf(i_0_35, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~empty(X1))).
% 0.19/0.45 cnf(i_0_61, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.19/0.45 cnf(i_0_58, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.19/0.45 cnf(i_0_20, plain, (empty(relation_composition(X1,X2))|~relation(X1)|~empty(X2))).
% 0.19/0.45 cnf(i_0_36, plain, (empty(relation_composition(X1,X2))|~relation(X2)|~empty(X1))).
% 0.19/0.45 cnf(i_0_24, plain, (function(relation_composition(X1,X2))|~relation(X2)|~relation(X1)|~function(X2)|~function(X1))).
% 0.19/0.45 cnf(i_0_50, plain, (in(X1,relation_dom(X2))|~relation(X3)|~relation(X2)|~function(X3)|~function(X2)|~in(X1,relation_dom(relation_composition(X2,X3))))).
% 0.19/0.45 cnf(i_0_6, plain, (apply(X1,X2)=empty_set|in(X2,relation_dom(X1))|~relation(X1)|~function(X1))).
% 0.19/0.45 cnf(i_0_49, plain, (in(apply(X1,X2),relation_dom(X3))|~relation(X3)|~relation(X1)|~function(X3)|~function(X1)|~in(X2,relation_dom(relation_composition(X1,X3))))).
% 0.19/0.45 cnf(i_0_7, plain, (X1=apply(X2,X3)|~relation(X2)|~function(X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2)|~in(X3,relation_dom(X2)))).
% 0.19/0.45 cnf(i_0_51, plain, (apply(X1,apply(X2,X3))=apply(relation_composition(X2,X1),X3)|~relation(X2)|~relation(X1)|~function(X2)|~function(X1)|~in(X3,relation_dom(relation_composition(X2,X1))))).
% 0.19/0.45 cnf(i_0_48, plain, (in(X1,relation_dom(relation_composition(X2,X3)))|~relation(X3)|~relation(X2)|~function(X3)|~function(X2)|~in(apply(X2,X1),relation_dom(X3))|~in(X1,relation_dom(X2)))).
% 0.19/0.45 cnf(i_0_8, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,apply(X2,X1))),X2)|~relation(X2)|~function(X2)|~in(X1,relation_dom(X2)))).
% 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.45 # Begin printing tableau
% 0.19/0.45 # Found 6 steps
% 0.19/0.45 cnf(i_0_53, negated_conjecture, (in(esk8_0,relation_dom(esk9_0))), inference(start_rule)).
% 0.19/0.45 cnf(i_0_66, plain, (in(esk8_0,relation_dom(esk9_0))), inference(extension_rule, [i_0_8])).
% 0.19/0.45 cnf(i_0_234, plain, (~relation(esk9_0)), inference(closure_rule, [i_0_57])).
% 0.19/0.45 cnf(i_0_235, plain, (~function(esk9_0)), inference(closure_rule, [i_0_56])).
% 0.19/0.45 cnf(i_0_233, plain, (in(unordered_pair(singleton(esk8_0),unordered_pair(esk8_0,apply(esk9_0,esk8_0))),esk9_0)), inference(extension_rule, [i_0_60])).
% 0.19/0.45 cnf(i_0_237, plain, (~empty(esk9_0)), inference(etableau_closure_rule, [i_0_237, ...])).
% 0.19/0.45 # End printing tableau
% 0.19/0.45 # SZS output end
% 0.19/0.45 # Branches closed with saturation will be marked with an "s"
% 0.19/0.45 # Child (14430) has found a proof.
% 0.19/0.45
% 0.19/0.45 # Proof search is over...
% 0.19/0.45 # Freeing feature tree
%------------------------------------------------------------------------------