TSTP Solution File: SEU188+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU188+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 : n028.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:36 EDT 2022
% Result : Theorem 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU188+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.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 19 02:22:59 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S0S
% 0.14/0.38 # and selection function SelectComplexG.
% 0.14/0.38 #
% 0.14/0.38 # Presaturation interreduction done
% 0.14/0.38 # Number of axioms: 39 Number of unprocessed: 37
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.14/0.38 # The folding up rule is enabled...
% 0.14/0.38 # Local unification is enabled...
% 0.14/0.38 # Any saturation attempts will use folding labels...
% 0.14/0.38 # 37 beginning clauses after preprocessing and clausification
% 0.14/0.38 # Creating start rules for all 3 conjectures.
% 0.14/0.38 # There are 3 start rule candidates:
% 0.14/0.38 # Found 14 unit axioms.
% 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.38 # 3 start rule tableaux created.
% 0.14/0.38 # 23 extension rule candidate clauses
% 0.14/0.38 # 14 unit axiom clauses
% 0.14/0.38
% 0.14/0.38 # Requested 8, 32 cores available to the main process.
% 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 3
% 0.14/0.38 # Returning from population with 18 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.38 # We now have 18 tableaux to operate on
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 1 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 1 successful branch saturations after the branch.
% 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_25, plain, (relation(empty_set))).
% 0.14/0.39 cnf(i_0_44, negated_conjecture, (relation(esk14_0))).
% 0.14/0.39 cnf(i_0_21, plain, (empty(empty_set))).
% 0.14/0.39 cnf(i_0_33, plain, (relation(esk8_0))).
% 0.14/0.39 cnf(i_0_34, plain, (empty(esk8_0))).
% 0.14/0.39 cnf(i_0_36, plain, (relation(esk10_0))).
% 0.14/0.39 cnf(i_0_35, plain, (empty(esk9_0))).
% 0.14/0.39 cnf(i_0_20, plain, (element(esk7_1(X1),X1))).
% 0.14/0.39 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.14/0.39 cnf(i_0_42, negated_conjecture, (esk14_0!=empty_set)).
% 0.14/0.39 cnf(i_0_37, plain, (~empty(esk10_0))).
% 0.14/0.39 cnf(i_0_38, plain, (~empty(esk11_0))).
% 0.14/0.39 cnf(i_0_23, plain, (~empty(singleton(X1)))).
% 0.14/0.39 cnf(i_0_24, plain, (~empty(unordered_pair(X1,X2)))).
% 0.14/0.39 cnf(i_0_43, negated_conjecture, (relation_rng(esk14_0)=empty_set|relation_dom(esk14_0)=empty_set)).
% 0.14/0.39 cnf(i_0_2, plain, (relation(X1)|~empty(X1))).
% 0.14/0.39 cnf(i_0_45, plain, (X1=empty_set|~empty(X1))).
% 0.14/0.39 cnf(i_0_29, plain, (relation(relation_dom(X1))|~empty(X1))).
% 0.14/0.39 cnf(i_0_47, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.14/0.39 cnf(i_0_31, plain, (relation(relation_rng(X1))|~empty(X1))).
% 0.14/0.39 cnf(i_0_46, plain, (~empty(X1)|~in(X2,X1))).
% 0.14/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.14/0.39 cnf(i_0_27, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))).
% 0.14/0.39 cnf(i_0_30, plain, (empty(relation_dom(X1))|~empty(X1))).
% 0.14/0.39 cnf(i_0_32, plain, (empty(relation_rng(X1))|~empty(X1))).
% 0.14/0.39 cnf(i_0_28, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))).
% 0.14/0.39 cnf(i_0_39, plain, (element(X1,X2)|~in(X1,X2))).
% 0.14/0.39 cnf(i_0_40, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.14/0.39 cnf(i_0_10, plain, (in(X1,X2)|X2!=relation_rng(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X3))).
% 0.14/0.39 cnf(i_0_6, plain, (in(X1,X2)|X2!=relation_dom(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X3))).
% 0.14/0.39 cnf(i_0_9, plain, (X1=relation_rng(X2)|~relation(X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,esk5_2(X2,X1))),X2)|~in(esk5_2(X2,X1),X1))).
% 0.14/0.39 cnf(i_0_41, plain, (X1=empty_set|in(unordered_pair(singleton(esk12_1(X1)),unordered_pair(esk12_1(X1),esk13_1(X1))),X1)|~relation(X1))).
% 0.14/0.39 cnf(i_0_5, plain, (X1=relation_dom(X2)|~relation(X2)|~in(unordered_pair(unordered_pair(esk2_2(X2,X1),X3),singleton(esk2_2(X2,X1))),X2)|~in(esk2_2(X2,X1),X1))).
% 0.14/0.39 cnf(i_0_7, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,esk1_3(X2,X3,X1))),X2)|X3!=relation_dom(X2)|~relation(X2)|~in(X1,X3))).
% 0.14/0.39 cnf(i_0_11, plain, (in(unordered_pair(unordered_pair(X1,esk4_3(X2,X3,X1)),singleton(esk4_3(X2,X3,X1))),X2)|X3!=relation_rng(X2)|~relation(X2)|~in(X1,X3))).
% 0.14/0.39 cnf(i_0_4, plain, (X1=relation_dom(X2)|in(unordered_pair(singleton(esk2_2(X2,X1)),unordered_pair(esk2_2(X2,X1),esk3_2(X2,X1))),X2)|in(esk2_2(X2,X1),X1)|~relation(X2))).
% 0.14/0.39 cnf(i_0_8, plain, (X1=relation_rng(X2)|in(unordered_pair(singleton(esk6_2(X2,X1)),unordered_pair(esk5_2(X2,X1),esk6_2(X2,X1))),X2)|in(esk5_2(X2,X1),X1)|~relation(X2))).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 5 steps
% 0.14/0.39 cnf(i_0_44, negated_conjecture, (relation(esk14_0)), inference(start_rule)).
% 0.14/0.39 cnf(i_0_51, plain, (relation(esk14_0)), inference(extension_rule, [i_0_41])).
% 0.14/0.39 cnf(i_0_295, plain, (esk14_0=empty_set), inference(closure_rule, [i_0_42])).
% 0.14/0.39 cnf(i_0_296, plain, (in(unordered_pair(singleton(esk12_1(esk14_0)),unordered_pair(esk12_1(esk14_0),esk13_1(esk14_0))),esk14_0)), inference(extension_rule, [i_0_46])).
% 0.14/0.39 cnf(i_0_331, plain, (~empty(esk14_0)), inference(etableau_closure_rule, [i_0_331, ...])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # Child (1290) has found a proof.
% 0.14/0.39
% 0.14/0.39 # Proof search is over...
% 0.14/0.39 # Freeing feature tree
%------------------------------------------------------------------------------