TSTP Solution File: SEU230+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU230+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 : n023.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:01 EDT 2022
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU230+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/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 : n023.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 : Sat Jun 18 20:23:04 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.13/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.36 #
% 0.13/0.36 # Number of axioms: 53 Number of unprocessed: 53
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # 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 # 53 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 1 conjectures.
% 0.13/0.37 # There are 1 start rule candidates:
% 0.13/0.37 # Found 31 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 22 extension rule candidate clauses
% 0.13/0.37 # 31 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 1
% 0.13/0.37 # There were 1 total branch saturation attempts.
% 0.13/0.37 # There were 0 of these attempts blocked.
% 0.13/0.37 # There were 0 deferred branch saturation attempts.
% 0.13/0.37 # There were 0 free duplicated saturations.
% 0.13/0.37 # There were 1 total successful branch saturations.
% 0.13/0.37 # There were 0 successful branch saturations in interreduction.
% 0.13/0.37 # There were 0 successful branch saturations on the branch.
% 0.13/0.37 # There were 1 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37 # Begin clausification derivation
% 0.13/0.37
% 0.13/0.37 # End clausification derivation
% 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37 cnf(i_0_27, plain, (empty(empty_set))).
% 0.13/0.37 cnf(i_0_29, plain, (empty(empty_set))).
% 0.13/0.37 cnf(i_0_34, plain, (empty(empty_set))).
% 0.13/0.37 cnf(i_0_39, plain, (empty(esk5_0))).
% 0.13/0.37 cnf(i_0_40, plain, (empty(esk6_0))).
% 0.13/0.37 cnf(i_0_42, plain, (empty(esk7_0))).
% 0.13/0.37 cnf(i_0_36, plain, (function(esk4_0))).
% 0.13/0.37 cnf(i_0_41, plain, (function(esk7_0))).
% 0.13/0.37 cnf(i_0_48, plain, (function(esk10_0))).
% 0.13/0.37 cnf(i_0_52, plain, (function(esk12_0))).
% 0.13/0.37 cnf(i_0_26, plain, (relation(empty_set))).
% 0.13/0.37 cnf(i_0_33, plain, (relation(empty_set))).
% 0.13/0.37 cnf(i_0_37, plain, (relation(esk4_0))).
% 0.13/0.37 cnf(i_0_38, plain, (relation(esk5_0))).
% 0.13/0.37 cnf(i_0_43, plain, (relation(esk7_0))).
% 0.13/0.37 cnf(i_0_44, plain, (relation(esk8_0))).
% 0.13/0.37 cnf(i_0_49, plain, (relation(esk10_0))).
% 0.13/0.37 cnf(i_0_51, plain, (relation(esk11_0))).
% 0.13/0.37 cnf(i_0_54, plain, (relation(esk12_0))).
% 0.13/0.37 cnf(i_0_47, plain, (one_to_one(esk10_0))).
% 0.13/0.37 cnf(i_0_25, plain, (relation_empty_yielding(empty_set))).
% 0.13/0.37 cnf(i_0_50, plain, (relation_empty_yielding(esk11_0))).
% 0.13/0.37 cnf(i_0_53, plain, (relation_empty_yielding(esk12_0))).
% 0.13/0.37 cnf(i_0_45, plain, (~empty(esk8_0))).
% 0.13/0.37 cnf(i_0_46, plain, (~empty(esk9_0))).
% 0.13/0.37 cnf(i_0_59, plain, (X1=empty_set|~empty(X1))).
% 0.13/0.37 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.13/0.37 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 0.13/0.37 cnf(i_0_56, plain, (set_union2(X1,empty_set)=X1)).
% 0.13/0.37 cnf(i_0_35, plain, (set_union2(X1,X1)=X1)).
% 0.13/0.37 cnf(i_0_61, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.13/0.37 cnf(i_0_24, plain, (element(esk3_1(X1),X1))).
% 0.13/0.37 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1)|~function(X1)|~relation(X1))).
% 0.13/0.37 cnf(i_0_11, plain, (in(X1,X3)|X1!=X2|X3!=singleton(X2))).
% 0.13/0.37 cnf(i_0_7, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.13/0.37 cnf(i_0_60, plain, (~empty(X2)|~in(X1,X2))).
% 0.13/0.37 cnf(i_0_12, plain, (X1=X3|X2!=singleton(X3)|~in(X1,X2))).
% 0.13/0.37 cnf(i_0_57, plain, (element(X1,X2)|~in(X1,X2))).
% 0.13/0.37 cnf(i_0_58, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.13/0.37 cnf(i_0_30, plain, (relation(set_union2(X1,X2))|~relation(X2)|~relation(X1))).
% 0.13/0.37 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.13/0.37 cnf(i_0_32, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.13/0.37 cnf(i_0_31, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.13/0.37 cnf(i_0_9, plain, (X2=singleton(X1)|esk1_2(X1,X2)=X1|in(esk1_2(X1,X2),X2))).
% 0.13/0.37 cnf(i_0_16, plain, (in(X1,X3)|X3!=set_union2(X4,X2)|~in(X1,X2))).
% 0.13/0.37 cnf(i_0_17, plain, (in(X1,X3)|X3!=set_union2(X2,X4)|~in(X1,X2))).
% 0.13/0.37 cnf(i_0_55, negated_conjecture, (~in(esk13_0,set_union2(esk13_0,singleton(esk13_0))))).
% 0.13/0.37 cnf(i_0_28, plain, (~empty(set_union2(X1,singleton(X1))))).
% 0.13/0.37 cnf(i_0_18, plain, (in(X1,X4)|in(X1,X3)|X2!=set_union2(X3,X4)|~in(X1,X2))).
% 0.13/0.37 cnf(i_0_10, plain, (X2=singleton(X1)|esk1_2(X1,X2)!=X1|~in(esk1_2(X1,X2),X2))).
% 0.13/0.37 cnf(i_0_13, plain, (X3=set_union2(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk2_3(X1,X2,X3),X2)|in(esk2_3(X1,X2,X3),X1))).
% 0.13/0.37 cnf(i_0_14, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X2))).
% 0.13/0.37 cnf(i_0_15, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X1))).
% 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.37 # Begin printing tableau
% 0.13/0.37 # Found 7 steps
% 0.13/0.37 cnf(i_0_55, negated_conjecture, (~in(esk13_0,set_union2(esk13_0,singleton(esk13_0)))), inference(start_rule)).
% 0.13/0.37 cnf(i_0_62, plain, (~in(esk13_0,set_union2(esk13_0,singleton(esk13_0)))), inference(extension_rule, [i_0_18])).
% 0.13/0.37 cnf(i_0_107, plain, (in(esk13_0,set_union2(esk13_0,singleton(esk13_0)))), inference(closure_rule, [i_0_55])).
% 0.13/0.37 cnf(i_0_109, plain, (set_union2(set_union2(set_union2(esk13_0,singleton(esk13_0)),set_union2(esk13_0,singleton(esk13_0))),empty_set)!=set_union2(set_union2(esk13_0,singleton(esk13_0)),set_union2(esk13_0,singleton(esk13_0)))), inference(closure_rule, [i_0_56])).
% 0.13/0.37 cnf(i_0_110, plain, (~in(esk13_0,set_union2(set_union2(set_union2(esk13_0,singleton(esk13_0)),set_union2(esk13_0,singleton(esk13_0))),empty_set))), inference(extension_rule, [i_0_11])).
% 0.13/0.37 cnf(i_0_138, plain, (esk13_0!=set_union2(esk13_0,empty_set)), inference(closure_rule, [i_0_56])).
% 0.13/0.37 cnf(i_0_139, plain, (set_union2(set_union2(set_union2(esk13_0,singleton(esk13_0)),set_union2(esk13_0,singleton(esk13_0))),empty_set)!=singleton(set_union2(esk13_0,empty_set))), inference(etableau_closure_rule, [i_0_139, ...])).
% 0.13/0.37 # End printing tableau
% 0.13/0.37 # SZS output end
% 0.13/0.37 # Branches closed with saturation will be marked with an "s"
% 0.13/0.37 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 6 tableaux to operate on
% 0.13/0.37 # Found closed tableau during pool population.
% 0.13/0.37 # Proof search is over...
% 0.13/0.37 # Freeing feature tree
%------------------------------------------------------------------------------