TSTP Solution File: SEU149+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU149+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 : n016.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:12 EDT 2022
% Result : Theorem 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU149+3 : TPTP v8.1.0. Released v3.2.0.
% 0.10/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 : n016.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 : Mon Jun 20 07:26:55 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_S4d
% 0.14/0.37 # and selection function SelectCQIPrecWNTNp.
% 0.14/0.37 #
% 0.14/0.37 # Presaturation interreduction done
% 0.14/0.37 # Number of axioms: 16 Number of unprocessed: 16
% 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 # 16 beginning clauses after preprocessing and clausification
% 0.14/0.37 # Creating start rules for all 2 conjectures.
% 0.14/0.37 # There are 2 start rule candidates:
% 0.14/0.37 # Found 8 unit axioms.
% 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.37 # 2 start rule tableaux created.
% 0.14/0.37 # 8 extension rule candidate clauses
% 0.14/0.37 # 8 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 2
% 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 24 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.37 # We now have 24 tableaux to operate on
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 1 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 1 successful branch saturations after the branch.
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 1 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 1 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_16, negated_conjecture, (singleton(esk5_0)=unordered_pair(esk6_0,esk7_0))).
% 0.14/0.38 cnf(i_0_13, plain, (empty(esk3_0))).
% 0.14/0.38 cnf(i_0_5, plain, (in(X1,singleton(X1)))).
% 0.14/0.38 cnf(i_0_10, plain, (in(X1,unordered_pair(X2,X1)))).
% 0.14/0.38 cnf(i_0_11, plain, (in(X1,unordered_pair(X1,X2)))).
% 0.14/0.38 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.14/0.38 cnf(i_0_15, negated_conjecture, (esk6_0!=esk5_0)).
% 0.14/0.38 cnf(i_0_14, plain, (~empty(esk4_0))).
% 0.14/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.14/0.38 cnf(i_0_6, plain, (X1=X2|~in(X1,singleton(X2)))).
% 0.14/0.38 cnf(i_0_4, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))).
% 0.14/0.38 cnf(i_0_12, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))).
% 0.14/0.38 cnf(i_0_3, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))).
% 0.14/0.38 cnf(i_0_8, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X3|~in(esk2_3(X2,X3,X1),X1))).
% 0.14/0.38 cnf(i_0_9, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X2|~in(esk2_3(X2,X3,X1),X1))).
% 0.14/0.38 cnf(i_0_7, plain, (esk2_3(X1,X2,X3)=X1|esk2_3(X1,X2,X3)=X2|X3=unordered_pair(X1,X2)|in(esk2_3(X1,X2,X3),X3))).
% 0.14/0.38 cnf(i_0_142, plain, (X30=X30)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 9 steps
% 0.14/0.38 cnf(i_0_16, negated_conjecture, (singleton(esk5_0)=unordered_pair(esk6_0,esk7_0)), inference(start_rule)).
% 0.14/0.38 cnf(i_0_150, plain, (singleton(esk5_0)=unordered_pair(esk6_0,esk7_0)), inference(extension_rule, [i_0_146])).
% 0.14/0.38 cnf(i_0_213, plain, (singleton(esk5_0)!=unordered_pair(esk6_0,esk7_0)), inference(closure_rule, [i_0_16])).
% 0.14/0.38 cnf(i_0_212, plain, (in(unordered_pair(esk6_0,esk7_0),unordered_pair(esk6_0,esk7_0))), inference(extension_rule, [i_0_1])).
% 0.14/0.38 cnf(i_0_225, plain, (~in(unordered_pair(esk6_0,esk7_0),unordered_pair(esk6_0,esk7_0))), inference(closure_rule, [i_0_212])).
% 0.14/0.38 cnf(i_0_215, plain, (~in(singleton(esk5_0),singleton(esk5_0))), inference(extension_rule, [i_0_146])).
% 0.14/0.38 cnf(i_0_255, plain, (unordered_pair(esk6_0,esk7_0)!=singleton(esk5_0)), inference(closure_rule, [i_0_16])).
% 0.14/0.38 cnf(i_0_256, plain, (unordered_pair(esk6_0,esk7_0)!=singleton(esk5_0)), inference(closure_rule, [i_0_16])).
% 0.14/0.38 cnf(i_0_257, plain, (~in(unordered_pair(esk6_0,esk7_0),unordered_pair(esk6_0,esk7_0))), inference(etableau_closure_rule, [i_0_257, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_16, negated_conjecture, (singleton(esk5_0)=unordered_pair(esk6_0,esk7_0))).
% 0.14/0.38 cnf(i_0_13, plain, (empty(esk3_0))).
% 0.14/0.38 cnf(i_0_5, plain, (in(X1,singleton(X1)))).
% 0.14/0.38 cnf(i_0_10, plain, (in(X1,unordered_pair(X2,X1)))).
% 0.14/0.38 cnf(i_0_11, plain, (in(X1,unordered_pair(X1,X2)))).
% 0.14/0.38 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.14/0.38 cnf(i_0_15, negated_conjecture, (esk6_0!=esk5_0)).
% 0.14/0.38 cnf(i_0_14, plain, (~empty(esk4_0))).
% 0.14/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.14/0.38 cnf(i_0_6, plain, (X1=X2|~in(X1,singleton(X2)))).
% 0.14/0.38 cnf(i_0_4, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))).
% 0.14/0.38 cnf(i_0_12, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))).
% 0.14/0.38 cnf(i_0_3, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))).
% 0.14/0.38 cnf(i_0_8, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X3|~in(esk2_3(X2,X3,X1),X1))).
% 0.14/0.38 cnf(i_0_9, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X2|~in(esk2_3(X2,X3,X1),X1))).
% 0.14/0.38 cnf(i_0_7, plain, (esk2_3(X1,X2,X3)=X1|esk2_3(X1,X2,X3)=X2|X3=unordered_pair(X1,X2)|in(esk2_3(X1,X2,X3),X3))).
% 0.14/0.38 cnf(i_0_142, plain, (X30=X30)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 9 steps
% 0.14/0.38 cnf(i_0_16, negated_conjecture, (singleton(esk5_0)=unordered_pair(esk6_0,esk7_0)), inference(start_rule)).
% 0.14/0.38 cnf(i_0_150, plain, (singleton(esk5_0)=unordered_pair(esk6_0,esk7_0)), inference(extension_rule, [i_0_146])).
% 0.14/0.38 cnf(i_0_214, plain, (singleton(esk5_0)!=unordered_pair(esk6_0,esk7_0)), inference(closure_rule, [i_0_16])).
% 0.14/0.38 cnf(i_0_212, plain, (in(unordered_pair(esk6_0,esk7_0),unordered_pair(esk6_0,esk7_0))), inference(extension_rule, [i_0_1])).
% 0.14/0.38 cnf(i_0_225, plain, (~in(unordered_pair(esk6_0,esk7_0),unordered_pair(esk6_0,esk7_0))), inference(closure_rule, [i_0_212])).
% 0.14/0.38 cnf(i_0_215, plain, (~in(singleton(esk5_0),singleton(esk5_0))), inference(extension_rule, [i_0_146])).
% 0.14/0.38 cnf(i_0_255, plain, (unordered_pair(esk6_0,esk7_0)!=singleton(esk5_0)), inference(closure_rule, [i_0_16])).
% 0.14/0.38 cnf(i_0_256, plain, (unordered_pair(esk6_0,esk7_0)!=singleton(esk5_0)), inference(closure_rule, [i_0_16])).
% 0.14/0.38 cnf(i_0_257, plain, (~in(unordered_pair(esk6_0,esk7_0),unordered_pair(esk6_0,esk7_0))), inference(etableau_closure_rule, [i_0_257, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # Child (19134) has found a proof.
% 0.14/0.38
% 0.14/0.38 # Proof search is over...
% 0.14/0.38 # Freeing feature tree
%------------------------------------------------------------------------------