TSTP Solution File: SEU181+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU181+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:24:33 EDT 2022
% Result : Theorem 28.99s 4.02s
% Output : CNFRefutation 28.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU181+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/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 : Sat Jun 18 19:32:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.19/0.37 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Number of axioms: 48 Number of unprocessed: 48
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 48 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 2 conjectures.
% 0.19/0.37 # There are 2 start rule candidates:
% 0.19/0.37 # Found 15 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 2 start rule tableaux created.
% 0.19/0.37 # 33 extension rule candidate clauses
% 0.19/0.37 # 15 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 2
% 0.19/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37 # We now have 13 tableaux to operate on
% 28.99/4.02 # There were 4 total branch saturation attempts.
% 28.99/4.02 # There were 0 of these attempts blocked.
% 28.99/4.02 # There were 0 deferred branch saturation attempts.
% 28.99/4.02 # There were 0 free duplicated saturations.
% 28.99/4.02 # There were 4 total successful branch saturations.
% 28.99/4.02 # There were 0 successful branch saturations in interreduction.
% 28.99/4.02 # There were 0 successful branch saturations on the branch.
% 28.99/4.02 # There were 4 successful branch saturations after the branch.
% 28.99/4.02 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.99/4.02 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.99/4.02 # Begin clausification derivation
% 28.99/4.02
% 28.99/4.02 # End clausification derivation
% 28.99/4.02 # Begin listing active clauses obtained from FOF to CNF conversion
% 28.99/4.02 cnf(i_0_38, plain, (relation(esk11_0))).
% 28.99/4.02 cnf(i_0_50, negated_conjecture, (relation(esk16_0))).
% 28.99/4.02 cnf(i_0_33, plain, (empty(empty_set))).
% 28.99/4.02 cnf(i_0_39, plain, (empty(esk11_0))).
% 28.99/4.02 cnf(i_0_42, plain, (empty(esk13_0))).
% 28.99/4.02 cnf(i_0_45, plain, (~empty(esk15_0))).
% 28.99/4.02 cnf(i_0_55, plain, (X1=empty_set|~empty(X1))).
% 28.99/4.02 cnf(i_0_43, plain, (empty(esk14_1(X1)))).
% 28.99/4.02 cnf(i_0_46, plain, (subset(X1,X1))).
% 28.99/4.02 cnf(i_0_57, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 28.99/4.02 cnf(i_0_35, plain, (~empty(singleton(X1)))).
% 28.99/4.02 cnf(i_0_32, plain, (~empty(powerset(X1)))).
% 28.99/4.02 cnf(i_0_28, plain, (relation(relation_inverse(X1))|~relation(X1))).
% 28.99/4.02 cnf(i_0_4, plain, (subset(X1,X2)|X1!=X2)).
% 28.99/4.02 cnf(i_0_5, plain, (subset(X1,X2)|X1!=X2)).
% 28.99/4.02 cnf(i_0_37, plain, (relation_inverse(relation_inverse(X1))=X1|~relation(X1))).
% 28.99/4.02 cnf(i_0_31, plain, (element(esk10_1(X1),X1))).
% 28.99/4.02 cnf(i_0_40, plain, (empty(X1)|~empty(esk12_1(X1)))).
% 28.99/4.02 cnf(i_0_44, plain, (element(esk14_1(X1),powerset(X1)))).
% 28.99/4.02 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 28.99/4.02 cnf(i_0_56, plain, (~empty(X2)|~in(X1,X2))).
% 28.99/4.02 cnf(i_0_49, negated_conjecture, (relation_rng(relation_inverse(esk16_0))!=relation_dom(esk16_0)|relation_dom(relation_inverse(esk16_0))!=relation_rng(esk16_0))).
% 28.99/4.02 cnf(i_0_41, plain, (empty(X1)|element(esk12_1(X1),powerset(X1)))).
% 28.99/4.02 cnf(i_0_47, plain, (element(X1,X2)|~in(X1,X2))).
% 28.99/4.02 cnf(i_0_48, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 28.99/4.02 cnf(i_0_51, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 28.99/4.02 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 28.99/4.02 cnf(i_0_52, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 28.99/4.02 cnf(i_0_3, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 28.99/4.02 cnf(i_0_36, plain, (~empty(unordered_pair(X1,X2)))).
% 28.99/4.02 cnf(i_0_7, plain, (subset(X1,X2)|in(esk1_2(X1,X2),X1))).
% 28.99/4.02 cnf(i_0_8, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))).
% 28.99/4.02 cnf(i_0_54, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 28.99/4.02 cnf(i_0_53, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 28.99/4.02 cnf(i_0_6, plain, (subset(X1,X2)|~in(esk1_2(X1,X2),X2))).
% 28.99/4.02 cnf(i_0_34, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 28.99/4.02 cnf(i_0_15, plain, (in(X2,X4)|X4!=relation_rng(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 28.99/4.02 cnf(i_0_11, plain, (in(X1,X4)|X4!=relation_dom(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 28.99/4.02 cnf(i_0_20, plain, (in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),X4)|X4!=relation_inverse(X3)|~relation(X4)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 28.99/4.02 cnf(i_0_21, plain, (in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),X4)|X3!=relation_inverse(X4)|~relation(X4)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 28.99/4.02 cnf(i_0_14, plain, (X2=relation_rng(X1)|~relation(X1)|~in(esk6_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(X3,esk6_2(X1,X2)),singleton(X3)),X1))).
% 28.99/4.02 cnf(i_0_9, plain, (X2=relation_dom(X1)|in(esk3_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X1)|~relation(X1))).
% 28.99/4.02 cnf(i_0_13, plain, (X2=relation_rng(X1)|in(esk6_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk7_2(X1,X2),esk6_2(X1,X2)),singleton(esk7_2(X1,X2))),X1)|~relation(X1))).
% 28.99/4.02 cnf(i_0_10, plain, (X2=relation_dom(X1)|~relation(X1)|~in(esk3_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(esk3_2(X1,X2),X3),singleton(esk3_2(X1,X2))),X1))).
% 28.99/4.02 cnf(i_0_12, plain, (in(unordered_pair(unordered_pair(X1,esk2_3(X3,X2,X1)),singleton(X1)),X3)|X2!=relation_dom(X3)|~relation(X3)|~in(X1,X2))).
% 28.99/4.02 cnf(i_0_18, plain, (X2=relation_inverse(X1)|in(unordered_pair(unordered_pair(esk8_2(X1,X2),esk9_2(X1,X2)),singleton(esk8_2(X1,X2))),X2)|in(unordered_pair(unordered_pair(esk9_2(X1,X2),esk8_2(X1,X2)),singleton(esk9_2(X1,X2))),X1)|~relation(X2)|~relation(X1))).
% 28.99/4.02 cnf(i_0_16, plain, (in(unordered_pair(unordered_pair(esk5_3(X3,X2,X1),X1),singleton(esk5_3(X3,X2,X1))),X3)|X2!=relation_rng(X3)|~relation(X3)|~in(X1,X2))).
% 28.99/4.02 cnf(i_0_19, plain, (X2=relation_inverse(X1)|~relation(X2)|~relation(X1)|~in(unordered_pair(unordered_pair(esk8_2(X1,X2),esk9_2(X1,X2)),singleton(esk8_2(X1,X2))),X2)|~in(unordered_pair(unordered_pair(esk9_2(X1,X2),esk8_2(X1,X2)),singleton(esk9_2(X1,X2))),X1))).
% 28.99/4.02 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 28.99/4.02 # Begin printing tableau
% 28.99/4.02 # Found 7 steps
% 28.99/4.02 cnf(i_0_49, negated_conjecture, (relation_rng(relation_inverse(esk16_0))!=relation_dom(esk16_0)|relation_dom(relation_inverse(esk16_0))!=relation_rng(esk16_0)), inference(start_rule)).
% 28.99/4.02 cnf(i_0_59, plain, (relation_dom(relation_inverse(esk16_0))!=relation_rng(esk16_0)), inference(extension_rule, [i_0_9])).
% 28.99/4.02 cnf(i_0_230, plain, (in(esk3_2(relation_inverse(esk16_0),relation_rng(esk16_0)),relation_rng(esk16_0))), inference(extension_rule, [i_0_56])).
% 28.99/4.02 cnf(i_0_58, plain, (relation_rng(relation_inverse(esk16_0))!=relation_dom(esk16_0)), inference(etableau_closure_rule, [i_0_58, ...])).
% 28.99/4.02 cnf(i_0_231, plain, (in(unordered_pair(unordered_pair(esk3_2(relation_inverse(esk16_0),relation_rng(esk16_0)),esk4_2(relation_inverse(esk16_0),relation_rng(esk16_0))),singleton(esk3_2(relation_inverse(esk16_0),relation_rng(esk16_0)))),relation_inverse(esk16_0))), inference(etableau_closure_rule, [i_0_231, ...])).
% 28.99/4.02 cnf(i_0_232, plain, (~relation(relation_inverse(esk16_0))), inference(etableau_closure_rule, [i_0_232, ...])).
% 28.99/4.02 cnf(i_0_276, plain, (~empty(relation_rng(esk16_0))), inference(etableau_closure_rule, [i_0_276, ...])).
% 28.99/4.02 # End printing tableau
% 28.99/4.02 # SZS output end
% 28.99/4.02 # Branches closed with saturation will be marked with an "s"
% 28.99/4.03 # Child (465) has found a proof.
% 28.99/4.03
% 28.99/4.03 # Proof search is over...
% 28.99/4.03 # Freeing feature tree
%------------------------------------------------------------------------------