TSTP Solution File: PUZ047+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ047+1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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 : Mon Jul 18 18:23:55 EDT 2022
% Result : Theorem 0.42s 0.92s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PUZ047+1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n019.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 : Sun May 29 01:15:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/0.91 ============================== Prover9 ===============================
% 0.42/0.91 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.91 Process 15562 was started by sandbox2 on n019.cluster.edu,
% 0.42/0.91 Sun May 29 01:15:56 2022
% 0.42/0.91 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15384_n019.cluster.edu".
% 0.42/0.91 ============================== end of head ===========================
% 0.42/0.91
% 0.42/0.91 ============================== INPUT =================================
% 0.42/0.91
% 0.42/0.91 % Reading from file /tmp/Prover9_15384_n019.cluster.edu
% 0.42/0.91
% 0.42/0.91 set(prolog_style_variables).
% 0.42/0.91 set(auto2).
% 0.42/0.91 % set(auto2) -> set(auto).
% 0.42/0.91 % set(auto) -> set(auto_inference).
% 0.42/0.91 % set(auto) -> set(auto_setup).
% 0.42/0.91 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.91 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.91 % set(auto) -> set(auto_limits).
% 0.42/0.91 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.91 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.91 % set(auto) -> set(auto_denials).
% 0.42/0.91 % set(auto) -> set(auto_process).
% 0.42/0.91 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.91 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.91 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.91 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.91 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.91 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.91 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.91 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.91 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.91 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.91 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.91 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.91 % set(auto2) -> assign(stats, some).
% 0.42/0.91 % set(auto2) -> clear(echo_input).
% 0.42/0.91 % set(auto2) -> set(quiet).
% 0.42/0.91 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.91 % set(auto2) -> clear(print_given).
% 0.42/0.91 assign(lrs_ticks,-1).
% 0.42/0.91 assign(sos_limit,10000).
% 0.42/0.91 assign(order,kbo).
% 0.42/0.91 set(lex_order_vars).
% 0.42/0.91 clear(print_given).
% 0.42/0.91
% 0.42/0.91 % formulas(sos). % not echoed (1 formulas)
% 0.42/0.91
% 0.42/0.91 ============================== end of input ==========================
% 0.42/0.91
% 0.42/0.91 % From the command line: assign(max_seconds, 300).
% 0.42/0.91
% 0.42/0.91 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.91
% 0.42/0.91 % Formulas that are not ordinary clauses:
% 0.42/0.91 1 -(p(south,south,south,south,start) & (all T (p(south,north,south,north,T) -> p(north,north,south,north,go_alone(T)))) & (all T1 (p(north,north,south,north,T1) -> p(south,north,south,north,go_alone(T1)))) & (all T2 (p(south,south,north,south,T2) -> p(north,south,north,south,go_alone(T2)))) & (all T3 (p(north,south,north,south,T3) -> p(south,south,north,south,go_alone(T3)))) & (all T4 (p(south,south,south,north,T4) -> p(north,north,south,north,take_wolf(T4)))) & (all T5 (p(north,north,south,north,T5) -> p(south,south,south,north,take_wolf(T5)))) & (all T6 (p(south,south,north,south,T6) -> p(north,north,north,south,take_wolf(T6)))) & (all T7 (p(north,north,north,south,T7) -> p(south,south,north,south,take_wolf(T7)))) & (all X all Y all U (p(south,X,south,Y,U) -> p(north,X,north,Y,take_goat(U)))) & (all X1 all Y1 all V (p(north,X1,north,Y1,V) -> p(south,X1,south,Y1,take_goat(V)))) & (all T8 (p(south,north,south,south,T8) -> p(north,north,south,north,take_cabbage(T8)))) & (all T9 (p(north,north,south,north,T9) -> p(south,north,south,south,take_cabbage(T9)))) & (all U1 (p(south,south,north,south,U1) -> p(north,south,north,north,take_cabbage(U1)))) & (all V1 (p(north,south,north,north,V1) -> p(south,south,north,south,take_cabbage(V1)))) -> (exists Z p(north,north,north,north,Z))) # label(thm100) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.91
% 0.42/0.91 ============================== end of process non-clausal formulas ===
% 0.42/0.91
% 0.42/0.91 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.91
% 0.42/0.91 ============================== PREDICATE ELIMINATION =================
% 0.42/0.91
% 0.42/0.91 ============================== end predicate elimination =============
% 0.42/0.91
% 0.42/0.91 Auto_denials:
% 0.42/0.91 % copying label thm100 to answer in negative clause
% 0.42/0.91
% 0.42/0.91 Term ordering decisions:
% 0.42/0.91 Function symbol KB weights: south=1. north=1. start=1. go_alone=1. take_cabbage=1. take_wolf=1. take_goat=1.
% 0.42/0.91
% 0.42/0.91 ============================== end of process initial clauses ========
% 0.42/0.91
% 0.42/0.91 ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.92
% 0.42/0.92 ============================== end of clauses for search =============
% 0.42/0.92
% 0.42/0.92 ============================== SEARCH ================================
% 0.42/0.92
% 0.42/0.92 % Starting search at 0.01 seconds.
% 0.42/0.92
% 0.42/0.92 ============================== PROOF =================================
% 0.42/0.92 % SZS status Theorem
% 0.42/0.92 % SZS output start Refutation
% 0.42/0.92
% 0.42/0.92 % Proof 1 at 0.01 (+ 0.00) seconds: thm100.
% 0.42/0.92 % Length of proof is 17.
% 0.42/0.92 % Level of proof is 7.
% 0.42/0.92 % Maximum clause weight is 13.000.
% 0.42/0.92 % Given clauses 22.
% 0.42/0.92
% 0.42/0.92 1 -(p(south,south,south,south,start) & (all T (p(south,north,south,north,T) -> p(north,north,south,north,go_alone(T)))) & (all T1 (p(north,north,south,north,T1) -> p(south,north,south,north,go_alone(T1)))) & (all T2 (p(south,south,north,south,T2) -> p(north,south,north,south,go_alone(T2)))) & (all T3 (p(north,south,north,south,T3) -> p(south,south,north,south,go_alone(T3)))) & (all T4 (p(south,south,south,north,T4) -> p(north,north,south,north,take_wolf(T4)))) & (all T5 (p(north,north,south,north,T5) -> p(south,south,south,north,take_wolf(T5)))) & (all T6 (p(south,south,north,south,T6) -> p(north,north,north,south,take_wolf(T6)))) & (all T7 (p(north,north,north,south,T7) -> p(south,south,north,south,take_wolf(T7)))) & (all X all Y all U (p(south,X,south,Y,U) -> p(north,X,north,Y,take_goat(U)))) & (all X1 all Y1 all V (p(north,X1,north,Y1,V) -> p(south,X1,south,Y1,take_goat(V)))) & (all T8 (p(south,north,south,south,T8) -> p(north,north,south,north,take_cabbage(T8)))) & (all T9 (p(north,north,south,north,T9) -> p(south,north,south,south,take_cabbage(T9)))) & (all U1 (p(south,south,north,south,U1) -> p(north,south,north,north,take_cabbage(U1)))) & (all V1 (p(north,south,north,north,V1) -> p(south,south,north,south,take_cabbage(V1)))) -> (exists Z p(north,north,north,north,Z))) # label(thm100) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.92 2 p(south,south,south,south,start) # label(thm100) # label(negated_conjecture). [clausify(1)].
% 0.42/0.92 3 -p(north,north,north,north,A) # label(thm100) # label(negated_conjecture) # answer(thm100). [clausify(1)].
% 0.42/0.92 5 -p(north,north,south,north,A) | p(south,north,south,north,go_alone(A)) # label(thm100) # label(negated_conjecture). [clausify(1)].
% 0.42/0.92 7 -p(north,south,north,south,A) | p(south,south,north,south,go_alone(A)) # label(thm100) # label(negated_conjecture). [clausify(1)].
% 0.42/0.92 10 -p(south,south,north,south,A) | p(north,north,north,south,take_wolf(A)) # label(thm100) # label(negated_conjecture). [clausify(1)].
% 0.42/0.92 12 -p(south,A,south,B,C) | p(north,A,north,B,take_goat(C)) # label(thm100) # label(negated_conjecture). [clausify(1)].
% 0.42/0.92 13 -p(north,A,north,B,C) | p(south,A,south,B,take_goat(C)) # label(thm100) # label(negated_conjecture). [clausify(1)].
% 0.42/0.92 14 -p(south,north,south,south,A) | p(north,north,south,north,take_cabbage(A)) # label(thm100) # label(negated_conjecture). [clausify(1)].
% 0.42/0.92 18 -p(south,north,south,north,A) # answer(thm100). [resolve(12,b,3,a)].
% 0.42/0.92 19 p(north,south,north,south,take_goat(start)). [ur(12,a,2,a)].
% 0.42/0.92 20 -p(north,north,south,north,A) # answer(thm100). [resolve(18,a,5,b)].
% 0.42/0.92 21 -p(south,north,south,south,A) # answer(thm100). [resolve(20,a,14,b)].
% 0.42/0.92 23 -p(north,north,north,south,A) # answer(thm100). [resolve(21,a,13,b)].
% 0.42/0.92 25 -p(south,south,north,south,A) # answer(thm100). [resolve(23,a,10,b)].
% 0.42/0.92 27 p(south,south,north,south,go_alone(take_goat(start))). [ur(7,a,19,a)].
% 0.42/0.92 28 $F # answer(thm100). [resolve(27,a,25,a)].
% 0.42/0.92
% 0.42/0.92 % SZS output end Refutation
% 0.42/0.92 ============================== end of proof ==========================
% 0.42/0.92
% 0.42/0.92 ============================== STATISTICS ============================
% 0.42/0.92
% 0.42/0.92 Given=22. Generated=37. Kept=26. proofs=1.
% 0.42/0.92 Usable=11. Sos=2. Demods=0. Limbo=1, Disabled=27. Hints=0.
% 0.42/0.92 Megabytes=0.10.
% 0.42/0.92 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.42/0.92
% 0.42/0.92 ============================== end of statistics =====================
% 0.42/0.92
% 0.42/0.92 ============================== end of search =========================
% 0.42/0.92
% 0.42/0.92 THEOREM PROVED
% 0.42/0.92 % SZS status Theorem
% 0.42/0.92
% 0.42/0.92 Exiting with 1 proof.
% 0.42/0.92
% 0.42/0.92 Process 15562 exit (max_proofs) Sun May 29 01:15:56 2022
% 0.42/0.92 Prover9 interrupted
%------------------------------------------------------------------------------