TSTP Solution File: SWV415+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV415+2 : 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 : n017.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:55 EDT 2022
% Result : Theorem 1.39s 1.60s
% Output : CNFRefutation 1.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV415+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 15 07:00:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.38 # No SInE strategy applied
% 0.19/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.19/0.38 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.19/0.38 #
% 0.19/0.38 # Presaturation interreduction done
% 0.19/0.38 # Number of axioms: 87 Number of unprocessed: 87
% 0.19/0.38 # Tableaux proof search.
% 0.19/0.38 # APR header successfully linked.
% 0.19/0.38 # Hello from C++
% 1.32/1.50 # The folding up rule is enabled...
% 1.32/1.50 # Local unification is enabled...
% 1.32/1.50 # Any saturation attempts will use folding labels...
% 1.32/1.50 # 87 beginning clauses after preprocessing and clausification
% 1.32/1.50 # Creating start rules for all 1 conjectures.
% 1.32/1.50 # There are 1 start rule candidates:
% 1.32/1.50 # Found 26 unit axioms.
% 1.32/1.50 # 1 start rule tableaux created.
% 1.32/1.50 # 61 extension rule candidate clauses
% 1.32/1.50 # 26 unit axiom clauses
% 1.32/1.50
% 1.32/1.50 # Requested 8, 32 cores available to the main process.
% 1.32/1.50 # There are not enough tableaux to fork, creating more from the initial 1
% 1.39/1.60 # There were 1 total branch saturation attempts.
% 1.39/1.60 # There were 0 of these attempts blocked.
% 1.39/1.60 # There were 0 deferred branch saturation attempts.
% 1.39/1.60 # There were 0 free duplicated saturations.
% 1.39/1.60 # There were 1 total successful branch saturations.
% 1.39/1.60 # There were 0 successful branch saturations in interreduction.
% 1.39/1.60 # There were 0 successful branch saturations on the branch.
% 1.39/1.60 # There were 1 successful branch saturations after the branch.
% 1.39/1.60 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.39/1.60 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.39/1.60 # Begin clausification derivation
% 1.39/1.60
% 1.39/1.60 # End clausification derivation
% 1.39/1.60 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.39/1.60 cnf(i_0_39, plain, (update_slb(create_slb,X1)=create_slb)).
% 1.39/1.60 cnf(i_0_7, plain, (less_than(bottom,X1))).
% 1.39/1.60 cnf(i_0_3, plain, (less_than(X1,X1))).
% 1.39/1.60 cnf(i_0_42, plain, (succ_cpq(X1,X1))).
% 1.39/1.60 cnf(i_0_9, plain, (isnonempty_pq(insert_pq(X1,X2)))).
% 1.39/1.60 cnf(i_0_67, plain, (i(triple(X1,create_slb,X2))=create_pq)).
% 1.39/1.60 cnf(i_0_17, plain, (remove_pq(insert_pq(X1,X2),X2)=X1)).
% 1.39/1.60 cnf(i_0_63, plain, (findmin_cpq_res(triple(X1,create_slb,X2))=bottom)).
% 1.39/1.60 cnf(i_0_47, plain, (check_cpq(triple(X1,create_slb,X2)))).
% 1.39/1.60 cnf(i_0_11, plain, (contains_pq(insert_pq(X1,X2),X2))).
% 1.39/1.60 cnf(i_0_25, plain, (isnonempty_slb(insert_slb(X1,pair(X2,X3))))).
% 1.39/1.60 cnf(i_0_59, plain, (findmin_cpq_eff(triple(X1,create_slb,X2))=triple(X1,create_slb,bad))).
% 1.39/1.60 cnf(i_0_35, plain, (remove_slb(insert_slb(X1,pair(X2,X3)),X2)=X1)).
% 1.39/1.60 cnf(i_0_37, plain, (lookup_slb(insert_slb(X1,pair(X2,X3)),X2)=X3)).
% 1.39/1.60 cnf(i_0_27, plain, (contains_slb(insert_slb(X1,pair(X2,X3)),X2))).
% 1.39/1.60 cnf(i_0_31, plain, (pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3))).
% 1.39/1.60 cnf(i_0_55, plain, (triple(insert_pqp(X1,X2),insert_slb(X3,pair(X2,bottom)),X4)=insert_cpq(triple(X1,X3,X4),X2))).
% 1.39/1.60 cnf(i_0_23, plain, (insert_pq(insert_pq(X1,X2),X3)=insert_pq(insert_pq(X1,X3),X2))).
% 1.39/1.60 cnf(i_0_68, plain, (i(triple(X1,insert_slb(X2,pair(X3,X4)),X5))=insert_pq(i(triple(X1,X2,X5)),X3))).
% 1.39/1.60 cnf(i_0_8, plain, (~isnonempty_pq(create_pq))).
% 1.39/1.60 cnf(i_0_89, negated_conjecture, (i(insert_cpq(triple(esk16_0,esk17_0,esk18_0),esk19_0))!=insert_pq(i(triple(esk16_0,esk17_0,esk18_0)),esk19_0))).
% 1.39/1.60 cnf(i_0_24, plain, (~isnonempty_slb(create_slb))).
% 1.39/1.60 cnf(i_0_10, plain, (~contains_pq(create_pq,X1))).
% 1.39/1.60 cnf(i_0_26, plain, (~contains_slb(create_slb,X1))).
% 1.39/1.60 cnf(i_0_30, plain, (~pair_in_list(create_slb,X1,X2))).
% 1.39/1.60 cnf(i_0_53, plain, (~ok(triple(X1,X2,bad)))).
% 1.39/1.60 cnf(i_0_5, plain, (~strictly_less_than(X1,X2)|~less_than(X2,X1))).
% 1.39/1.61 cnf(i_0_84, plain, (check_cpq(esk4_1(X1))|~phi(X1))).
% 1.39/1.61 cnf(i_0_6, plain, (less_than(X1,X2)|~strictly_less_than(X1,X2))).
% 1.39/1.61 cnf(i_0_70, plain, (contains_pq(X1,X2)|~pi_sharp_remove(X1,X2))).
% 1.39/1.61 cnf(i_0_75, plain, (contains_pq(X1,X2)|~pi_sharp_find_min(X1,X2))).
% 1.39/1.61 cnf(i_0_80, plain, (contains_pq(X1,X2)|~pi_sharp_removemin(X1,X2))).
% 1.39/1.61 cnf(i_0_85, plain, (ok(esk4_1(X1))|~phi(X1))).
% 1.39/1.61 cnf(i_0_74, plain, (issmallestelement_pq(X1,X2)|~pi_sharp_find_min(X1,X2))).
% 1.39/1.61 cnf(i_0_79, plain, (issmallestelement_pq(X1,X2)|~pi_sharp_removemin(X1,X2))).
% 1.39/1.61 cnf(i_0_71, plain, (pi_remove(X1,X2)|~pi_sharp_remove(i(X1),X2))).
% 1.39/1.61 cnf(i_0_76, plain, (pi_find_min(X1)|~pi_sharp_find_min(i(X1),X2))).
% 1.39/1.61 cnf(i_0_86, plain, (succ_cpq(X1,esk4_1(X1))|~phi(X1))).
% 1.39/1.61 cnf(i_0_69, plain, (pi_sharp_remove(X1,X2)|~contains_pq(X1,X2))).
% 1.39/1.61 cnf(i_0_81, plain, (pi_removemin(X1)|~pi_sharp_find_min(i(X1),X2))).
% 1.39/1.61 cnf(i_0_14, plain, (issmallestelement_pq(X1,X2)|~less_than(X2,esk1_2(X1,X2)))).
% 1.39/1.61 cnf(i_0_73, plain, (pi_sharp_find_min(X1,X2)|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2))).
% 1.39/1.61 cnf(i_0_78, plain, (pi_sharp_removemin(X1,X2)|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2))).
% 1.39/1.61 cnf(i_0_72, plain, (pi_sharp_remove(i(X1),X2)|~pi_remove(X1,X2))).
% 1.39/1.61 cnf(i_0_77, plain, (pi_sharp_find_min(i(X1),esk2_1(X1))|~pi_find_min(X1))).
% 1.39/1.61 cnf(i_0_82, plain, (pi_sharp_find_min(i(X1),esk3_1(X1))|~pi_removemin(X1))).
% 1.39/1.61 cnf(i_0_2, plain, (less_than(X1,X2)|less_than(X2,X1))).
% 1.39/1.61 cnf(i_0_54, plain, (X1=bad|ok(triple(X2,X3,X1)))).
% 1.39/1.61 cnf(i_0_52, plain, (contains_slb(X1,X2)|~contains_cpq(triple(X3,X1,X4),X2))).
% 1.39/1.61 cnf(i_0_45, plain, (succ_cpq(X1,findmin_cpq_eff(X2))|~succ_cpq(X1,X2))).
% 1.39/1.61 cnf(i_0_83, plain, (phi(X1)|~ok(X2)|~check_cpq(X2)|~succ_cpq(X1,X2))).
% 1.39/1.61 cnf(i_0_50, plain, (~check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))|~strictly_less_than(X3,X4))).
% 1.39/1.61 cnf(i_0_43, plain, (succ_cpq(X1,insert_cpq(X2,X3))|~succ_cpq(X1,X2))).
% 1.39/1.61 cnf(i_0_12, plain, (contains_pq(insert_pq(X1,X2),X3)|~contains_pq(X1,X3))).
% 1.39/1.61 cnf(i_0_4, plain, (strictly_less_than(X1,X2)|less_than(X2,X1))).
% 1.39/1.61 cnf(i_0_64, plain, (findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)|X2=create_slb)).
% 1.39/1.61 cnf(i_0_16, plain, (less_than(X1,X2)|~issmallestelement_pq(X3,X1)|~contains_pq(X3,X2))).
% 1.39/1.61 cnf(i_0_1, plain, (less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3))).
% 1.39/1.61 cnf(i_0_19, plain, (findmin_pq_eff(X1,X2)=X1|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2))).
% 1.39/1.61 cnf(i_0_20, plain, (findmin_pq_res(X1,X2)=X2|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2))).
% 1.39/1.61 cnf(i_0_22, plain, (removemin_pq_res(X1,X2)=X2|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2))).
% 1.39/1.61 cnf(i_0_13, plain, (X1=X2|contains_pq(X3,X2)|~contains_pq(insert_pq(X3,X1),X2))).
% 1.39/1.61 cnf(i_0_44, plain, (succ_cpq(X1,remove_cpq(X2,X3))|~succ_cpq(X1,X2))).
% 1.39/1.61 cnf(i_0_51, plain, (contains_cpq(triple(X1,X2,X3),X4)|~contains_slb(X2,X4))).
% 1.39/1.61 cnf(i_0_15, plain, (issmallestelement_pq(X1,X2)|contains_pq(X1,esk1_2(X1,X2)))).
% 1.39/1.61 cnf(i_0_21, plain, (removemin_pq_eff(X1,X2)=remove_pq(X1,X2)|~issmallestelement_pq(X1,X2)|~contains_pq(X1,X2))).
% 1.39/1.61 cnf(i_0_29, plain, (X1=X2|contains_slb(X3,X2)|~contains_slb(insert_slb(X3,pair(X1,X4)),X2))).
% 1.39/1.61 cnf(i_0_46, plain, (succ_cpq(X1,remove_cpq(findmin_cpq_eff(X2),findmin_cpq_res(X2)))|~succ_cpq(X1,X2))).
% 1.39/1.61 cnf(i_0_28, plain, (contains_slb(insert_slb(X1,pair(X2,X3)),X4)|~contains_slb(X1,X4))).
% 1.39/1.61 cnf(i_0_56, plain, (remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)|contains_slb(X2,X4))).
% 1.39/1.61 cnf(i_0_18, plain, (remove_pq(insert_pq(X1,X2),X3)=insert_pq(remove_pq(X1,X3),X2)|X3=X2|~contains_pq(X1,X3))).
% 1.39/1.61 cnf(i_0_33, plain, (X1=X2|pair_in_list(X3,X4,X2)|~pair_in_list(insert_slb(X3,pair(X5,X1)),X4,X2))).
% 1.39/1.61 cnf(i_0_38, plain, (lookup_slb(insert_slb(X1,pair(X2,X3)),X4)=lookup_slb(X1,X4)|X2=X4|~contains_slb(X1,X4))).
% 1.39/1.61 cnf(i_0_34, plain, (X1=X2|pair_in_list(X3,X2,X4)|~pair_in_list(insert_slb(X3,pair(X1,X5)),X2,X4))).
% 1.39/1.61 cnf(i_0_49, plain, (check_cpq(triple(X1,X2,X3))|~check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))|~less_than(X5,X4))).
% 1.39/1.61 cnf(i_0_32, plain, (pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)|~pair_in_list(X1,X4,X5))).
% 1.39/1.61 cnf(i_0_48, plain, (check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))|~check_cpq(triple(X1,X2,X5))|~less_than(X4,X3))).
% 1.39/1.61 cnf(i_0_41, plain, (update_slb(insert_slb(X1,pair(X2,X3)),X4)=insert_slb(update_slb(X1,X4),pair(X2,X3))|~less_than(X4,X3))).
% 1.39/1.61 cnf(i_0_36, 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))).
% 1.39/1.61 cnf(i_0_40, plain, (update_slb(insert_slb(X1,pair(X2,X3)),X4)=insert_slb(update_slb(X1,X4),pair(X2,X4))|~strictly_less_than(X3,X4))).
% 1.39/1.61 cnf(i_0_60, 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)))).
% 1.39/1.61 cnf(i_0_57, 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))).
% 1.39/1.61 cnf(i_0_62, 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)))).
% 1.39/1.61 cnf(i_0_58, 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)))).
% 1.39/1.61 cnf(i_0_61, 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))))).
% 1.39/1.61 cnf(i_0_88, plain, (i(triple(X1,esk9_0,X2))=i(triple(X3,esk9_0,X4))|i(triple(X5,X6,X7))=i(triple(X8,X6,X9)))).
% 1.39/1.61 cnf(i_0_87, plain, (i(triple(X1,X2,X3))=i(triple(X4,X2,X5))|i(triple(esk10_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk12_0))!=i(triple(esk11_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk13_0)))).
% 1.39/1.61 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.39/1.61 # Begin printing tableau
% 1.39/1.61 # Found 6 steps
% 1.39/1.61 cnf(i_0_89, negated_conjecture, (i(insert_cpq(triple(esk16_0,esk17_0,esk18_0),esk19_0))!=insert_pq(i(triple(esk16_0,esk17_0,esk18_0)),esk19_0)), inference(start_rule)).
% 1.39/1.61 cnf(i_0_94, plain, (i(insert_cpq(triple(esk16_0,esk17_0,esk18_0),esk19_0))!=insert_pq(i(triple(esk16_0,esk17_0,esk18_0)),esk19_0)), inference(extension_rule, [i_0_34])).
% 1.39/1.61 cnf(i_0_205, plain, (pair_in_list(create_slb,insert_pq(i(triple(esk16_0,esk17_0,esk18_0)),esk19_0),insert_pq(i(triple(esk16_0,esk17_0,esk18_0)),esk19_0))), inference(closure_rule, [i_0_30])).
% 1.39/1.61 cnf(i_0_206, plain, (~pair_in_list(insert_slb(create_slb,pair(i(insert_cpq(triple(esk16_0,esk17_0,esk18_0),esk19_0)),X16)),insert_pq(i(triple(esk16_0,esk17_0,esk18_0)),esk19_0),insert_pq(i(triple(esk16_0,esk17_0,esk18_0)),esk19_0))), inference(extension_rule, [i_0_33])).
% 1.39/1.61 cnf(i_0_492, plain, (i(insert_cpq(triple(esk16_0,esk17_0,esk18_0),esk19_0))=insert_pq(i(triple(esk16_0,esk17_0,esk18_0)),esk19_0)), inference(closure_rule, [i_0_89])).
% 1.39/1.61 cnf(i_0_494, plain, (~pair_in_list(insert_slb(insert_slb(create_slb,pair(i(insert_cpq(triple(esk16_0,esk17_0,esk18_0),esk19_0)),X16)),pair(X12,i(insert_cpq(triple(esk16_0,esk17_0,esk18_0),esk19_0)))),insert_pq(i(triple(esk16_0,esk17_0,esk18_0)),esk19_0),insert_pq(i(triple(esk16_0,esk17_0,esk18_0)),esk19_0))), inference(etableau_closure_rule, [i_0_494, ...])).
% 1.39/1.61 # End printing tableau
% 1.39/1.61 # SZS output end
% 1.39/1.61 # Branches closed with saturation will be marked with an "s"
% 1.39/1.61 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux.
% 1.39/1.61 # We now have 6 tableaux to operate on
% 1.39/1.61 # Found closed tableau during pool population.
% 1.39/1.61 # Proof search is over...
% 1.39/1.61 # Freeing feature tree
%------------------------------------------------------------------------------