TSTP Solution File: SEU258+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU258+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 : n020.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:17 EDT 2022
% Result : Theorem 55.86s 7.37s
% Output : CNFRefutation 55.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SEU258+1 : TPTP v8.1.0. Released v3.3.0.
% 0.02/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 : n020.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 11:35:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 67 Number of unprocessed: 65
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.36 # The folding up rule is enabled...
% 0.18/0.36 # Local unification is enabled...
% 0.18/0.36 # Any saturation attempts will use folding labels...
% 0.18/0.36 # 65 beginning clauses after preprocessing and clausification
% 0.18/0.36 # Creating start rules for all 4 conjectures.
% 0.18/0.36 # There are 4 start rule candidates:
% 0.18/0.36 # Found 25 unit axioms.
% 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.36 # 4 start rule tableaux created.
% 0.18/0.36 # 40 extension rule candidate clauses
% 0.18/0.36 # 25 unit axiom clauses
% 0.18/0.36
% 0.18/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 4
% 0.18/0.36 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.36 # We now have 12 tableaux to operate on
% 0.18/0.38 # Creating equality axioms
% 0.18/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.38 # Creating equality axioms
% 0.18/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.38 # Creating equality axioms
% 0.18/0.38 # Ran out of tableaux, making start rules for all clauses
% 55.86/7.37 # There were 9 total branch saturation attempts.
% 55.86/7.37 # There were 0 of these attempts blocked.
% 55.86/7.37 # There were 0 deferred branch saturation attempts.
% 55.86/7.37 # There were 0 free duplicated saturations.
% 55.86/7.37 # There were 3 total successful branch saturations.
% 55.86/7.37 # There were 0 successful branch saturations in interreduction.
% 55.86/7.37 # There were 0 successful branch saturations on the branch.
% 55.86/7.37 # There were 3 successful branch saturations after the branch.
% 55.86/7.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 55.86/7.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 55.86/7.37 # Begin clausification derivation
% 55.86/7.37
% 55.86/7.37 # End clausification derivation
% 55.86/7.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 55.86/7.37 cnf(i_0_75, negated_conjecture, (relation(esk10_0))).
% 55.86/7.37 cnf(i_0_74, negated_conjecture, (well_ordering(esk10_0))).
% 55.86/7.37 cnf(i_0_73, negated_conjecture, (subset(esk9_0,relation_field(esk10_0)))).
% 55.86/7.37 cnf(i_0_48, plain, (relation(esk4_0))).
% 55.86/7.37 cnf(i_0_38, plain, (empty(empty_set))).
% 55.86/7.37 cnf(i_0_52, plain, (relation(esk6_0))).
% 55.86/7.37 cnf(i_0_49, plain, (empty(esk5_0))).
% 55.86/7.37 cnf(i_0_51, plain, (empty(esk6_0))).
% 55.86/7.37 cnf(i_0_56, plain, (relation(esk8_0))).
% 55.86/7.37 cnf(i_0_47, plain, (function(esk4_0))).
% 55.86/7.37 cnf(i_0_50, plain, (function(esk6_0))).
% 55.86/7.37 cnf(i_0_55, plain, (function(esk8_0))).
% 55.86/7.37 cnf(i_0_54, plain, (one_to_one(esk8_0))).
% 55.86/7.37 cnf(i_0_57, plain, (subset(X1,X1))).
% 55.86/7.37 cnf(i_0_68, plain, (set_intersection2(X1,empty_set)=empty_set)).
% 55.86/7.37 cnf(i_0_64, plain, (set_union2(X1,empty_set)=X1)).
% 55.86/7.37 cnf(i_0_42, plain, (set_union2(X1,X1)=X1)).
% 55.86/7.37 cnf(i_0_43, plain, (set_intersection2(X1,X1)=X1)).
% 55.86/7.37 cnf(i_0_37, plain, (element(esk2_1(X1),X1))).
% 55.86/7.37 cnf(i_0_6, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 55.86/7.37 cnf(i_0_7, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 55.86/7.37 cnf(i_0_8, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 55.86/7.37 cnf(i_0_72, negated_conjecture, (relation_field(relation_restriction(esk10_0,esk9_0))!=esk9_0)).
% 55.86/7.37 cnf(i_0_53, plain, (~empty(esk7_0))).
% 55.86/7.37 cnf(i_0_39, plain, (~empty(unordered_pair(singleton(X1),unordered_pair(X1,X2))))).
% 55.86/7.37 cnf(i_0_81, plain, (~empty(X1)|~in(X2,X1))).
% 55.86/7.37 cnf(i_0_80, plain, (X1=empty_set|~empty(X1))).
% 55.86/7.37 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 55.86/7.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 55.86/7.37 cnf(i_0_20, plain, (reflexive(X1)|~well_ordering(X1)|~relation(X1))).
% 55.86/7.37 cnf(i_0_19, plain, (transitive(X1)|~well_ordering(X1)|~relation(X1))).
% 55.86/7.37 cnf(i_0_18, plain, (antisymmetric(X1)|~well_ordering(X1)|~relation(X1))).
% 55.86/7.37 cnf(i_0_17, plain, (connected(X1)|~well_ordering(X1)|~relation(X1))).
% 55.86/7.37 cnf(i_0_16, plain, (well_founded_relation(X1)|~well_ordering(X1)|~relation(X1))).
% 55.86/7.37 cnf(i_0_30, plain, (relation(relation_restriction(X1,X2))|~relation(X1))).
% 55.86/7.37 cnf(i_0_65, plain, (element(X1,X2)|~in(X1,X2))).
% 55.86/7.37 cnf(i_0_41, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 55.86/7.37 cnf(i_0_40, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 55.86/7.37 cnf(i_0_66, plain, (subset(relation_field(relation_restriction(X1,X2)),X2)|~relation(X1))).
% 55.86/7.37 cnf(i_0_67, plain, (subset(relation_field(relation_restriction(X1,X2)),relation_field(X1))|~relation(X1))).
% 55.86/7.37 cnf(i_0_3, plain, (one_to_one(X1)|~relation(X1)|~empty(X1))).
% 55.86/7.37 cnf(i_0_82, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 55.86/7.37 cnf(i_0_77, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 55.86/7.37 cnf(i_0_79, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))).
% 55.86/7.37 cnf(i_0_9, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 55.86/7.37 cnf(i_0_12, plain, (subset(X1,X2)|~in(esk1_2(X1,X2),X2))).
% 55.86/7.37 cnf(i_0_76, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 55.86/7.37 cnf(i_0_63, plain, (in(X1,X2)|~relation(X2)|~in(X1,relation_restriction(X2,X3)))).
% 55.86/7.37 cnf(i_0_69, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 55.86/7.37 cnf(i_0_14, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))).
% 55.86/7.37 cnf(i_0_15, plain, (well_ordering(X1)|~well_founded_relation(X1)|~connected(X1)|~antisymmetric(X1)|~transitive(X1)|~reflexive(X1)|~relation(X1))).
% 55.86/7.37 cnf(i_0_78, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 55.86/7.37 cnf(i_0_22, plain, (set_union2(relation_dom(X1),relation_rng(X1))=relation_field(X1)|~relation(X1))).
% 55.86/7.37 cnf(i_0_45, plain, (reflexive(X1)|in(esk3_1(X1),relation_field(X1))|~relation(X1))).
% 55.86/7.37 cnf(i_0_13, plain, (subset(X1,X2)|in(esk1_2(X1,X2),X1))).
% 55.86/7.37 cnf(i_0_23, plain, (set_intersection2(X1,cartesian_product2(X2,X2))=relation_restriction(X1,X2)|~relation(X1))).
% 55.86/7.37 cnf(i_0_70, plain, (in(X1,relation_field(X2))|~relation(X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),X2))).
% 55.86/7.37 cnf(i_0_62, plain, (in(X1,cartesian_product2(X2,X2))|~relation(X3)|~in(X1,relation_restriction(X3,X2)))).
% 55.86/7.37 cnf(i_0_71, plain, (in(X1,relation_field(X2))|~relation(X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),X2))).
% 55.86/7.37 cnf(i_0_59, plain, (in(X1,X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)))).
% 55.86/7.37 cnf(i_0_60, plain, (in(X1,X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4)))).
% 55.86/7.37 cnf(i_0_44, plain, (reflexive(X1)|~relation(X1)|~in(unordered_pair(singleton(esk3_1(X1)),unordered_pair(esk3_1(X1),esk3_1(X1))),X1))).
% 55.86/7.37 cnf(i_0_61, plain, (in(X1,relation_restriction(X2,X3))|~relation(X2)|~in(X1,cartesian_product2(X3,X3))|~in(X1,X2))).
% 55.86/7.37 cnf(i_0_46, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X1)),X2)|~reflexive(X2)|~relation(X2)|~in(X1,relation_field(X2)))).
% 55.86/7.37 cnf(i_0_58, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 55.86/7.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 55.86/7.37 # Begin printing tableau
% 55.86/7.37 # Found 8 steps
% 55.86/7.37 cnf(i_0_72, negated_conjecture, (relation_field(relation_restriction(esk10_0,esk9_0))!=esk9_0), inference(start_rule)).
% 55.86/7.37 cnf(i_0_85, plain, (relation_field(relation_restriction(esk10_0,esk9_0))!=esk9_0), inference(extension_rule, [i_0_9])).
% 55.86/7.37 cnf(i_0_137, plain, (~subset(relation_field(relation_restriction(esk10_0,esk9_0)),esk9_0)), inference(extension_rule, [i_0_66])).
% 55.86/7.37 cnf(i_0_189269, plain, (~relation(esk10_0)), inference(closure_rule, [i_0_75])).
% 55.86/7.37 cnf(i_0_136, plain, (~subset(esk9_0,relation_field(relation_restriction(esk10_0,esk9_0)))), inference(extension_rule, [i_0_12])).
% 55.86/7.37 cnf(i_0_189314, plain, (~in(esk1_2(esk9_0,relation_field(relation_restriction(esk10_0,esk9_0))),relation_field(relation_restriction(esk10_0,esk9_0)))), inference(extension_rule, [i_0_70])).
% 55.86/7.37 cnf(i_0_368955, plain, (~relation(relation_restriction(esk10_0,esk9_0))), inference(etableau_closure_rule, [i_0_368955, ...])).
% 55.86/7.37 cnf(i_0_368956, plain, (~in(unordered_pair(singleton(X6),unordered_pair(X6,esk1_2(esk9_0,relation_field(relation_restriction(esk10_0,esk9_0))))),relation_restriction(esk10_0,esk9_0))), inference(etableau_closure_rule, [i_0_368956, ...])).
% 55.86/7.37 # End printing tableau
% 55.86/7.37 # SZS output end
% 55.86/7.37 # Branches closed with saturation will be marked with an "s"
% 55.86/7.38 # Child (25128) has found a proof.
% 55.86/7.38
% 55.86/7.38 # Proof search is over...
% 55.86/7.38 # Freeing feature tree
%------------------------------------------------------------------------------