TSTP Solution File: PUZ129+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ129+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:24:05 EDT 2022
% Result : Theorem 0.72s 1.02s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PUZ129+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 : Sat May 28 21:19:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.72/1.02 ============================== Prover9 ===============================
% 0.72/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.02 Process 21875 was started by sandbox on n025.cluster.edu,
% 0.72/1.02 Sat May 28 21:19:26 2022
% 0.72/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_21506_n025.cluster.edu".
% 0.72/1.02 ============================== end of head ===========================
% 0.72/1.02
% 0.72/1.02 ============================== INPUT =================================
% 0.72/1.02
% 0.72/1.02 % Reading from file /tmp/Prover9_21506_n025.cluster.edu
% 0.72/1.02
% 0.72/1.02 set(prolog_style_variables).
% 0.72/1.02 set(auto2).
% 0.72/1.02 % set(auto2) -> set(auto).
% 0.72/1.02 % set(auto) -> set(auto_inference).
% 0.72/1.02 % set(auto) -> set(auto_setup).
% 0.72/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.02 % set(auto) -> set(auto_limits).
% 0.72/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.02 % set(auto) -> set(auto_denials).
% 0.72/1.02 % set(auto) -> set(auto_process).
% 0.72/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.02 % set(auto2) -> assign(stats, some).
% 0.72/1.02 % set(auto2) -> clear(echo_input).
% 0.72/1.02 % set(auto2) -> set(quiet).
% 0.72/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.02 % set(auto2) -> clear(print_given).
% 0.72/1.02 assign(lrs_ticks,-1).
% 0.72/1.02 assign(sos_limit,10000).
% 0.72/1.02 assign(order,kbo).
% 0.72/1.02 set(lex_order_vars).
% 0.72/1.02 clear(print_given).
% 0.72/1.02
% 0.72/1.02 % formulas(sos). % not echoed (1 formulas)
% 0.72/1.02
% 0.72/1.02 ============================== end of input ==========================
% 0.72/1.02
% 0.72/1.02 % From the command line: assign(max_seconds, 300).
% 0.72/1.02
% 0.72/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.02
% 0.72/1.02 % Formulas that are not ordinary clauses:
% 0.72/1.02 1 -((all A (person(A) & property1(A,honest,pos) & property1(A,industrious,pos) -> (exists B (property1(B,healthy,pos) & A = B)))) & (all C (grocer(C) -> -(exists D (property1(D,healthy,pos) & C = D)))) & (all E (grocer(E) & property1(E,industrious,pos) -> (exists F (property1(F,honest,pos) & E = F)))) & (all G (cyclist(G) -> (exists H (property1(H,industrious,pos) & G = H)))) & (all I (cyclist(I) & property1(I,unhealthy,pos) -> (exists J (property1(J,dishonest,pos) & I = J)))) & (all K (person(K) & property1(K,healthy,pos) -> -(exists L (property1(L,unhealthy,pos) & K = L)))) & (all M (person(M) & property1(M,honest,pos) -> -(exists N (property1(N,dishonest,pos) & M = N)))) & (all O (grocer(O) -> (exists P (person(P) & O = P)))) & (all Q (cyclist(Q) -> (exists R (person(R) & Q = R)))) -> (all S (grocer(S) -> -(exists T (cyclist(T) & S = T))))) # label(prove) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.72/1.02
% 0.72/1.02 ============================== end of process non-clausal formulas ===
% 0.72/1.02
% 0.72/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.02
% 0.72/1.02 ============================== PREDICATE ELIMINATION =================
% 0.72/1.02 2 -grocer(A) | -property1(B,healthy,pos) | B != A # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 3 grocer(c1) # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 Derived: -property1(A,healthy,pos) | A != c1. [resolve(2,a,3,a)].
% 0.72/1.02 4 -grocer(A) | person(f5(A)) # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 Derived: person(f5(c1)). [resolve(4,a,3,a)].
% 0.72/1.02 5 -grocer(A) | f5(A) = A # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 Derived: f5(c1) = c1. [resolve(5,a,3,a)].
% 0.72/1.02 6 -grocer(A) | -property1(A,industrious,pos) | f2(A) = A # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 Derived: -property1(c1,industrious,pos) | f2(c1) = c1. [resolve(6,a,3,a)].
% 0.72/1.02 7 -grocer(A) | -property1(A,industrious,pos) | property1(f2(A),honest,pos) # label(prove) # label(negated_
% 0.72/1.02 WARNING: denials share constants (see output).
% 0.72/1.02
% 0.72/1.02 conjecture). [clausify(1)].
% 0.72/1.02 Derived: -property1(c1,industrious,pos) | property1(f2(c1),honest,pos). [resolve(7,a,3,a)].
% 0.72/1.02 8 -cyclist(A) | person(f6(A)) # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 9 cyclist(c2) # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 Derived: person(f6(c2)). [resolve(8,a,9,a)].
% 0.72/1.02 10 -cyclist(A) | f3(A) = A # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 Derived: f3(c2) = c2. [resolve(10,a,9,a)].
% 0.72/1.02 11 -cyclist(A) | f6(A) = A # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 Derived: f6(c2) = c2. [resolve(11,a,9,a)].
% 0.72/1.02 12 -cyclist(A) | property1(f3(A),industrious,pos) # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 Derived: property1(f3(c2),industrious,pos). [resolve(12,a,9,a)].
% 0.72/1.02 13 -cyclist(A) | -property1(A,unhealthy,pos) | f4(A) = A # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 Derived: -property1(c2,unhealthy,pos) | f4(c2) = c2. [resolve(13,a,9,a)].
% 0.72/1.02 14 -cyclist(A) | -property1(A,unhealthy,pos) | property1(f4(A),dishonest,pos) # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 Derived: -property1(c2,unhealthy,pos) | property1(f4(c2),dishonest,pos). [resolve(14,a,9,a)].
% 0.72/1.02 15 person(f5(c1)). [resolve(4,a,3,a)].
% 0.72/1.02 16 -person(A) | -property1(A,healthy,pos) | -property1(B,unhealthy,pos) | B != A # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 17 -person(A) | -property1(A,honest,pos) | -property1(B,dishonest,pos) | B != A # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 18 -person(A) | -property1(A,honest,pos) | -property1(A,industrious,pos) | f1(A) = A # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 19 -person(A) | -property1(A,honest,pos) | -property1(A,industrious,pos) | property1(f1(A),healthy,pos) # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 Derived: -property1(f5(c1),healthy,pos) | -property1(A,unhealthy,pos) | A != f5(c1). [resolve(15,a,16,a)].
% 0.72/1.02 Derived: -property1(f5(c1),honest,pos) | -property1(A,dishonest,pos) | A != f5(c1). [resolve(15,a,17,a)].
% 0.72/1.02 Derived: -property1(f5(c1),honest,pos) | -property1(f5(c1),industrious,pos) | f1(f5(c1)) = f5(c1). [resolve(15,a,18,a)].
% 0.72/1.02 Derived: -property1(f5(c1),honest,pos) | -property1(f5(c1),industrious,pos) | property1(f1(f5(c1)),healthy,pos). [resolve(15,a,19,a)].
% 0.72/1.02 20 person(f6(c2)). [resolve(8,a,9,a)].
% 0.72/1.02 Derived: -property1(f6(c2),healthy,pos) | -property1(A,unhealthy,pos) | A != f6(c2). [resolve(20,a,16,a)].
% 0.72/1.02 Derived: -property1(f6(c2),honest,pos) | -property1(A,dishonest,pos) | A != f6(c2). [resolve(20,a,17,a)].
% 0.72/1.02 Derived: -property1(f6(c2),honest,pos) | -property1(f6(c2),industrious,pos) | f1(f6(c2)) = f6(c2). [resolve(20,a,18,a)].
% 0.72/1.02 Derived: -property1(f6(c2),honest,pos) | -property1(f6(c2),industrious,pos) | property1(f1(f6(c2)),healthy,pos). [resolve(20,a,19,a)].
% 0.72/1.02
% 0.72/1.02 ============================== end predicate elimination =============
% 0.72/1.02
% 0.72/1.02 Auto_denials:
% 0.72/1.02 % assign(max_proofs, 5). % (Horn set with more than one neg. clause)
% 0.72/1.02
% 0.72/1.02 WARNING, because some of the denials share constants,
% 0.72/1.02 some of the denials or their descendents may be subsumed,
% 0.72/1.02 preventing the target number of proofs from being found.
% 0.72/1.02 The shared constants are: c2, honest, dishonest, unhealthy, pos, healthy, c1.
% 0.72/1.02
% 0.72/1.02 Term ordering decisions:
% 0.72/1.02 Function symbol KB weights: pos=1. industrious=1. honest=1. healthy=1. unhealthy=1. dishonest=1. c1=1. c2=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1.
% 0.72/1.02
% 0.72/1.02 ============================== end of process initial clauses ========
% 0.72/1.02
% 0.72/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.02
% 0.72/1.02 ============================== end of clauses for search =============
% 0.72/1.02
% 0.72/1.02 ============================== SEARCH ================================
% 0.72/1.02
% 0.72/1.02 % Starting search at 0.01 seconds.
% 0.72/1.02
% 0.72/1.02 ============================== PROOF =================================
% 0.72/1.02 % SZS status Theorem
% 0.72/1.02 % SZS output start Refutation
% 0.72/1.02
% 0.72/1.02 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.72/1.02 % Length of proof is 34.
% 0.72/1.02 % Level of proof is 9.
% 0.72/1.02 % Maximum clause weight is 9.000.
% 0.72/1.02 % Given clauses 2.
% 0.72/1.02
% 0.72/1.02 1 -((all A (person(A) & property1(A,honest,pos) & property1(A,industrious,pos) -> (exists B (property1(B,healthy,pos) & A = B)))) & (all C (grocer(C) -> -(exists D (property1(D,healthy,pos) & C = D)))) & (all E (grocer(E) & property1(E,industrious,pos) -> (exists F (property1(F,honest,pos) & E = F)))) & (all G (cyclist(G) -> (exists H (property1(H,industrious,pos) & G = H)))) & (all I (cyclist(I) & property1(I,unhealthy,pos) -> (exists J (property1(J,dishonest,pos) & I = J)))) & (all K (person(K) & property1(K,healthy,pos) -> -(exists L (property1(L,unhealthy,pos) & K = L)))) & (all M (person(M) & property1(M,honest,pos) -> -(exists N (property1(N,dishonest,pos) & M = N)))) & (all O (grocer(O) -> (exists P (person(P) & O = P)))) & (all Q (cyclist(Q) -> (exists R (person(R) & Q = R)))) -> (all S (grocer(S) -> -(exists T (cyclist(T) & S = T))))) # label(prove) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.72/1.02 2 -grocer(A) | -property1(B,healthy,pos) | B != A # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 3 grocer(c1) # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 4 -grocer(A) | person(f5(A)) # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 5 -grocer(A) | f5(A) = A # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 6 -grocer(A) | -property1(A,industrious,pos) | f2(A) = A # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 7 -grocer(A) | -property1(A,industrious,pos) | property1(f2(A),honest,pos) # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 9 cyclist(c2) # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 10 -cyclist(A) | f3(A) = A # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 12 -cyclist(A) | property1(f3(A),industrious,pos) # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 15 person(f5(c1)). [resolve(4,a,3,a)].
% 0.72/1.02 18 -person(A) | -property1(A,honest,pos) | -property1(A,industrious,pos) | f1(A) = A # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 19 -person(A) | -property1(A,honest,pos) | -property1(A,industrious,pos) | property1(f1(A),healthy,pos) # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 21 c2 = c1 # label(prove) # label(negated_conjecture). [clausify(1)].
% 0.72/1.02 22 -property1(A,healthy,pos) | A != c1. [resolve(2,a,3,a)].
% 0.72/1.02 23 -property1(A,healthy,pos) | c1 != A. [copy(22),flip(b)].
% 0.72/1.02 24 f5(c1) = c1. [resolve(5,a,3,a)].
% 0.72/1.02 25 -property1(c1,industrious,pos) | f2(c1) = c1. [resolve(6,a,3,a)].
% 0.72/1.02 26 -property1(c1,industrious,pos) | property1(f2(c1),honest,pos). [resolve(7,a,3,a)].
% 0.72/1.02 27 f3(c2) = c2. [resolve(10,a,9,a)].
% 0.72/1.02 28 f3(c1) = c1. [copy(27),rewrite([21(1),21(3)])].
% 0.72/1.02 31 property1(f3(c2),industrious,pos). [resolve(12,a,9,a)].
% 0.72/1.02 32 property1(c1,industrious,pos). [copy(31),rewrite([21(1),28(2)])].
% 0.72/1.02 41 -property1(f5(c1),honest,pos) | -property1(f5(c1),industrious,pos) | f1(f5(c1)) = f5(c1). [resolve(15,a,18,a)].
% 0.72/1.02 42 -property1(c1,honest,pos) | f1(c1) = c1. [copy(41),rewrite([24(2),24(6),24(10),24(12)]),unit_del(b,32)].
% 0.72/1.02 43 -property1(f5(c1),honest,pos) | -property1(f5(c1),industrious,pos) | property1(f1(f5(c1)),healthy,pos). [resolve(15,a,19,a)].
% 0.72/1.02 44 -property1(c1,honest,pos) | property1(f1(c1),healthy,pos). [copy(43),rewrite([24(2),24(6),24(10)]),unit_del(b,32)].
% 0.72/1.02 49 property1(f2(c1),honest,pos). [back_unit_del(26),unit_del(a,32)].
% 0.72/1.02 50 f2(c1) = c1. [back_unit_del(25),unit_del(a,32)].
% 0.72/1.02 51 property1(c1,honest,pos). [back_rewrite(49),rewrite([50(2)])].
% 0.72/1.02 52 property1(f1(c1),healthy,pos). [back_unit_del(44),unit_del(a,51)].
% 0.72/1.02 53 f1(c1) = c1. [back_unit_del(42),unit_del(a,51)].
% 0.72/1.02 55 property1(c1,healthy,pos). [back_rewrite(52),rewrite([53(2)])].
% 0.72/1.02 57 $F. [ur(23,b,21,a(flip)),rewrite([21(1)]),unit_del(a,55)].
% 0.72/1.02
% 0.72/1.02 % SZS output end Refutation
% 0.72/1.02 ============================== end of proof ==========================
% 0.72/1.02 % Redundant proof: 58 $F. [ur(23,b,xx),unit_del(a,55)].
% 0.72/1.02
% 0.72/1.02 % Disable descendants (x means already disabled):
% 0.72/1.02 2x 22x 23
% 0.72/1.02
% 0.72/1.02 ============================== STATISTICS ============================
% 0.72/1.02
% 0.72/1.02 Given=16. Generated=48. Kept=24. proofs=1.
% 0.72/1.02 Usable=13. Sos=0. Demods=6. Limbo=0, Disabled=48. Hints=0.
% 0.72/1.02 Megabytes=0.09.
% 0.72/1.02 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.72/1.02
% 0.72/1.02 ============================== end of statistics =====================
% 0.72/1.02
% 0.72/1.02 ============================== end of search =========================
% 0.72/1.02
% 0.72/1.02 SEARCH FAILED
% 0.72/1.02
% 0.72/1.02 Exiting with 1 proof.
% 0.72/1.02
% 0.72/1.02 Process 21875 exit (sos_empty) Sat May 28 21:19:26 2022
% 0.72/1.02 Prover9 interrupted
%------------------------------------------------------------------------------