TSTP Solution File: SEU253+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU253+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 : n024.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:25:14 EDT 2022
% Result : Theorem 4.50s 0.94s
% Output : CNFRefutation 4.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU253+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 20 00:02:47 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 50 Number of unprocessed: 50
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 50 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 3 conjectures.
% 0.13/0.38 # There are 3 start rule candidates:
% 0.13/0.38 # Found 23 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 3 start rule tableaux created.
% 0.13/0.38 # 27 extension rule candidate clauses
% 0.13/0.38 # 23 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 3
% 0.13/0.38 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 21 tableaux to operate on
% 0.20/0.40 # Creating equality axioms
% 0.20/0.40 # Ran out of tableaux, making start rules for all clauses
% 4.50/0.94 # There were 5 total branch saturation attempts.
% 4.50/0.94 # There were 0 of these attempts blocked.
% 4.50/0.94 # There were 0 deferred branch saturation attempts.
% 4.50/0.94 # There were 0 free duplicated saturations.
% 4.50/0.94 # There were 5 total successful branch saturations.
% 4.50/0.94 # There were 0 successful branch saturations in interreduction.
% 4.50/0.94 # There were 0 successful branch saturations on the branch.
% 4.50/0.94 # There were 5 successful branch saturations after the branch.
% 4.50/0.94 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.50/0.94 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.50/0.94 # Begin clausification derivation
% 4.50/0.94
% 4.50/0.94 # End clausification derivation
% 4.50/0.94 # Begin listing active clauses obtained from FOF to CNF conversion
% 4.50/0.94 cnf(i_0_59, negated_conjecture, (relation(esk10_0))).
% 4.50/0.94 cnf(i_0_58, negated_conjecture, (connected(esk10_0))).
% 4.50/0.94 cnf(i_0_38, plain, (relation(esk4_0))).
% 4.50/0.94 cnf(i_0_42, plain, (relation(esk6_0))).
% 4.50/0.94 cnf(i_0_25, plain, (empty(empty_set))).
% 4.50/0.94 cnf(i_0_46, plain, (relation(esk8_0))).
% 4.50/0.94 cnf(i_0_39, plain, (empty(esk5_0))).
% 4.50/0.94 cnf(i_0_41, plain, (empty(esk6_0))).
% 4.50/0.94 cnf(i_0_37, plain, (function(esk4_0))).
% 4.50/0.94 cnf(i_0_40, plain, (function(esk6_0))).
% 4.50/0.94 cnf(i_0_45, plain, (function(esk8_0))).
% 4.50/0.94 cnf(i_0_44, plain, (one_to_one(esk8_0))).
% 4.50/0.94 cnf(i_0_60, plain, (set_intersection2(X1,empty_set)=empty_set)).
% 4.50/0.94 cnf(i_0_55, plain, (set_union2(X1,empty_set)=X1)).
% 4.50/0.94 cnf(i_0_29, plain, (set_union2(X1,X1)=X1)).
% 4.50/0.94 cnf(i_0_30, plain, (set_intersection2(X1,X1)=X1)).
% 4.50/0.94 cnf(i_0_24, plain, (element(esk1_1(X1),X1))).
% 4.50/0.94 cnf(i_0_6, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 4.50/0.94 cnf(i_0_7, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 4.50/0.94 cnf(i_0_8, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 4.50/0.94 cnf(i_0_57, negated_conjecture, (~connected(relation_restriction(esk10_0,esk9_0)))).
% 4.50/0.94 cnf(i_0_43, plain, (~empty(esk7_0))).
% 4.50/0.94 cnf(i_0_26, plain, (~empty(unordered_pair(singleton(X1),unordered_pair(X1,X2))))).
% 4.50/0.94 cnf(i_0_63, plain, (~empty(X1)|~in(X2,X1))).
% 4.50/0.94 cnf(i_0_62, plain, (X1=empty_set|~empty(X1))).
% 4.50/0.94 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 4.50/0.94 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 4.50/0.94 cnf(i_0_56, plain, (element(X1,X2)|~in(X1,X2))).
% 4.50/0.94 cnf(i_0_28, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 4.50/0.94 cnf(i_0_27, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 4.50/0.94 cnf(i_0_17, plain, (relation(relation_restriction(X1,X2))|~relation(X1))).
% 4.50/0.94 cnf(i_0_33, plain, (connected(X1)|esk3_1(X1)!=esk2_1(X1)|~relation(X1))).
% 4.50/0.94 cnf(i_0_64, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 4.50/0.94 cnf(i_0_3, plain, (one_to_one(X1)|~relation(X1)|~empty(X1))).
% 4.50/0.94 cnf(i_0_52, plain, (in(X1,X2)|~relation(X2)|~in(X1,relation_restriction(X2,X3)))).
% 4.50/0.94 cnf(i_0_61, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 4.50/0.94 cnf(i_0_53, plain, (in(X1,X2)|~relation(X3)|~in(X1,relation_field(relation_restriction(X3,X2))))).
% 4.50/0.94 cnf(i_0_10, plain, (set_union2(relation_dom(X1),relation_rng(X1))=relation_field(X1)|~relation(X1))).
% 4.50/0.94 cnf(i_0_35, plain, (connected(X1)|in(esk2_1(X1),relation_field(X1))|~relation(X1))).
% 4.50/0.94 cnf(i_0_54, plain, (in(X1,relation_field(X2))|~relation(X2)|~in(X1,relation_field(relation_restriction(X2,X3))))).
% 4.50/0.94 cnf(i_0_48, plain, (in(X1,X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)))).
% 4.50/0.94 cnf(i_0_49, plain, (in(X1,X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4)))).
% 4.50/0.94 cnf(i_0_34, plain, (connected(X1)|in(esk3_1(X1),relation_field(X1))|~relation(X1))).
% 4.50/0.94 cnf(i_0_11, plain, (set_intersection2(X1,cartesian_product2(X2,X2))=relation_restriction(X1,X2)|~relation(X1))).
% 4.50/0.94 cnf(i_0_51, plain, (in(X1,cartesian_product2(X2,X2))|~relation(X3)|~in(X1,relation_restriction(X3,X2)))).
% 4.50/0.94 cnf(i_0_32, plain, (connected(X1)|~relation(X1)|~in(unordered_pair(singleton(esk2_1(X1)),unordered_pair(esk2_1(X1),esk3_1(X1))),X1))).
% 4.50/0.94 cnf(i_0_31, plain, (connected(X1)|~relation(X1)|~in(unordered_pair(singleton(esk3_1(X1)),unordered_pair(esk2_1(X1),esk3_1(X1))),X1))).
% 4.50/0.94 cnf(i_0_50, plain, (in(X1,relation_restriction(X2,X3))|~relation(X2)|~in(X1,cartesian_product2(X3,X3))|~in(X1,X2))).
% 4.50/0.94 cnf(i_0_47, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 4.50/0.94 cnf(i_0_36, plain, (X1=X2|in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X3)|in(unordered_pair(singleton(X2),unordered_pair(X2,X1)),X3)|~connected(X3)|~relation(X3)|~in(X2,relation_field(X3))|~in(X1,relation_field(X3)))).
% 4.50/0.94 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 4.50/0.94 # Begin printing tableau
% 4.50/0.94 # Found 10 steps
% 4.50/0.94 cnf(i_0_59, negated_conjecture, (relation(esk10_0)), inference(start_rule)).
% 4.50/0.94 cnf(i_0_67, plain, (relation(esk10_0)), inference(extension_rule, [i_0_36])).
% 4.50/0.94 cnf(i_0_286, plain, (~connected(esk10_0)), inference(closure_rule, [i_0_58])).
% 4.50/0.94 cnf(i_0_283, plain, (esk3_1(relation_restriction(esk10_0,esk9_0))=esk2_1(relation_restriction(esk10_0,esk9_0))), inference(extension_rule, [i_0_33])).
% 4.50/0.94 cnf(i_0_306, plain, (connected(relation_restriction(esk10_0,esk9_0))), inference(closure_rule, [i_0_57])).
% 4.50/0.94 cnf(i_0_284, plain, (in(unordered_pair(singleton(esk3_1(relation_restriction(esk10_0,esk9_0))),unordered_pair(esk3_1(relation_restriction(esk10_0,esk9_0)),esk2_1(relation_restriction(esk10_0,esk9_0)))),esk10_0)), inference(etableau_closure_rule, [i_0_284, ...])).
% 4.50/0.94 cnf(i_0_285, plain, (in(unordered_pair(singleton(esk2_1(relation_restriction(esk10_0,esk9_0))),unordered_pair(esk2_1(relation_restriction(esk10_0,esk9_0)),esk3_1(relation_restriction(esk10_0,esk9_0)))),esk10_0)), inference(etableau_closure_rule, [i_0_285, ...])).
% 4.50/0.94 cnf(i_0_288, plain, (~in(esk2_1(relation_restriction(esk10_0,esk9_0)),relation_field(esk10_0))), inference(etableau_closure_rule, [i_0_288, ...])).
% 4.50/0.94 cnf(i_0_289, plain, (~in(esk3_1(relation_restriction(esk10_0,esk9_0)),relation_field(esk10_0))), inference(etableau_closure_rule, [i_0_289, ...])).
% 4.50/0.94 cnf(i_0_308, plain, (~relation(relation_restriction(esk10_0,esk9_0))), inference(etableau_closure_rule, [i_0_308, ...])).
% 4.50/0.94 # End printing tableau
% 4.50/0.94 # SZS output end
% 4.50/0.94 # Branches closed with saturation will be marked with an "s"
% 4.50/0.94 # Child (22803) has found a proof.
% 4.50/0.94
% 4.50/0.94 # Proof search is over...
% 4.50/0.94 # Freeing feature tree
%------------------------------------------------------------------------------