TSTP Solution File: SEU160+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU160+3 : 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 : n026.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:19 EDT 2022
% Result : Theorem 0.14s 0.37s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU160+3 : TPTP v8.1.0. Released v3.2.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 : n026.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 08:05:25 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.37 #
% 0.14/0.37 # Presaturation interreduction done
% 0.14/0.37 # Number of axioms: 10 Number of unprocessed: 9
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.14/0.37 # The folding up rule is enabled...
% 0.14/0.37 # Local unification is enabled...
% 0.14/0.37 # Any saturation attempts will use folding labels...
% 0.14/0.37 # 9 beginning clauses after preprocessing and clausification
% 0.14/0.37 # Creating start rules for all 3 conjectures.
% 0.14/0.37 # There are 3 start rule candidates:
% 0.14/0.37 # Found 5 unit axioms.
% 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.37 # 3 start rule tableaux created.
% 0.14/0.37 # 4 extension rule candidate clauses
% 0.14/0.37 # 5 unit axiom clauses
% 0.14/0.37
% 0.14/0.37 # Requested 8, 32 cores available to the main process.
% 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.14/0.37 # Creating equality axioms
% 0.14/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.37 # We now have 10 tableaux to operate on
% 0.14/0.37 # There were 3 total branch saturation attempts.
% 0.14/0.37 # There were 0 of these attempts blocked.
% 0.14/0.37 # There were 0 deferred branch saturation attempts.
% 0.14/0.37 # There were 0 free duplicated saturations.
% 0.14/0.37 # There were 3 total successful branch saturations.
% 0.14/0.37 # There were 1 successful branch saturations in interreduction.
% 0.14/0.37 # There were 0 successful branch saturations on the branch.
% 0.14/0.37 # There were 2 successful branch saturations after the branch.
% 0.14/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 # Begin clausification derivation
% 0.14/0.37
% 0.14/0.37 # End clausification derivation
% 0.14/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.37 cnf(i_0_2, plain, (empty(empty_set))).
% 0.14/0.37 cnf(i_0_3, plain, (empty(esk1_0))).
% 0.14/0.37 cnf(i_0_1, plain, (subset(X1,X1))).
% 0.14/0.37 cnf(i_0_9, plain, (subset(empty_set,singleton(X1)))).
% 0.14/0.37 cnf(i_0_4, plain, (~empty(esk2_0))).
% 0.14/0.37 cnf(i_0_7, negated_conjecture, (esk3_0!=empty_set|~subset(esk3_0,singleton(esk4_0)))).
% 0.14/0.37 cnf(i_0_6, negated_conjecture, (singleton(esk4_0)!=esk3_0|~subset(esk3_0,singleton(esk4_0)))).
% 0.14/0.37 cnf(i_0_5, negated_conjecture, (singleton(esk4_0)=esk3_0|esk3_0=empty_set|subset(esk3_0,singleton(esk4_0)))).
% 0.14/0.37 cnf(i_0_10, plain, (X1=singleton(X2)|X1=empty_set|~subset(X1,singleton(X2)))).
% 0.14/0.37 cnf(i_0_120, plain, (X10=X10)).
% 0.14/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.37 # Begin printing tableau
% 0.14/0.37 # Found 7 steps
% 0.14/0.37 cnf(i_0_1, plain, (subset(singleton(esk4_0),singleton(esk4_0))), inference(start_rule)).
% 0.14/0.37 cnf(i_0_129, plain, (subset(singleton(esk4_0),singleton(esk4_0))), inference(extension_rule, [i_0_10])).
% 0.14/0.37 cnf(i_0_169, plain, (singleton(esk4_0)=singleton(esk4_0)), inference(extension_rule, [i_0_123])).
% 0.14/0.37 cnf(i_0_183, plain, (singleton(esk4_0)=esk3_0), inference(extension_rule, [i_0_6])).
% 0.14/0.37 cnf(i_0_170, plain, (singleton(esk4_0)=empty_set), inference(etableau_closure_rule, [i_0_170, ...])).
% 0.14/0.37 cnf(i_0_185, plain, (singleton(esk4_0)!=esk3_0), inference(etableau_closure_rule, [i_0_185, ...])).
% 0.14/0.37 cnf(i_0_190, plain, (~subset(esk3_0,singleton(esk4_0))), inference(etableau_closure_rule, [i_0_190, ...])).
% 0.14/0.37 # End printing tableau
% 0.14/0.37 # SZS output end
% 0.14/0.37 # Branches closed with saturation will be marked with an "s"
% 0.14/0.37 # There were 3 total branch saturation attempts.
% 0.14/0.37 # There were 0 of these attempts blocked.
% 0.14/0.37 # There were 0 deferred branch saturation attempts.
% 0.14/0.37 # There were 0 free duplicated saturations.
% 0.14/0.37 # There were 3 total successful branch saturations.
% 0.14/0.37 # There were 1 successful branch saturations in interreduction.
% 0.14/0.37 # There were 0 successful branch saturations on the branch.
% 0.14/0.37 # There were 2 successful branch saturations after the branch.
% 0.14/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 # Begin clausification derivation
% 0.14/0.37
% 0.14/0.37 # End clausification derivation
% 0.14/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.37 cnf(i_0_2, plain, (empty(empty_set))).
% 0.14/0.37 cnf(i_0_3, plain, (empty(esk1_0))).
% 0.14/0.37 cnf(i_0_1, plain, (subset(X1,X1))).
% 0.14/0.37 cnf(i_0_9, plain, (subset(empty_set,singleton(X1)))).
% 0.14/0.37 cnf(i_0_4, plain, (~empty(esk2_0))).
% 0.14/0.37 cnf(i_0_7, negated_conjecture, (esk3_0!=empty_set|~subset(esk3_0,singleton(esk4_0)))).
% 0.14/0.37 cnf(i_0_6, negated_conjecture, (singleton(esk4_0)!=esk3_0|~subset(esk3_0,singleton(esk4_0)))).
% 0.14/0.37 cnf(i_0_5, negated_conjecture, (singleton(esk4_0)=esk3_0|esk3_0=empty_set|subset(esk3_0,singleton(esk4_0)))).
% 0.14/0.37 cnf(i_0_10, plain, (X1=singleton(X2)|X1=empty_set|~subset(X1,singleton(X2)))).
% 0.14/0.37 cnf(i_0_120, plain, (X10=X10)).
% 0.14/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.37 # Begin printing tableau
% 0.14/0.37 # Found 8 steps
% 0.14/0.37 cnf(i_0_2, plain, (empty(empty_set)), inference(start_rule)).
% 0.14/0.37 cnf(i_0_127, plain, (empty(empty_set)), inference(extension_rule, [i_0_125])).
% 0.14/0.37 cnf(i_0_164, plain, (empty(esk2_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.37 cnf(i_0_165, plain, (empty_set!=esk2_0), inference(extension_rule, [i_0_123])).
% 0.14/0.37 cnf(i_0_273, plain, (empty_set!=esk3_0), inference(extension_rule, [i_0_5])).
% 0.14/0.37 cnf(i_0_274, plain, (esk2_0!=esk3_0), inference(etableau_closure_rule, [i_0_274, ...])).
% 0.14/0.37 cnf(i_0_275, plain, (singleton(esk4_0)=esk3_0), inference(etableau_closure_rule, [i_0_275, ...])).
% 0.14/0.37 cnf(i_0_277, plain, (subset(esk3_0,singleton(esk4_0))), inference(etableau_closure_rule, [i_0_277, ...])).
% 0.14/0.37 # End printing tableau
% 0.14/0.37 # SZS output end
% 0.14/0.37 # Branches closed with saturation will be marked with an "s"
% 0.14/0.37 # There were 4 total branch saturation attempts.
% 0.14/0.37 # There were 0 of these attempts blocked.
% 0.14/0.37 # There were 0 deferred branch saturation attempts.
% 0.14/0.37 # There were 0 free duplicated saturations.
% 0.14/0.37 # There were 4 total successful branch saturations.
% 0.14/0.37 # There were 3 successful branch saturations in interreduction.
% 0.14/0.37 # There were 0 successful branch saturations on the branch.
% 0.14/0.37 # There were 1 successful branch saturations after the branch.
% 0.14/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 # Begin clausification derivation
% 0.14/0.37
% 0.14/0.37 # End clausification derivation
% 0.14/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.37 cnf(i_0_2, plain, (empty(empty_set))).
% 0.14/0.37 cnf(i_0_3, plain, (empty(esk1_0))).
% 0.14/0.37 cnf(i_0_1, plain, (subset(X1,X1))).
% 0.14/0.37 cnf(i_0_9, plain, (subset(empty_set,singleton(X1)))).
% 0.14/0.37 cnf(i_0_4, plain, (~empty(esk2_0))).
% 0.14/0.37 cnf(i_0_7, negated_conjecture, (esk3_0!=empty_set|~subset(esk3_0,singleton(esk4_0)))).
% 0.14/0.37 cnf(i_0_6, negated_conjecture, (singleton(esk4_0)!=esk3_0|~subset(esk3_0,singleton(esk4_0)))).
% 0.14/0.37 cnf(i_0_5, negated_conjecture, (singleton(esk4_0)=esk3_0|esk3_0=empty_set|subset(esk3_0,singleton(esk4_0)))).
% 0.14/0.37 cnf(i_0_10, plain, (X1=singleton(X2)|X1=empty_set|~subset(X1,singleton(X2)))).
% 0.14/0.37 cnf(i_0_120, plain, (X10=X10)).
% 0.14/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.37 # Begin printing tableau
% 0.14/0.37 # Found 8 steps
% 0.14/0.37 cnf(i_0_7, negated_conjecture, (esk3_0!=empty_set|~subset(esk3_0,singleton(esk4_0))), inference(start_rule)).
% 0.14/0.37 cnf(i_0_132, plain, (esk3_0!=empty_set), inference(extension_rule, [i_0_10])).
% 0.14/0.37 cnf(i_0_169, plain, (singleton(esk4_0)=esk3_0), inference(extension_rule, [i_0_123])).
% 0.14/0.37 cnf(i_0_133, plain, (~subset(esk3_0,singleton(esk4_0))), inference(etableau_closure_rule, [i_0_133, ...])).
% 0.14/0.37 cnf(i_0_183, plain, (singleton(esk4_0)=esk3_0), inference(extension_rule, [i_0_6])).
% 0.14/0.37 cnf(i_0_171, plain, (~subset(esk3_0,singleton(esk4_0))), inference(etableau_closure_rule, [i_0_171, ...])).
% 0.14/0.37 cnf(i_0_185, plain, ($false), inference(etableau_closure_rule, [i_0_185, ...])).
% 0.14/0.37 cnf(i_0_192, plain, (~subset(esk3_0,singleton(esk4_0))), inference(etableau_closure_rule, [i_0_192, ...])).
% 0.14/0.37 # End printing tableau
% 0.14/0.37 # SZS output end
% 0.14/0.37 # Branches closed with saturation will be marked with an "s"
% 0.14/0.37 # Child (28203) has found a proof.
% 0.14/0.37
% 0.14/0.37 # There were 3 total branch saturation attempts.
% 0.14/0.37 # There were 0 of these attempts blocked.
% 0.14/0.37 # There were 0 deferred branch saturation attempts.
% 0.14/0.37 # There were 0 free duplicated saturations.
% 0.14/0.37 # There were 3 total successful branch saturations.
% 0.14/0.37 # There were 1 successful branch saturations in interreduction.
% 0.14/0.37 # There were 0 successful branch saturations on the branch.
% 0.14/0.37 # There were 2 successful branch saturations after the branch.
% 0.14/0.37 # Proof search is over...
% 0.14/0.37 # Freeing feature tree
%------------------------------------------------------------------------------