TSTP Solution File: SWV411+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV411+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 : n007.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 : Wed Jul 20 18:20:54 EDT 2022
% Result : Theorem 0.17s 0.36s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV411+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.32 % Computer : n007.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Wed Jun 15 23:04:56 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.17/0.36 # No SInE strategy applied
% 0.17/0.36 # Auto-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN
% 0.17/0.36 # and selection function PSelectSmallestOrientable.
% 0.17/0.36 #
% 0.17/0.36 # Presaturation interreduction done
% 0.17/0.36 # Number of axioms: 28 Number of unprocessed: 28
% 0.17/0.36 # Tableaux proof search.
% 0.17/0.36 # APR header successfully linked.
% 0.17/0.36 # Hello from C++
% 0.17/0.36 # The folding up rule is enabled...
% 0.17/0.36 # Local unification is enabled...
% 0.17/0.36 # Any saturation attempts will use folding labels...
% 0.17/0.36 # 28 beginning clauses after preprocessing and clausification
% 0.17/0.36 # Creating start rules for all 3 conjectures.
% 0.17/0.36 # There are 3 start rule candidates:
% 0.17/0.36 # Found 13 unit axioms.
% 0.17/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.17/0.36 # 3 start rule tableaux created.
% 0.17/0.36 # 15 extension rule candidate clauses
% 0.17/0.36 # 13 unit axiom clauses
% 0.17/0.36
% 0.17/0.36 # Requested 8, 32 cores available to the main process.
% 0.17/0.36 # There are not enough tableaux to fork, creating more from the initial 3
% 0.17/0.36 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.17/0.36 # We now have 9 tableaux to operate on
% 0.17/0.36 # There were 1 total branch saturation attempts.
% 0.17/0.36 # There were 0 of these attempts blocked.
% 0.17/0.36 # There were 0 deferred branch saturation attempts.
% 0.17/0.36 # There were 0 free duplicated saturations.
% 0.17/0.36 # There were 1 total successful branch saturations.
% 0.17/0.36 # There were 0 successful branch saturations in interreduction.
% 0.17/0.36 # There were 0 successful branch saturations on the branch.
% 0.17/0.36 # There were 1 successful branch saturations after the branch.
% 0.17/0.36 # There were 1 total branch saturation attempts.
% 0.17/0.36 # There were 0 of these attempts blocked.
% 0.17/0.36 # There were 0 deferred branch saturation attempts.
% 0.17/0.36 # There were 0 free duplicated saturations.
% 0.17/0.36 # There were 1 total successful branch saturations.
% 0.17/0.36 # There were 0 successful branch saturations in interreduction.
% 0.17/0.36 # There were 0 successful branch saturations on the branch.
% 0.17/0.36 # There were 1 successful branch saturations after the branch.
% 0.17/0.36 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.36 # Begin clausification derivation
% 0.17/0.36
% 0.17/0.36 # End clausification derivation
% 0.17/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.17/0.36 cnf(i_0_27, negated_conjecture, (contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0))).
% 0.17/0.36 cnf(i_0_23, plain, (update_slb(create_slb,X1)=create_slb)).
% 0.17/0.36 cnf(i_0_7, plain, (less_than(bottom,X1))).
% 0.17/0.36 cnf(i_0_3, plain, (less_than(X1,X1))).
% 0.17/0.36 cnf(i_0_9, plain, (isnonempty_slb(insert_slb(X1,pair(X2,X3))))).
% 0.17/0.36 cnf(i_0_11, plain, (contains_slb(insert_slb(X1,pair(X2,X3)),X2))).
% 0.17/0.36 cnf(i_0_19, plain, (remove_slb(insert_slb(X1,pair(X2,X3)),X2)=X1)).
% 0.17/0.36 cnf(i_0_21, plain, (lookup_slb(insert_slb(X1,pair(X2,X3)),X2)=X3)).
% 0.17/0.36 cnf(i_0_15, plain, (pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3))).
% 0.17/0.36 cnf(i_0_8, plain, (~isnonempty_slb(create_slb))).
% 0.17/0.36 cnf(i_0_26, negated_conjecture, (~pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X1))).
% 0.17/0.36 cnf(i_0_10, plain, (~contains_slb(create_slb,X1))).
% 0.17/0.36 cnf(i_0_14, plain, (~pair_in_list(create_slb,X1,X2))).
% 0.17/0.36 cnf(i_0_5, plain, (~strictly_less_than(X1,X2)|~less_than(X2,X1))).
% 0.17/0.36 cnf(i_0_6, plain, (less_than(X1,X2)|~strictly_less_than(X1,X2))).
% 0.17/0.36 cnf(i_0_2, plain, (less_than(X1,X2)|less_than(X2,X1))).
% 0.17/0.36 cnf(i_0_28, negated_conjecture, (pair_in_list(esk1_0,X1,esk2_1(X1))|~contains_slb(esk1_0,X1))).
% 0.17/0.36 cnf(i_0_12, plain, (contains_slb(insert_slb(X1,pair(X2,X3)),X4)|~contains_slb(X1,X4))).
% 0.17/0.36 cnf(i_0_4, plain, (strictly_less_than(X1,X2)|less_than(X2,X1))).
% 0.17/0.36 cnf(i_0_1, plain, (less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3))).
% 0.17/0.36 cnf(i_0_13, plain, (X1=X2|contains_slb(X3,X2)|~contains_slb(insert_slb(X3,pair(X1,X4)),X2))).
% 0.17/0.36 cnf(i_0_17, plain, (X1=X2|pair_in_list(X3,X4,X2)|~pair_in_list(insert_slb(X3,pair(X5,X1)),X4,X2))).
% 0.17/0.36 cnf(i_0_18, plain, (X1=X2|pair_in_list(X3,X2,X4)|~pair_in_list(insert_slb(X3,pair(X1,X5)),X2,X4))).
% 0.17/0.36 cnf(i_0_16, plain, (pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)|~pair_in_list(X1,X4,X5))).
% 0.17/0.36 cnf(i_0_22, plain, (lookup_slb(insert_slb(X1,pair(X2,X3)),X4)=lookup_slb(X1,X4)|X2=X4|~contains_slb(X1,X4))).
% 0.17/0.36 cnf(i_0_25, plain, (insert_slb(update_slb(X1,X2),pair(X3,X4))=update_slb(insert_slb(X1,pair(X3,X4)),X2)|~less_than(X2,X4))).
% 0.17/0.36 cnf(i_0_20, plain, (remove_slb(insert_slb(X1,pair(X2,X3)),X4)=insert_slb(remove_slb(X1,X4),pair(X2,X3))|X2=X4|~contains_slb(X1,X4))).
% 0.17/0.36 cnf(i_0_24, plain, (update_slb(insert_slb(X1,pair(X2,X3)),X4)=insert_slb(update_slb(X1,X4),pair(X2,X4))|~strictly_less_than(X3,X4))).
% 0.17/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.17/0.36 # Begin printing tableau
% 0.17/0.36 # Found 4 steps
% 0.17/0.36 cnf(i_0_27, negated_conjecture, (contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)), inference(start_rule)).
% 0.17/0.36 cnf(i_0_35, plain, (contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)), inference(extension_rule, [i_0_12])).
% 0.17/0.36 cnf(i_0_150, plain, (contains_slb(insert_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),pair(X12,X11)),esk3_0)), inference(extension_rule, [i_0_12])).
% 0.17/0.36 cnf(i_0_186, plain, (contains_slb(insert_slb(insert_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),pair(X12,X11)),pair(X8,X9)),esk3_0)), inference(etableau_closure_rule, [i_0_186, ...])).
% 0.17/0.36 # End printing tableau
% 0.17/0.36 # SZS output end
% 0.17/0.36 # Branches closed with saturation will be marked with an "s"
% 0.17/0.36 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.36 # Begin clausification derivation
% 0.17/0.36
% 0.17/0.36 # End clausification derivation
% 0.17/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.17/0.36 cnf(i_0_27, negated_conjecture, (contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0))).
% 0.17/0.36 cnf(i_0_23, plain, (update_slb(create_slb,X1)=create_slb)).
% 0.17/0.36 cnf(i_0_7, plain, (less_than(bottom,X1))).
% 0.17/0.36 cnf(i_0_3, plain, (less_than(X1,X1))).
% 0.17/0.36 cnf(i_0_9, plain, (isnonempty_slb(insert_slb(X1,pair(X2,X3))))).
% 0.17/0.36 cnf(i_0_11, plain, (contains_slb(insert_slb(X1,pair(X2,X3)),X2))).
% 0.17/0.36 cnf(i_0_19, plain, (remove_slb(insert_slb(X1,pair(X2,X3)),X2)=X1)).
% 0.17/0.36 cnf(i_0_21, plain, (lookup_slb(insert_slb(X1,pair(X2,X3)),X2)=X3)).
% 0.17/0.36 cnf(i_0_15, plain, (pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3))).
% 0.17/0.36 cnf(i_0_8, plain, (~isnonempty_slb(create_slb))).
% 0.17/0.36 cnf(i_0_26, negated_conjecture, (~pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X1))).
% 0.17/0.36 cnf(i_0_10, plain, (~contains_slb(create_slb,X1))).
% 0.17/0.36 cnf(i_0_14, plain, (~pair_in_list(create_slb,X1,X2))).
% 0.17/0.36 cnf(i_0_5, plain, (~strictly_less_than(X1,X2)|~less_than(X2,X1))).
% 0.17/0.36 cnf(i_0_6, plain, (less_than(X1,X2)|~strictly_less_than(X1,X2))).
% 0.17/0.36 cnf(i_0_2, plain, (less_than(X1,X2)|less_than(X2,X1))).
% 0.17/0.36 cnf(i_0_28, negated_conjecture, (pair_in_list(esk1_0,X1,esk2_1(X1))|~contains_slb(esk1_0,X1))).
% 0.17/0.36 cnf(i_0_12, plain, (contains_slb(insert_slb(X1,pair(X2,X3)),X4)|~contains_slb(X1,X4))).
% 0.17/0.36 cnf(i_0_4, plain, (strictly_less_than(X1,X2)|less_than(X2,X1))).
% 0.17/0.36 cnf(i_0_1, plain, (less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3))).
% 0.17/0.36 cnf(i_0_13, plain, (X1=X2|contains_slb(X3,X2)|~contains_slb(insert_slb(X3,pair(X1,X4)),X2))).
% 0.17/0.36 cnf(i_0_17, plain, (X1=X2|pair_in_list(X3,X4,X2)|~pair_in_list(insert_slb(X3,pair(X5,X1)),X4,X2))).
% 0.17/0.36 cnf(i_0_18, plain, (X1=X2|pair_in_list(X3,X2,X4)|~pair_in_list(insert_slb(X3,pair(X1,X5)),X2,X4))).
% 0.17/0.36 cnf(i_0_16, plain, (pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)|~pair_in_list(X1,X4,X5))).
% 0.17/0.36 cnf(i_0_22, plain, (lookup_slb(insert_slb(X1,pair(X2,X3)),X4)=lookup_slb(X1,X4)|X2=X4|~contains_slb(X1,X4))).
% 0.17/0.36 cnf(i_0_25, plain, (insert_slb(update_slb(X1,X2),pair(X3,X4))=update_slb(insert_slb(X1,pair(X3,X4)),X2)|~less_than(X2,X4))).
% 0.17/0.36 cnf(i_0_20, plain, (remove_slb(insert_slb(X1,pair(X2,X3)),X4)=insert_slb(remove_slb(X1,X4),pair(X2,X3))|X2=X4|~contains_slb(X1,X4))).
% 0.17/0.36 cnf(i_0_24, plain, (update_slb(insert_slb(X1,pair(X2,X3)),X4)=insert_slb(update_slb(X1,X4),pair(X2,X4))|~strictly_less_than(X3,X4))).
% 0.17/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.17/0.36 # Begin printing tableau
% 0.17/0.36 # Found 5 steps
% 0.17/0.36 cnf(i_0_26, negated_conjecture, (~pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X6)), inference(start_rule)).
% 0.17/0.36 cnf(i_0_34, plain, (~pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X6)), inference(extension_rule, [i_0_16])).
% 0.17/0.36 cnf(i_0_131, plain, (~pair_in_list(esk1_0,esk3_0,X6)), inference(extension_rule, [i_0_17])).
% 0.17/0.36 cnf(i_0_198, plain, (~pair_in_list(insert_slb(esk1_0,pair(esk3_0,X6)),esk3_0,X6)), inference(closure_rule, [i_0_15])).
% 0.17/0.36 cnf(i_0_196, plain, (X6=X6), inference(etableau_closure_rule, [i_0_196, ...])).
% 0.17/0.36 # End printing tableau
% 0.17/0.36 # SZS output end
% 0.17/0.36 # Branches closed with saturation will be marked with an "s"
% 0.17/0.36 # Creating equality axioms
% 0.17/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.17/0.36 # Child (8990) has found a proof.
% 0.17/0.36 # Creating equality axioms
% 0.17/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.17/0.36
% 0.17/0.36 # Creating equality axioms
% 0.17/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.17/0.36 # Proof search is over...
% 0.17/0.36 # Freeing feature tree
%------------------------------------------------------------------------------