TSTP Solution File: SEU266+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU266+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 : n029.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:21 EDT 2022
% Result : Theorem 1.35s 0.53s
% Output : CNFRefutation 1.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU266+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/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 : n029.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 : Mon Jun 20 03:51:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.12/0.36 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Number of axioms: 37 Number of unprocessed: 37
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 37 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 4 conjectures.
% 0.12/0.36 # There are 4 start rule candidates:
% 0.12/0.36 # Found 10 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 4 start rule tableaux created.
% 0.12/0.36 # 27 extension rule candidate clauses
% 0.12/0.36 # 10 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 4
% 0.12/0.36 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 11 tableaux to operate on
% 1.35/0.53 # There were 1 total branch saturation attempts.
% 1.35/0.53 # There were 0 of these attempts blocked.
% 1.35/0.53 # There were 0 deferred branch saturation attempts.
% 1.35/0.53 # There were 0 free duplicated saturations.
% 1.35/0.53 # There were 1 total successful branch saturations.
% 1.35/0.53 # There were 0 successful branch saturations in interreduction.
% 1.35/0.53 # There were 0 successful branch saturations on the branch.
% 1.35/0.53 # There were 1 successful branch saturations after the branch.
% 1.35/0.53 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.35/0.53 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.35/0.53 # Begin clausification derivation
% 1.35/0.53
% 1.35/0.53 # End clausification derivation
% 1.35/0.53 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.35/0.53 cnf(i_0_24, plain, (empty(empty_set))).
% 1.35/0.53 cnf(i_0_26, plain, (empty(esk7_0))).
% 1.35/0.53 cnf(i_0_27, plain, (~empty(esk8_0))).
% 1.35/0.53 cnf(i_0_46, plain, (X1=empty_set|~empty(X1))).
% 1.35/0.53 cnf(i_0_31, plain, (subset(X1,X1))).
% 1.35/0.53 cnf(i_0_48, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 1.35/0.53 cnf(i_0_22, plain, (element(esk5_1(X1),X1))).
% 1.35/0.53 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 1.35/0.53 cnf(i_0_47, plain, (~empty(X2)|~in(X1,X2))).
% 1.35/0.53 cnf(i_0_32, plain, (element(X1,X2)|~in(X1,X2))).
% 1.35/0.53 cnf(i_0_39, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 1.35/0.53 cnf(i_0_42, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 1.35/0.53 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 1.35/0.53 cnf(i_0_43, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 1.35/0.53 cnf(i_0_38, negated_conjecture, (relation_of2_as_subset(esk11_0,esk9_0,esk10_0))).
% 1.35/0.53 cnf(i_0_45, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 1.35/0.53 cnf(i_0_44, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 1.35/0.53 cnf(i_0_21, plain, (relation_of2(esk4_2(X1,X2),X1,X2))).
% 1.35/0.53 cnf(i_0_23, plain, (relation_of2_as_subset(esk6_2(X1,X2),X1,X2))).
% 1.35/0.53 cnf(i_0_40, plain, (X1=X2|in(esk14_2(X1,X2),X2)|in(esk14_2(X1,X2),X1))).
% 1.35/0.53 cnf(i_0_37, negated_conjecture, (in(esk12_0,esk10_0)|relation_rng_as_subset(esk9_0,esk10_0,esk11_0)!=esk10_0)).
% 1.35/0.53 cnf(i_0_2, plain, (relation(X1)|~element(X1,powerset(cartesian_product2(X2,X3))))).
% 1.35/0.53 cnf(i_0_41, plain, (X1=X2|~in(esk14_2(X1,X2),X2)|~in(esk14_2(X1,X2),X1))).
% 1.35/0.53 cnf(i_0_30, plain, (relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3))).
% 1.35/0.53 cnf(i_0_29, plain, (relation_of2_as_subset(X1,X2,X3)|~relation_of2(X1,X2,X3))).
% 1.35/0.53 cnf(i_0_28, plain, (relation_rng_as_subset(X2,X3,X1)=relation_rng(X1)|~relation_of2(X1,X2,X3))).
% 1.35/0.53 cnf(i_0_25, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 1.35/0.53 cnf(i_0_20, plain, (element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3))).
% 1.35/0.53 cnf(i_0_33, plain, (in(X1,relation_rng(X2))|~relation(X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2))).
% 1.35/0.53 cnf(i_0_34, plain, (in(X1,relation_dom(X2))|~relation(X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),X2))).
% 1.35/0.53 cnf(i_0_6, plain, (in(X2,X4)|X4!=relation_rng(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 1.35/0.53 cnf(i_0_17, plain, (element(relation_rng_as_subset(X2,X3,X1),powerset(X3))|~relation_of2(X1,X2,X3))).
% 1.35/0.53 cnf(i_0_35, negated_conjecture, (relation_rng_as_subset(esk9_0,esk10_0,esk11_0)=esk10_0|in(unordered_pair(unordered_pair(esk13_1(X1),X1),singleton(esk13_1(X1))),esk11_0)|~in(X1,esk10_0))).
% 1.35/0.53 cnf(i_0_36, negated_conjecture, (relation_rng_as_subset(esk9_0,esk10_0,esk11_0)!=esk10_0|~in(unordered_pair(unordered_pair(X1,esk12_0),singleton(X1)),esk11_0))).
% 1.35/0.53 cnf(i_0_5, plain, (X2=relation_rng(X1)|~relation(X1)|~in(esk2_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(X3,esk2_2(X1,X2)),singleton(X3)),X1))).
% 1.35/0.53 cnf(i_0_4, plain, (X2=relation_rng(X1)|in(esk2_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk2_2(X1,X2)),singleton(esk3_2(X1,X2))),X1)|~relation(X1))).
% 1.35/0.53 cnf(i_0_7, plain, (in(unordered_pair(unordered_pair(esk1_3(X3,X2,X1),X1),singleton(esk1_3(X3,X2,X1))),X3)|X2!=relation_rng(X3)|~relation(X3)|~in(X1,X2))).
% 1.35/0.53 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.35/0.53 # Begin printing tableau
% 1.35/0.53 # Found 4 steps
% 1.35/0.53 cnf(i_0_38, negated_conjecture, (relation_of2_as_subset(esk11_0,esk9_0,esk10_0)), inference(start_rule)).
% 1.35/0.53 cnf(i_0_56, plain, (relation_of2_as_subset(esk11_0,esk9_0,esk10_0)), inference(extension_rule, [i_0_30])).
% 1.35/0.53 cnf(i_0_302, plain, (relation_of2(esk11_0,esk9_0,esk10_0)), inference(extension_rule, [i_0_28])).
% 1.35/0.53 cnf(i_0_338, plain, (relation_rng_as_subset(esk9_0,esk10_0,esk11_0)=relation_rng(esk11_0)), inference(etableau_closure_rule, [i_0_338, ...])).
% 1.35/0.53 # End printing tableau
% 1.35/0.53 # SZS output end
% 1.35/0.53 # Branches closed with saturation will be marked with an "s"
% 1.35/0.54 # Child (6954) has found a proof.
% 1.35/0.54
% 1.35/0.54 # Proof search is over...
% 1.35/0.54 # Freeing feature tree
%------------------------------------------------------------------------------