TSTP Solution File: SWV404+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV404+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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 21:12:33 EDT 2022
% Result : Timeout 300.03s 300.29s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV404+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 14:21:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.79/1.05 ============================== Prover9 ===============================
% 0.79/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.79/1.05 Process 4323 was started by sandbox on n020.cluster.edu,
% 0.79/1.05 Wed Jun 15 14:21:20 2022
% 0.79/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4170_n020.cluster.edu".
% 0.79/1.05 ============================== end of head ===========================
% 0.79/1.05
% 0.79/1.05 ============================== INPUT =================================
% 0.79/1.05
% 0.79/1.05 % Reading from file /tmp/Prover9_4170_n020.cluster.edu
% 0.79/1.05
% 0.79/1.05 set(prolog_style_variables).
% 0.79/1.05 set(auto2).
% 0.79/1.05 % set(auto2) -> set(auto).
% 0.79/1.05 % set(auto) -> set(auto_inference).
% 0.79/1.05 % set(auto) -> set(auto_setup).
% 0.79/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.79/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.79/1.05 % set(auto) -> set(auto_limits).
% 0.79/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.79/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.79/1.05 % set(auto) -> set(auto_denials).
% 0.79/1.05 % set(auto) -> set(auto_process).
% 0.79/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.79/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.79/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.79/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.79/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.79/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.79/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.79/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.79/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.79/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.79/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.79/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.79/1.05 % set(auto2) -> assign(stats, some).
% 0.79/1.05 % set(auto2) -> clear(echo_input).
% 0.79/1.05 % set(auto2) -> set(quiet).
% 0.79/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.79/1.05 % set(auto2) -> clear(print_given).
% 0.79/1.05 assign(lrs_ticks,-1).
% 0.79/1.05 assign(sos_limit,10000).
% 0.79/1.05 assign(order,kbo).
% 0.79/1.05 set(lex_order_vars).
% 0.79/1.05 clear(print_given).
% 0.79/1.05
% 0.79/1.05 % formulas(sos). % not echoed (44 formulas)
% 0.79/1.05
% 0.79/1.05 ============================== end of input ==========================
% 0.79/1.05
% 0.79/1.05 % From the command line: assign(max_seconds, 300).
% 0.79/1.05
% 0.79/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.79/1.05
% 0.79/1.05 % Formulas that are not ordinary clauses:
% 0.79/1.05 1 (all U all V all W (less_than(U,V) & less_than(V,W) -> less_than(U,W))) # label(transitivity) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 2 (all U all V (less_than(U,V) | less_than(V,U))) # label(totality) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 3 (all U less_than(U,U)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 4 (all U all V (strictly_less_than(U,V) <-> less_than(U,V) & -less_than(V,U))) # label(stricly_smaller_definition) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 5 (all U less_than(bottom,U)) # label(bottom_smallest) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 6 (all U all V all W isnonempty_slb(insert_slb(U,pair(V,W)))) # label(ax19) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 7 (all U -contains_slb(create_slb,U)) # label(ax20) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 8 (all U all V all W all X (contains_slb(insert_slb(U,pair(V,X)),W) <-> contains_slb(U,W) | V = W)) # label(ax21) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 9 (all U all V -pair_in_list(create_slb,U,V)) # label(ax22) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 10 (all U all V all W all X all Y (pair_in_list(insert_slb(U,pair(V,X)),W,Y) <-> pair_in_list(U,W,Y) | V = W & X = Y)) # label(ax23) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 11 (all U all V all W remove_slb(insert_slb(U,pair(V,W)),V) = U) # label(ax24) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 12 (all U all V all W all X (V != W & contains_slb(U,W) -> remove_slb(insert_slb(U,pair(V,X)),W) = insert_slb(remove_slb(U,W),pair(V,X)))) # label(ax25) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 13 (all U all V all W lookup_slb(insert_slb(U,pair(V,W)),V) = W) # label(ax26) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 14 (all U all V all W all X (V != W & contains_slb(U,W) -> lookup_slb(insert_slb(U,pair(V,X)),W) = lookup_slb(U,W))) # label(ax27) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 15 (all U update_slb(create_slb,U) = create_slb) # label(ax28) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 16 (all U all V all W all X (strictly_less_than(X,W) -> update_slb(insert_slb(U,pair(V,X)),W) = insert_slb(update_slb(U,W),pair(V,W)))) # label(ax29) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 17 (all U all V all W all X (less_than(W,X) -> update_slb(insert_slb(U,pair(V,X)),W) = insert_slb(update_slb(U,W),pair(V,X)))) # label(ax30) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 18 (all U succ_cpq(U,U)) # label(ax31) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 19 (all U all V all W (succ_cpq(U,V) -> succ_cpq(U,insert_cpq(V,W)))) # label(ax32) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 20 (all U all V all W (succ_cpq(U,V) -> succ_cpq(U,remove_cpq(V,W)))) # label(ax33) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 21 (all U all V (succ_cpq(U,V) -> succ_cpq(U,findmin_cpq_eff(V)))) # label(ax34) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 22 (all U all V (succ_cpq(U,V) -> succ_cpq(U,removemin_cpq_eff(V)))) # label(ax35) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 23 (all U all V check_cpq(triple(U,create_slb,V))) # label(ax36) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 24 (all U all V all W all X all Y (less_than(Y,X) -> (check_cpq(triple(U,insert_slb(V,pair(X,Y)),W)) <-> check_cpq(triple(U,V,W))))) # label(ax37) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 25 (all U all V all W all X all Y (strictly_less_than(X,Y) -> (check_cpq(triple(U,insert_slb(V,pair(X,Y)),W)) <-> $F))) # label(ax38) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 26 (all U all V all W all X (contains_cpq(triple(U,V,W),X) <-> contains_slb(V,X))) # label(ax39) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 27 (all U all V (ok(triple(U,V,bad)) <-> $F)) # label(ax40) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 28 (all U all V all W (-ok(triple(U,V,W)) -> W = bad)) # label(ax41) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 29 (all U all V all W all X insert_cpq(triple(U,V,W),X) = triple(insert_pqp(U,X),insert_slb(V,pair(X,bottom)),W)) # label(ax42) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 30 (all U all V all W all X (-contains_slb(V,X) -> remove_cpq(triple(U,V,W),X) = triple(U,V,bad))) # label(ax43) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 31 (all U all V all W all X (contains_slb(V,X) & less_than(lookup_slb(V,X),X) -> remove_cpq(triple(U,V,W),X) = triple(remove_pqp(U,X),remove_slb(V,X),W))) # label(ax44) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 32 (all U all V all W all X (contains_slb(V,X) & strictly_less_than(X,lookup_slb(V,X)) -> remove_cpq(triple(U,V,W),X) = triple(remove_pqp(U,X),remove_slb(V,X),bad))) # label(ax45) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 33 (all U all V findmin_cpq_eff(triple(U,create_slb,V)) = triple(U,create_slb,bad)) # label(ax46) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 34 (all U all V all W all X (V != create_slb & -contains_slb(V,findmin_pqp_res(U)) -> findmin_cpq_eff(triple(U,V,W)) = triple(U,update_slb(V,findmin_pqp_res(U)),bad))) # label(ax47) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 35 (all U all V all W all X (V != create_slb & contains_slb(V,findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U),lookup_slb(V,findmin_pqp_res(U))) -> findmin_cpq_eff(triple(U,V,W)) = triple(U,update_slb(V,findmin_pqp_res(U)),bad))) # label(ax48) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 36 (all U all V all W all X (V != create_slb & contains_slb(V,findmin_pqp_res(U)) & less_than(lookup_slb(V,findmin_pqp_res(U)),findmin_pqp_res(U)) -> findmin_cpq_eff(triple(U,V,W)) = triple(U,update_slb(V,findmin_pqp_res(U)),W))) # label(ax49) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 37 (all U all V findmin_cpq_res(triple(U,create_slb,V)) = bottom) # label(ax50) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 38 (all U all V all W all X (V != create_slb -> findmin_cpq_res(triple(U,V,W)) = findmin_pqp_res(U))) # label(ax51) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 39 (Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------