TSTP Solution File: NUM380+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM380+1 : TPTP v8.1.0. Released v3.2.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 : n024.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 : Mon Jul 18 09:40:36 EDT 2022
% Result : Theorem 10.95s 1.73s
% Output : CNFRefutation 10.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM380+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/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 : n024.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 : Thu Jul 7 21:16:29 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___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N
% 0.13/0.36 # and selection function SelectUnlessUniqMax.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 54 Number of unprocessed: 51
% 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 # 51 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 4 conjectures.
% 0.13/0.37 # There are 4 start rule candidates:
% 0.13/0.37 # Found 34 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 4 start rule tableaux created.
% 0.13/0.37 # 17 extension rule candidate clauses
% 0.13/0.37 # 34 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 4
% 0.13/0.37 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 16 tableaux to operate on
% 10.95/1.73 # There were 2 total branch saturation attempts.
% 10.95/1.73 # There were 0 of these attempts blocked.
% 10.95/1.73 # There were 0 deferred branch saturation attempts.
% 10.95/1.73 # There were 0 free duplicated saturations.
% 10.95/1.73 # There were 2 total successful branch saturations.
% 10.95/1.73 # There were 0 successful branch saturations in interreduction.
% 10.95/1.73 # There were 0 successful branch saturations on the branch.
% 10.95/1.73 # There were 2 successful branch saturations after the branch.
% 10.95/1.73 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.95/1.73 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.95/1.73 # Begin clausification derivation
% 10.95/1.73
% 10.95/1.73 # End clausification derivation
% 10.95/1.73 # Begin listing active clauses obtained from FOF to CNF conversion
% 10.95/1.73 cnf(i_0_51, negated_conjecture, (in(esk13_0,esk14_0))).
% 10.95/1.73 cnf(i_0_50, negated_conjecture, (in(esk14_0,esk15_0))).
% 10.95/1.73 cnf(i_0_49, negated_conjecture, (in(esk15_0,esk16_0))).
% 10.95/1.73 cnf(i_0_48, negated_conjecture, (in(esk16_0,esk13_0))).
% 10.95/1.73 cnf(i_0_20, plain, (empty(empty_set))).
% 10.95/1.73 cnf(i_0_27, plain, (empty(esk4_0))).
% 10.95/1.73 cnf(i_0_28, plain, (empty(esk5_0))).
% 10.95/1.73 cnf(i_0_30, plain, (empty(esk6_0))).
% 10.95/1.73 cnf(i_0_24, plain, (function(esk3_0))).
% 10.95/1.73 cnf(i_0_29, plain, (function(esk6_0))).
% 10.95/1.73 cnf(i_0_36, plain, (function(esk9_0))).
% 10.95/1.73 cnf(i_0_40, plain, (function(esk11_0))).
% 10.95/1.73 cnf(i_0_43, plain, (function(esk12_0))).
% 10.95/1.73 cnf(i_0_19, plain, (relation(empty_set))).
% 10.95/1.73 cnf(i_0_25, plain, (relation(esk3_0))).
% 10.95/1.73 cnf(i_0_26, plain, (relation(esk4_0))).
% 10.95/1.73 cnf(i_0_31, plain, (relation(esk6_0))).
% 10.95/1.73 cnf(i_0_32, plain, (relation(esk7_0))).
% 10.95/1.73 cnf(i_0_37, plain, (relation(esk9_0))).
% 10.95/1.73 cnf(i_0_39, plain, (relation(esk10_0))).
% 10.95/1.73 cnf(i_0_42, plain, (relation(esk11_0))).
% 10.95/1.73 cnf(i_0_45, plain, (relation(esk12_0))).
% 10.95/1.73 cnf(i_0_35, plain, (one_to_one(esk9_0))).
% 10.95/1.73 cnf(i_0_18, plain, (relation_empty_yielding(empty_set))).
% 10.95/1.73 cnf(i_0_38, plain, (relation_empty_yielding(esk10_0))).
% 10.95/1.73 cnf(i_0_41, plain, (relation_empty_yielding(esk11_0))).
% 10.95/1.73 cnf(i_0_44, plain, (relation_non_empty(esk12_0))).
% 10.95/1.73 cnf(i_0_17, plain, (element(esk2_1(X1),X1))).
% 10.95/1.73 cnf(i_0_12, plain, (in(X1,unordered_quadruple(X2,X3,X4,X1)))).
% 10.95/1.73 cnf(i_0_13, plain, (in(X1,unordered_quadruple(X2,X3,X1,X4)))).
% 10.95/1.73 cnf(i_0_14, plain, (in(X1,unordered_quadruple(X2,X1,X3,X4)))).
% 10.95/1.73 cnf(i_0_15, plain, (in(X1,unordered_quadruple(X1,X2,X3,X4)))).
% 10.95/1.73 cnf(i_0_33, plain, (~empty(esk7_0))).
% 10.95/1.73 cnf(i_0_34, plain, (~empty(esk8_0))).
% 10.95/1.73 cnf(i_0_53, plain, (~empty(X1)|~in(X2,X1))).
% 10.95/1.73 cnf(i_0_52, plain, (X1=empty_set|~empty(X1))).
% 10.95/1.73 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 10.95/1.73 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 10.95/1.73 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 10.95/1.73 cnf(i_0_46, plain, (element(X1,X2)|~in(X1,X2))).
% 10.95/1.73 cnf(i_0_56, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 10.95/1.73 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1))).
% 10.95/1.73 cnf(i_0_54, plain, (~in(X1,esk17_2(X2,X3))|~in(X2,X3)|~in(X1,X3))).
% 10.95/1.73 cnf(i_0_47, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 10.95/1.73 cnf(i_0_55, plain, (in(esk17_2(X1,X2),X2)|~in(X1,X2))).
% 10.95/1.73 cnf(i_0_8, plain, (X1=unordered_quadruple(X2,X3,X4,X5)|esk1_5(X2,X3,X4,X5,X1)!=X5|~in(esk1_5(X2,X3,X4,X5,X1),X1))).
% 10.95/1.73 cnf(i_0_9, plain, (X1=unordered_quadruple(X2,X3,X4,X5)|esk1_5(X2,X3,X4,X5,X1)!=X4|~in(esk1_5(X2,X3,X4,X5,X1),X1))).
% 10.95/1.73 cnf(i_0_10, plain, (X1=unordered_quadruple(X2,X3,X4,X5)|esk1_5(X2,X3,X4,X5,X1)!=X3|~in(esk1_5(X2,X3,X4,X5,X1),X1))).
% 10.95/1.73 cnf(i_0_11, plain, (X1=unordered_quadruple(X2,X3,X4,X5)|esk1_5(X2,X3,X4,X5,X1)!=X2|~in(esk1_5(X2,X3,X4,X5,X1),X1))).
% 10.95/1.73 cnf(i_0_16, plain, (X1=X2|X1=X3|X1=X4|X1=X5|~in(X1,unordered_quadruple(X5,X4,X3,X2)))).
% 10.95/1.73 cnf(i_0_7, plain, (esk1_5(X1,X2,X3,X4,X5)=X1|esk1_5(X1,X2,X3,X4,X5)=X2|esk1_5(X1,X2,X3,X4,X5)=X3|esk1_5(X1,X2,X3,X4,X5)=X4|X5=unordered_quadruple(X1,X2,X3,X4)|in(esk1_5(X1,X2,X3,X4,X5),X5))).
% 10.95/1.73 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 10.95/1.73 # Begin printing tableau
% 10.95/1.73 # Found 5 steps
% 10.95/1.73 cnf(i_0_49, negated_conjecture, (in(esk15_0,esk16_0)), inference(start_rule)).
% 10.95/1.73 cnf(i_0_67, plain, (in(esk15_0,esk16_0)), inference(extension_rule, [i_0_1])).
% 10.95/1.73 cnf(i_0_122, plain, (~in(esk16_0,esk15_0)), inference(extension_rule, [i_0_47])).
% 10.95/1.73 cnf(i_0_186, plain, (empty(esk15_0)), inference(etableau_closure_rule, [i_0_186, ...])).
% 10.95/1.73 cnf(i_0_188, plain, (~element(esk16_0,esk15_0)), inference(etableau_closure_rule, [i_0_188, ...])).
% 10.95/1.73 # End printing tableau
% 10.95/1.73 # SZS output end
% 10.95/1.73 # Branches closed with saturation will be marked with an "s"
% 10.95/1.73 # There were 2 total branch saturation attempts.
% 10.95/1.73 # There were 0 of these attempts blocked.
% 10.95/1.73 # There were 0 deferred branch saturation attempts.
% 10.95/1.73 # There were 0 free duplicated saturations.
% 10.95/1.73 # There were 2 total successful branch saturations.
% 10.95/1.73 # There were 0 successful branch saturations in interreduction.
% 10.95/1.73 # There were 0 successful branch saturations on the branch.
% 10.95/1.73 # There were 2 successful branch saturations after the branch.
% 10.95/1.73 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.95/1.73 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.95/1.73 # Begin clausification derivation
% 10.95/1.73
% 10.95/1.73 # End clausification derivation
% 10.95/1.73 # Begin listing active clauses obtained from FOF to CNF conversion
% 10.95/1.73 cnf(i_0_51, negated_conjecture, (in(esk13_0,esk14_0))).
% 10.95/1.73 cnf(i_0_50, negated_conjecture, (in(esk14_0,esk15_0))).
% 10.95/1.73 cnf(i_0_49, negated_conjecture, (in(esk15_0,esk16_0))).
% 10.95/1.73 cnf(i_0_48, negated_conjecture, (in(esk16_0,esk13_0))).
% 10.95/1.73 cnf(i_0_20, plain, (empty(empty_set))).
% 10.95/1.73 cnf(i_0_27, plain, (empty(esk4_0))).
% 10.95/1.73 cnf(i_0_28, plain, (empty(esk5_0))).
% 10.95/1.73 cnf(i_0_30, plain, (empty(esk6_0))).
% 10.95/1.73 cnf(i_0_24, plain, (function(esk3_0))).
% 10.95/1.73 cnf(i_0_29, plain, (function(esk6_0))).
% 10.95/1.73 cnf(i_0_36, plain, (function(esk9_0))).
% 10.95/1.73 cnf(i_0_40, plain, (function(esk11_0))).
% 10.95/1.73 cnf(i_0_43, plain, (function(esk12_0))).
% 10.95/1.73 cnf(i_0_19, plain, (relation(empty_set))).
% 10.95/1.73 cnf(i_0_25, plain, (relation(esk3_0))).
% 10.95/1.73 cnf(i_0_26, plain, (relation(esk4_0))).
% 10.95/1.73 cnf(i_0_31, plain, (relation(esk6_0))).
% 10.95/1.73 cnf(i_0_32, plain, (relation(esk7_0))).
% 10.95/1.73 cnf(i_0_37, plain, (relation(esk9_0))).
% 10.95/1.73 cnf(i_0_39, plain, (relation(esk10_0))).
% 10.95/1.73 cnf(i_0_42, plain, (relation(esk11_0))).
% 10.95/1.73 cnf(i_0_45, plain, (relation(esk12_0))).
% 10.95/1.73 cnf(i_0_35, plain, (one_to_one(esk9_0))).
% 10.95/1.73 cnf(i_0_18, plain, (relation_empty_yielding(empty_set))).
% 10.95/1.73 cnf(i_0_38, plain, (relation_empty_yielding(esk10_0))).
% 10.95/1.73 cnf(i_0_41, plain, (relation_empty_yielding(esk11_0))).
% 10.95/1.73 cnf(i_0_44, plain, (relation_non_empty(esk12_0))).
% 10.95/1.73 cnf(i_0_17, plain, (element(esk2_1(X1),X1))).
% 10.95/1.73 cnf(i_0_12, plain, (in(X1,unordered_quadruple(X2,X3,X4,X1)))).
% 10.95/1.73 cnf(i_0_13, plain, (in(X1,unordered_quadruple(X2,X3,X1,X4)))).
% 10.95/1.73 cnf(i_0_14, plain, (in(X1,unordered_quadruple(X2,X1,X3,X4)))).
% 10.95/1.73 cnf(i_0_15, plain, (in(X1,unordered_quadruple(X1,X2,X3,X4)))).
% 10.95/1.73 cnf(i_0_33, plain, (~empty(esk7_0))).
% 10.95/1.73 cnf(i_0_34, plain, (~empty(esk8_0))).
% 10.95/1.73 cnf(i_0_53, plain, (~empty(X1)|~in(X2,X1))).
% 10.95/1.73 cnf(i_0_52, plain, (X1=empty_set|~empty(X1))).
% 10.95/1.73 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 10.95/1.73 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 10.95/1.73 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 10.95/1.73 cnf(i_0_46, plain, (element(X1,X2)|~in(X1,X2))).
% 10.95/1.73 cnf(i_0_56, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 10.95/1.73 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1))).
% 10.95/1.73 cnf(i_0_54, plain, (~in(X1,esk17_2(X2,X3))|~in(X2,X3)|~in(X1,X3))).
% 10.95/1.73 cnf(i_0_47, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 10.95/1.73 cnf(i_0_55, plain, (in(esk17_2(X1,X2),X2)|~in(X1,X2))).
% 10.95/1.73 cnf(i_0_8, plain, (X1=unordered_quadruple(X2,X3,X4,X5)|esk1_5(X2,X3,X4,X5,X1)!=X5|~in(esk1_5(X2,X3,X4,X5,X1),X1))).
% 10.95/1.73 cnf(i_0_9, plain, (X1=unordered_quadruple(X2,X3,X4,X5)|esk1_5(X2,X3,X4,X5,X1)!=X4|~in(esk1_5(X2,X3,X4,X5,X1),X1))).
% 10.95/1.73 cnf(i_0_10, plain, (X1=unordered_quadruple(X2,X3,X4,X5)|esk1_5(X2,X3,X4,X5,X1)!=X3|~in(esk1_5(X2,X3,X4,X5,X1),X1))).
% 10.95/1.73 cnf(i_0_11, plain, (X1=unordered_quadruple(X2,X3,X4,X5)|esk1_5(X2,X3,X4,X5,X1)!=X2|~in(esk1_5(X2,X3,X4,X5,X1),X1))).
% 10.95/1.73 cnf(i_0_16, plain, (X1=X2|X1=X3|X1=X4|X1=X5|~in(X1,unordered_quadruple(X5,X4,X3,X2)))).
% 10.95/1.73 cnf(i_0_7, plain, (esk1_5(X1,X2,X3,X4,X5)=X1|esk1_5(X1,X2,X3,X4,X5)=X2|esk1_5(X1,X2,X3,X4,X5)=X3|esk1_5(X1,X2,X3,X4,X5)=X4|X5=unordered_quadruple(X1,X2,X3,X4)|in(esk1_5(X1,X2,X3,X4,X5),X5))).
% 10.95/1.73 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 10.95/1.73 # Begin printing tableau
% 10.95/1.73 # Found 5 steps
% 10.95/1.73 cnf(i_0_49, negated_conjecture, (in(esk15_0,esk16_0)), inference(start_rule)).
% 10.95/1.73 cnf(i_0_67, plain, (in(esk15_0,esk16_0)), inference(extension_rule, [i_0_1])).
% 10.95/1.73 cnf(i_0_123, plain, (~in(esk16_0,esk15_0)), inference(extension_rule, [i_0_47])).
% 10.95/1.73 cnf(i_0_186, plain, (empty(esk15_0)), inference(etableau_closure_rule, [i_0_186, ...])).
% 10.95/1.73 cnf(i_0_188, plain, (~element(esk16_0,esk15_0)), inference(etableau_closure_rule, [i_0_188, ...])).
% 10.95/1.73 # End printing tableau
% 10.95/1.73 # SZS output end
% 10.95/1.73 # Branches closed with saturation will be marked with an "s"
% 10.95/1.74 # Child (13161) has found a proof.
% 10.95/1.74
% 10.95/1.74 # Proof search is over...
% 10.95/1.74 # Freeing feature tree
%------------------------------------------------------------------------------