TSTP Solution File: SWV398+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV398+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 : n032.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:51 EDT 2022
% Result : Theorem 7.61s 7.82s
% Output : CNFRefutation 7.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SWV398+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Wed Jun 15 17:05:29 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.14/0.33 # No SInE strategy applied
% 0.14/0.33 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.14/0.33 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.14/0.33 #
% 0.14/0.33 # Presaturation interreduction done
% 0.14/0.33 # Number of axioms: 55 Number of unprocessed: 55
% 0.14/0.33 # Tableaux proof search.
% 0.14/0.33 # APR header successfully linked.
% 0.14/0.33 # Hello from C++
% 0.14/0.34 # The folding up rule is enabled...
% 0.14/0.34 # Local unification is enabled...
% 0.14/0.34 # Any saturation attempts will use folding labels...
% 0.14/0.34 # 55 beginning clauses after preprocessing and clausification
% 0.14/0.34 # Creating start rules for all 2 conjectures.
% 0.14/0.34 # There are 2 start rule candidates:
% 0.14/0.34 # Found 19 unit axioms.
% 0.14/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.34 # 2 start rule tableaux created.
% 0.14/0.34 # 36 extension rule candidate clauses
% 0.14/0.34 # 19 unit axiom clauses
% 0.14/0.34
% 0.14/0.34 # Requested 8, 32 cores available to the main process.
% 0.14/0.34 # There are not enough tableaux to fork, creating more from the initial 2
% 7.61/7.82 # There were 3 total branch saturation attempts.
% 7.61/7.82 # There were 0 of these attempts blocked.
% 7.61/7.82 # There were 0 deferred branch saturation attempts.
% 7.61/7.82 # There were 0 free duplicated saturations.
% 7.61/7.82 # There were 2 total successful branch saturations.
% 7.61/7.82 # There were 0 successful branch saturations in interreduction.
% 7.61/7.82 # There were 0 successful branch saturations on the branch.
% 7.61/7.82 # There were 2 successful branch saturations after the branch.
% 7.61/7.82 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.61/7.82 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.61/7.82 # Begin clausification derivation
% 7.61/7.82
% 7.61/7.82 # End clausification derivation
% 7.61/7.82 # Begin listing active clauses obtained from FOF to CNF conversion
% 7.61/7.82 cnf(i_0_56, negated_conjecture, (check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))))).
% 7.61/7.82 cnf(i_0_23, plain, (update_slb(create_slb,X1)=create_slb)).
% 7.61/7.82 cnf(i_0_7, plain, (less_than(bottom,X1))).
% 7.61/7.82 cnf(i_0_3, plain, (less_than(X1,X1))).
% 7.61/7.82 cnf(i_0_26, plain, (succ_cpq(X1,X1))).
% 7.61/7.82 cnf(i_0_31, plain, (check_cpq(triple(X1,create_slb,X2)))).
% 7.61/7.82 cnf(i_0_47, plain, (findmin_cpq_res(triple(X1,create_slb,X2))=bottom)).
% 7.61/7.82 cnf(i_0_43, plain, (findmin_cpq_eff(triple(X1,create_slb,X2))=triple(X1,create_slb,bad))).
% 7.61/7.82 cnf(i_0_9, plain, (isnonempty_slb(insert_slb(X1,pair(X2,X3))))).
% 7.61/7.82 cnf(i_0_19, plain, (remove_slb(insert_slb(X1,pair(X2,X3)),X2)=X1)).
% 7.61/7.82 cnf(i_0_11, plain, (contains_slb(insert_slb(X1,pair(X2,X3)),X2))).
% 7.61/7.82 cnf(i_0_21, plain, (lookup_slb(insert_slb(X1,pair(X2,X3)),X2)=X3)).
% 7.61/7.82 cnf(i_0_15, plain, (pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3))).
% 7.61/7.82 cnf(i_0_39, plain, (triple(insert_pqp(X1,X2),insert_slb(X3,pair(X2,bottom)),X4)=insert_cpq(triple(X1,X3,X4),X2))).
% 7.61/7.82 cnf(i_0_8, plain, (~isnonempty_slb(create_slb))).
% 7.61/7.82 cnf(i_0_57, negated_conjecture, (~check_cpq(triple(esk5_0,esk6_0,esk7_0)))).
% 7.61/7.82 cnf(i_0_10, plain, (~contains_slb(create_slb,X1))).
% 7.61/7.82 cnf(i_0_14, plain, (~pair_in_list(create_slb,X1,X2))).
% 7.61/7.82 cnf(i_0_37, plain, (~ok(triple(X1,X2,bad)))).
% 7.61/7.82 cnf(i_0_5, plain, (~strictly_less_than(X1,X2)|~less_than(X2,X1))).
% 7.61/7.82 cnf(i_0_6, plain, (less_than(X1,X2)|~strictly_less_than(X1,X2))).
% 7.61/7.82 cnf(i_0_29, plain, (succ_cpq(X1,findmin_cpq_eff(X2))|~succ_cpq(X1,X2))).
% 7.61/7.82 cnf(i_0_2, plain, (less_than(X1,X2)|less_than(X2,X1))).
% 7.61/7.82 cnf(i_0_38, plain, (X1=bad|ok(triple(X2,X3,X1)))).
% 7.61/7.82 cnf(i_0_36, plain, (contains_slb(X1,X2)|~contains_cpq(triple(X3,X1,X4),X2))).
% 7.61/7.82 cnf(i_0_34, plain, (~check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))|~strictly_less_than(X3,X4))).
% 7.61/7.82 cnf(i_0_4, plain, (strictly_less_than(X1,X2)|less_than(X2,X1))).
% 7.61/7.82 cnf(i_0_1, plain, (less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3))).
% 7.61/7.82 cnf(i_0_27, plain, (succ_cpq(X1,insert_cpq(X2,X3))|~succ_cpq(X1,X2))).
% 7.61/7.82 cnf(i_0_28, plain, (succ_cpq(X1,remove_cpq(X2,X3))|~succ_cpq(X1,X2))).
% 7.61/7.82 cnf(i_0_35, plain, (contains_cpq(triple(X1,X2,X3),X4)|~contains_slb(X2,X4))).
% 7.61/7.82 cnf(i_0_48, plain, (findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)|X2=create_slb)).
% 7.61/7.82 cnf(i_0_30, plain, (succ_cpq(X1,remove_cpq(findmin_cpq_eff(X2),findmin_cpq_res(X2)))|~succ_cpq(X1,X2))).
% 7.61/7.82 cnf(i_0_53, lemma, (less_than(X1,X2)|~check_cpq(triple(X3,X4,X5))|~pair_in_list(X4,X2,X1))).
% 7.61/7.82 cnf(i_0_13, plain, (X1=X2|contains_slb(X3,X2)|~contains_slb(insert_slb(X3,pair(X1,X4)),X2))).
% 7.61/7.82 cnf(i_0_51, lemma, (check_cpq(triple(X1,X2,X3))|~less_than(esk2_2(X1,X2),esk1_2(X1,X2)))).
% 7.61/7.82 cnf(i_0_33, plain, (check_cpq(triple(X1,X2,X3))|~check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))|~less_than(X5,X4))).
% 7.61/7.82 cnf(i_0_12, plain, (contains_slb(insert_slb(X1,pair(X2,X3)),X4)|~contains_slb(X1,X4))).
% 7.61/7.82 cnf(i_0_40, plain, (remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)|contains_slb(X2,X4))).
% 7.61/7.82 cnf(i_0_22, plain, (lookup_slb(insert_slb(X1,pair(X2,X3)),X4)=lookup_slb(X1,X4)|X2=X4|~contains_slb(X1,X4))).
% 7.61/7.82 cnf(i_0_17, plain, (X1=X2|pair_in_list(X3,X4,X2)|~pair_in_list(insert_slb(X3,pair(X5,X1)),X4,X2))).
% 7.61/7.82 cnf(i_0_18, plain, (X1=X2|pair_in_list(X3,X2,X4)|~pair_in_list(insert_slb(X3,pair(X1,X5)),X2,X4))).
% 7.61/7.82 cnf(i_0_16, plain, (pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)|~pair_in_list(X1,X4,X5))).
% 7.61/7.82 cnf(i_0_52, lemma, (check_cpq(triple(X1,X2,X3))|pair_in_list(X2,esk1_2(X1,X2),esk2_2(X1,X2)))).
% 7.61/7.82 cnf(i_0_32, plain, (check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))|~check_cpq(triple(X1,X2,X5))|~less_than(X4,X3))).
% 7.61/7.82 cnf(i_0_54, lemma, (strictly_less_than(esk3_2(X1,X2),esk4_2(X1,X2))|~pair_in_list(X1,X3,X4)|~strictly_less_than(X3,X4))).
% 7.61/7.82 cnf(i_0_25, plain, (update_slb(insert_slb(X1,pair(X2,X3)),X4)=insert_slb(update_slb(X1,X4),pair(X2,X3))|~less_than(X4,X3))).
% 7.61/7.82 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))).
% 7.61/7.82 cnf(i_0_44, plain, (findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)|X2=create_slb|contains_slb(X2,findmin_pqp_res(X1)))).
% 7.61/7.82 cnf(i_0_55, lemma, (pair_in_list(update_slb(X1,X2),esk3_2(X1,X2),esk4_2(X1,X2))|~pair_in_list(X1,X3,X4)|~strictly_less_than(X3,X4))).
% 7.61/7.82 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))).
% 7.61/7.82 cnf(i_0_41, plain, (triple(remove_pqp(X1,X2),remove_slb(X3,X2),X4)=remove_cpq(triple(X1,X3,X4),X2)|~contains_slb(X3,X2)|~less_than(lookup_slb(X3,X2),X2))).
% 7.61/7.82 cnf(i_0_46, plain, (triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)=findmin_cpq_eff(triple(X1,X2,X3))|X2=create_slb|~contains_slb(X2,findmin_pqp_res(X1))|~less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)))).
% 7.61/7.82 cnf(i_0_42, plain, (remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)|~contains_slb(X2,X4)|~strictly_less_than(X4,lookup_slb(X2,X4)))).
% 7.61/7.82 cnf(i_0_45, plain, (findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)|X2=create_slb|~strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))))).
% 7.61/7.82 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 7.61/7.82 # Begin printing tableau
% 7.61/7.82 # Found 4 steps
% 7.61/7.82 cnf(i_0_57, negated_conjecture, (~check_cpq(triple(esk5_0,esk6_0,esk7_0))), inference(start_rule)).
% 7.61/7.82 cnf(i_0_61, plain, (~check_cpq(triple(esk5_0,esk6_0,esk7_0))), inference(extension_rule, [i_0_52])).
% 7.61/7.82 cnf(i_0_119, plain, (pair_in_list(esk6_0,esk1_2(esk5_0,esk6_0),esk2_2(esk5_0,esk6_0))), inference(extension_rule, [i_0_16])).
% 7.61/7.82 cnf(i_0_305368, plain, (pair_in_list(insert_slb(esk6_0,pair(X7,X8)),esk1_2(esk5_0,esk6_0),esk2_2(esk5_0,esk6_0))), inference(etableau_closure_rule, [i_0_305368, ...])).
% 7.61/7.82 # End printing tableau
% 7.61/7.82 # SZS output end
% 7.61/7.82 # Branches closed with saturation will be marked with an "s"
% 7.61/7.82 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 7.61/7.82 # We now have 4 tableaux to operate on
% 7.61/7.82 # Found closed tableau during pool population.
% 7.61/7.82 # Proof search is over...
% 7.61/7.82 # Freeing feature tree
%------------------------------------------------------------------------------