TSTP Solution File: SEU224+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU224+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 : n027.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:57 EDT 2022
% Result : Theorem 0.19s 0.40s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU224+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/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 : n027.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 : Sun Jun 19 08:09:39 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___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.36 #
% 0.12/0.36 # Number of axioms: 59 Number of unprocessed: 59
% 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 # 59 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 5 conjectures.
% 0.12/0.36 # There are 5 start rule candidates:
% 0.12/0.36 # Found 28 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 5 start rule tableaux created.
% 0.12/0.36 # 31 extension rule candidate clauses
% 0.12/0.36 # 28 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 5
% 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.19/0.40 # There were 2 total branch saturation attempts.
% 0.19/0.40 # There were 0 of these attempts blocked.
% 0.19/0.40 # There were 0 deferred branch saturation attempts.
% 0.19/0.40 # There were 0 free duplicated saturations.
% 0.19/0.40 # There were 2 total successful branch saturations.
% 0.19/0.40 # There were 0 successful branch saturations in interreduction.
% 0.19/0.40 # There were 0 successful branch saturations on the branch.
% 0.19/0.40 # There were 2 successful branch saturations after the branch.
% 0.19/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40 # Begin clausification derivation
% 0.19/0.40
% 0.19/0.40 # End clausification derivation
% 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.40 cnf(i_0_23, plain, (empty(empty_set))).
% 0.19/0.40 cnf(i_0_27, plain, (empty(empty_set))).
% 0.19/0.40 cnf(i_0_31, plain, (empty(empty_set))).
% 0.19/0.40 cnf(i_0_44, plain, (empty(esk7_0))).
% 0.19/0.40 cnf(i_0_45, plain, (empty(esk8_0))).
% 0.19/0.40 cnf(i_0_47, plain, (empty(esk9_0))).
% 0.19/0.40 cnf(i_0_39, negated_conjecture, (function(esk5_0))).
% 0.19/0.40 cnf(i_0_41, plain, (function(esk6_0))).
% 0.19/0.40 cnf(i_0_46, plain, (function(esk9_0))).
% 0.19/0.40 cnf(i_0_53, plain, (function(esk12_0))).
% 0.19/0.40 cnf(i_0_22, plain, (relation(empty_set))).
% 0.19/0.40 cnf(i_0_30, plain, (relation(empty_set))).
% 0.19/0.40 cnf(i_0_40, negated_conjecture, (relation(esk5_0))).
% 0.19/0.40 cnf(i_0_42, plain, (relation(esk6_0))).
% 0.19/0.40 cnf(i_0_43, plain, (relation(esk7_0))).
% 0.19/0.40 cnf(i_0_48, plain, (relation(esk9_0))).
% 0.19/0.40 cnf(i_0_49, plain, (relation(esk10_0))).
% 0.19/0.40 cnf(i_0_54, plain, (relation(esk12_0))).
% 0.19/0.40 cnf(i_0_56, plain, (relation(esk13_0))).
% 0.19/0.40 cnf(i_0_52, plain, (one_to_one(esk12_0))).
% 0.19/0.40 cnf(i_0_21, plain, (relation_empty_yielding(empty_set))).
% 0.19/0.40 cnf(i_0_55, plain, (relation_empty_yielding(esk13_0))).
% 0.19/0.40 cnf(i_0_50, plain, (~empty(esk10_0))).
% 0.19/0.40 cnf(i_0_51, plain, (~empty(esk11_0))).
% 0.19/0.40 cnf(i_0_64, plain, (X1=empty_set|~empty(X1))).
% 0.19/0.40 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.19/0.40 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 0.19/0.40 cnf(i_0_58, plain, (set_intersection2(X1,empty_set)=empty_set)).
% 0.19/0.40 cnf(i_0_35, plain, (set_intersection2(X1,X1)=X1)).
% 0.19/0.40 cnf(i_0_66, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.19/0.40 cnf(i_0_34, plain, (empty(relation_dom(X1))|~empty(X1))).
% 0.19/0.40 cnf(i_0_33, plain, (relation(relation_dom(X1))|~empty(X1))).
% 0.19/0.40 cnf(i_0_20, plain, (element(esk2_1(X1),X1))).
% 0.19/0.40 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1)|~function(X1)|~relation(X1))).
% 0.19/0.40 cnf(i_0_7, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.19/0.40 cnf(i_0_32, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))).
% 0.19/0.40 cnf(i_0_65, plain, (~empty(X2)|~in(X1,X2))).
% 0.19/0.40 cnf(i_0_57, plain, (element(X1,X2)|~in(X1,X2))).
% 0.19/0.40 cnf(i_0_18, plain, (relation(relation_dom_restriction(X1,X2))|~relation(X1))).
% 0.19/0.40 cnf(i_0_59, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.19/0.40 cnf(i_0_28, plain, (function(relation_dom_restriction(X1,X2))|~function(X1)|~relation(X1))).
% 0.19/0.40 cnf(i_0_26, plain, (relation(set_intersection2(X1,X2))|~relation(X2)|~relation(X1))).
% 0.19/0.40 cnf(i_0_29, plain, (relation(relation_dom_restriction(X1,X2))|~function(X1)|~relation(X1))).
% 0.19/0.40 cnf(i_0_25, plain, (relation(relation_dom_restriction(X1,X2))|~relation(X1)|~relation_empty_yielding(X1))).
% 0.19/0.40 cnf(i_0_24, plain, (relation_empty_yielding(relation_dom_restriction(X1,X2))|~relation(X1)|~relation_empty_yielding(X1))).
% 0.19/0.40 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.19/0.40 cnf(i_0_12, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))).
% 0.19/0.40 cnf(i_0_13, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))).
% 0.19/0.40 cnf(i_0_36, negated_conjecture, (in(esk4_0,esk3_0)|in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0))))).
% 0.19/0.40 cnf(i_0_37, negated_conjecture, (in(esk4_0,relation_dom(esk5_0))|in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0))))).
% 0.19/0.40 cnf(i_0_63, plain, (relation_dom(X1)=set_intersection2(relation_dom(X2),X3)|X1!=relation_dom_restriction(X2,X3)|~function(X2)|~function(X1)|~relation(X2)|~relation(X1))).
% 0.19/0.40 cnf(i_0_11, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))).
% 0.19/0.40 cnf(i_0_62, plain, (apply(X2,X1)=apply(X3,X1)|X2!=relation_dom_restriction(X3,X4)|~function(X3)|~function(X2)|~relation(X3)|~relation(X2)|~in(X1,relation_dom(X2)))).
% 0.19/0.40 cnf(i_0_38, negated_conjecture, (~in(esk4_0,esk3_0)|~in(esk4_0,relation_dom(esk5_0))|~in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0))))).
% 0.19/0.40 cnf(i_0_61, plain, (X2=relation_dom_restriction(X3,X1)|in(esk14_3(X1,X2,X3),relation_dom(X2))|relation_dom(X2)!=set_intersection2(relation_dom(X3),X1)|~function(X3)|~function(X2)|~relation(X3)|~relation(X2))).
% 0.19/0.40 cnf(i_0_8, plain, (X3=set_intersection2(X1,X2)|in(esk1_3(X1,X2,X3),X3)|in(esk1_3(X1,X2,X3),X2))).
% 0.19/0.40 cnf(i_0_9, plain, (X3=set_intersection2(X1,X2)|in(esk1_3(X1,X2,X3),X3)|in(esk1_3(X1,X2,X3),X1))).
% 0.19/0.40 cnf(i_0_60, plain, (X1=relation_dom_restriction(X3,X2)|relation_dom(X1)!=set_intersection2(relation_dom(X3),X2)|apply(X1,esk14_3(X2,X1,X3))!=apply(X3,esk14_3(X2,X1,X3))|~function(X3)|~function(X1)|~relation(X3)|~relation(X1))).
% 0.19/0.40 cnf(i_0_10, plain, (X3=set_intersection2(X1,X2)|~in(esk1_3(X1,X2,X3),X3)|~in(esk1_3(X1,X2,X3),X2)|~in(esk1_3(X1,X2,X3),X1))).
% 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.40 # Begin printing tableau
% 0.19/0.40 # Found 5 steps
% 0.19/0.40 cnf(i_0_37, negated_conjecture, (in(esk4_0,relation_dom(esk5_0))|in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0)))), inference(start_rule)).
% 0.19/0.40 cnf(i_0_70, plain, (in(esk4_0,relation_dom(esk5_0))), inference(extension_rule, [i_0_65])).
% 0.19/0.40 cnf(i_0_296, plain, (~empty(relation_dom(esk5_0))), inference(extension_rule, [i_0_34])).
% 0.19/0.40 cnf(i_0_71, plain, (in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0)))), inference(etableau_closure_rule, [i_0_71, ...])).
% 0.19/0.40 cnf(i_0_308, plain, (~empty(esk5_0)), inference(etableau_closure_rule, [i_0_308, ...])).
% 0.19/0.40 # End printing tableau
% 0.19/0.40 # SZS output end
% 0.19/0.40 # Branches closed with saturation will be marked with an "s"
% 0.19/0.40 # Child (20621) has found a proof.
% 0.19/0.40
% 0.19/0.40 # Proof search is over...
% 0.19/0.40 # Freeing feature tree
%------------------------------------------------------------------------------