TSTP Solution File: PHI010+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PHI010+1 : TPTP v8.1.0. Released v7.2.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 : Mon Jul 18 16:48:23 EDT 2022
% Result : Theorem 0.69s 0.99s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : PHI010+1 : TPTP v8.1.0. Released v7.2.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n020.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 2 01:01:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/0.98 ============================== Prover9 ===============================
% 0.69/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.98 Process 26930 was started by sandbox on n020.cluster.edu,
% 0.69/0.98 Thu Jun 2 01:01:38 2022
% 0.69/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26775_n020.cluster.edu".
% 0.69/0.98 ============================== end of head ===========================
% 0.69/0.98
% 0.69/0.98 ============================== INPUT =================================
% 0.69/0.98
% 0.69/0.98 % Reading from file /tmp/Prover9_26775_n020.cluster.edu
% 0.69/0.98
% 0.69/0.98 set(prolog_style_variables).
% 0.69/0.98 set(auto2).
% 0.69/0.98 % set(auto2) -> set(auto).
% 0.69/0.98 % set(auto) -> set(auto_inference).
% 0.69/0.98 % set(auto) -> set(auto_setup).
% 0.69/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.69/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.98 % set(auto) -> set(auto_limits).
% 0.69/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.98 % set(auto) -> set(auto_denials).
% 0.69/0.98 % set(auto) -> set(auto_process).
% 0.69/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.69/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.69/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.69/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.69/0.98 % set(auto2) -> assign(stats, some).
% 0.69/0.98 % set(auto2) -> clear(echo_input).
% 0.69/0.98 % set(auto2) -> set(quiet).
% 0.69/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.98 % set(auto2) -> clear(print_given).
% 0.69/0.98 assign(lrs_ticks,-1).
% 0.69/0.98 assign(sos_limit,10000).
% 0.69/0.98 assign(order,kbo).
% 0.69/0.98 set(lex_order_vars).
% 0.69/0.98 clear(print_given).
% 0.69/0.98
% 0.69/0.98 % formulas(sos). % not echoed (5 formulas)
% 0.69/0.98
% 0.69/0.98 ============================== end of input ==========================
% 0.69/0.98
% 0.69/0.98 % From the command line: assign(max_seconds, 300).
% 0.69/0.98
% 0.69/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.98
% 0.69/0.98 % Formulas that are not ordinary clauses:
% 0.69/0.98 1 (all X (object(X) -> -property(X))) # label(objects_are_not_properties) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 2 (all X all F (exemplifies_property(F,X) -> property(F) & object(X))) # label(exemplifier_is_object_and_exemplified_is_property) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 3 (all X all F (is_the(X,F) -> property(F) & object(X))) # label(description_is_property_and_described_is_object) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 4 (all F all X all W (property(F) & object(X) & object(W) -> (is_the(X,F) & X = W <-> (exists Y (object(Y) & exemplifies_property(F,Y) & (all Z (object(Z) -> (exemplifies_property(F,Z) -> Z = Y))) & Y = W))))) # label(description_axiom_identity_instance) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 5 -(all X all F all Y (object(X) & property(F) & object(Y) -> (is_the(X,F) & X = Y -> exemplifies_property(F,Y)))) # label(lemma_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.69/0.98
% 0.69/0.98 ============================== end of process non-clausal formulas ===
% 0.69/0.98
% 0.69/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/0.98
% 0.69/0.98 ============================== PREDICATE ELIMINATION =================
% 0.69/0.98 6 -object(A) | -property(A) # label(objects_are_not_properties) # label(axiom). [clausify(1)].
% 0.69/0.98 7 property(c2) # label(lemma_1) # label(negated_conjecture). [clausify(5)].
% 0.69/0.98 Derived: -object(c2). [resolve(6,b,7,a)].
% 0.69/0.98 8 -exemplifies_property(A,B) | property(A) # label(exemplifier_is_object_and_exemplified_is_property) # label(axiom). [clausify(2)].
% 0.69/0.98 Derived: -exemplifies_property(A,B) | -object(A). [resolve(8,b,6,b)].
% 0.69/0.98 9 -is_the(A,B) | property(B) # label(description_is_property_and_described_is_object) # label(axiom). [clausify(3)].
% 0.69/0.98 Derived: -is_the(A,B) | -object(B). [resolve(9,b,6,b)].
% 0.69/0.98 10 -property(A) | -object(B) | -object(C) | -is_the(B,A) | C != B | object(f1(A,B,C)) # label(description_axiom_identity_instance) # label(axiom). [clausify(4)].
% 0.69/0.98 Derived: -object(A) | -object(B) | -is_the(A,c2) | B != A | object(f1(c2,A,B)). [resolve(10,a,7,a)].
% 0.69/0.98 Derived: -object(A) | -object(B) | -is_the(A,C) | B != A | object(f1(C,A,B)) | -exemplifies_property(C,D). [resolve(10,a,8,b)].
% 0.69/0.98 Derived: -object(A) | -object(B) | -is_the(A,C) | B != A | object(f1(C,A,B)) | -is_the(D,C). [resolve(10,a,9,b)].
% 0.69/0.98 11 -property(A) | -object(B) | -object(C) | -is_the(B,A) | C != B | exemplifies_property(A,f1(A,B,C)) # label(description_axiom_identity_instance) # label(axiom). [clausify(4)].
% 0.69/0.98 Derived: -object(A) | -object(B) | -is_the(A,c2) | B != A | exemplifies_property(c2,f1(c2,A,B)). [resolve(11,a,7,a)].
% 0.69/0.98 Derived: -object(A) | -object(B) | -is_the(A,C) | B != A | exemplifies_property(C,f1(C,A,B)) | -exemplifies_property(C,D). [resolve(11,a,8,b)].
% 0.69/0.98 Derived: -object(A) | -object(B) | -is_the(A,C) | B != A | exemplifies_property(C,f1(C,A,B)) | -is_the(D,C). [resolve(11,a,9,b)].
% 0.69/0.98 12 -property(A) | -object(B) | -object(C) | -is_the(B,A) | C != B | f1(A,B,C) = C # label(description_axiom_identity_instance) # label(axiom). [clausify(4)].
% 0.69/0.98 Derived: -object(A) | -object(B) | -is_the(A,c2) | B != A | f1(c2,A,B) = B. [resolve(12,a,7,a)].
% 0.69/0.98 Derived: -object(A) | -object(B) | -is_the(A,C) | B != A | f1(C,A,B) = B | -exemplifies_property(C,D). [resolve(12,a,8,b)].
% 0.69/0.98 Derived: -object(A) | -object(B) | -is_the(A,C) | B != A | f1(C,A,B) = B | -is_the(D,C). [resolve(12,a,9,b)].
% 0.69/0.98 13 -property(A) | -object(B) | -object(C) | -is_the(B,A) | C != B | -object(D) | -exemplifies_property(A,D) | D = f1(A,B,C) # label(description_axiom_identity_instance) # label(axiom). [clausify(4)].
% 0.69/0.98 Derived: -object(A) | -object(B) | -is_the(A,c2) | B != A | -object(C) | -exemplifies_property(c2,C) | C = f1(c2,A,B). [resolve(13,a,7,a)].
% 0.69/0.98 Derived: -object(A) | -object(B) | -is_the(A,C) | B != A | -object(D) | -exemplifies_property(C,D) | D = f1(C,A,B) | -exemplifies_property(C,E). [resolve(13,a,8,b)].
% 0.69/0.98 14 -property(A) | -object(B) | -object(C) | is_the(B,A) | -object(D) | -exemplifies_property(A,D) | object(f2(A,B,C,D)) | D != C # label(description_axiom_identity_instance) # label(axiom). [clausify(4)].
% 0.69/0.98 Derived: -object(A) | -object(B) | is_the(A,c2) | -object(C) | -exemplifies_property(c2,C) | object(f2(c2,A,B,C)) | C != B. [resolve(14,a,7,a)].
% 0.69/0.98 Derived: -object(A) | -object(B) | is_the(A,C) | -object(D) | -exemplifies_property(C,D) | object(f2(C,A,B,D)) | D != B | -exemplifies_property(C,E). [resolve(14,a,8,b)].
% 0.69/0.98 15 -property(A) | -object(B) | -object(C) | C = B | -object(D) | -exemplifies_property(A,D) | object(f2(A,B,C,D)) | D != C # label(description_axiom_identity_instance) # label(axiom). [clausify(4)].
% 0.69/0.98 Derived: -object(A) | -object(B) | B = A | -object(C) | -exemplifies_property(c2,C) | object(f2(c2,A,B,C)) | C != B. [resolve(15,a,7,a)].
% 0.69/0.98 Derived: -object(A) | -object(B) | B = A | -object(C) | -exemplifies_property(D,C) | object(f2(D,A,B,C)) | C != B | -exemplifies_property(D,E). [resolve(15,a,8,b)].
% 0.69/0.98 16 -property(A) | -object(B) | -object(C) | is_the(B,A) | -object(D) | -exemplifies_property(A,D) | exemplifies_property(A,f2(A,B,C,D)) | D != C # label(description_axiom_identity_instance) # label(axiom). [clausify(4)].
% 0.69/0.98 Derived: -object(A) | -object(B) | is_the(A,c2) | -object(C) | -exemplifies_property(c2,C) | exemplifies_property(c2,f2(c2,A,B,C)) | C != B. [resolve(16,a,7,a)].
% 0.69/0.98 Derived: -object(A) | -object(B) | is_the(A,C) | -object(D) | -exemplifies_property(C,D) | exemplifies_property(C,f2(C,A,B,D)) | D != B | -exemplifies_property(C,E). [resolve(16,a,8,b)].
% 0.69/0.98 17 -property(A) | -object(B) | -object(C) | is_the(B,A) | -object(D) | -exemplifies_property(A,D) | f2(A,B,C,D) != D | D != C # label(description_axiom_identity_instance) # label(axiom). [clausify(4)].
% 0.69/0.98 Derived: -object(A) | -object(B) | is_the(A,c2) | -object(C) | -exemplifies_property(c2,C) | f2(c2,A,B,C) != C | C != B. [resolve(17,a,7,a)].
% 0.69/0.98 Derived: -object(A) | -object(B) | is_the(A,C) | -object(D) | -exemplifies_property(C,D) | f2(C,A,B,D) != D | D != B | -exemplifies_property(C,E). [resolve(17,a,8,b)].
% 0.69/0.98 18 -property(A) | -object(B) | -object(C) | C = B | -object(D) | -exemplifies_property(A,D) | exemplifies_property(A,f2(A,B,C,D)) | D != C # label(description_axiom_identity_instance) # label(axiom). [clausify(4)].
% 0.69/0.99 Derived: -object(A) | -object(B) | B = A | -object(C) | -exemplifies_property(c2,C) | exemplifies_property(c2,f2(c2,A,B,C)) | C != B. [resolve(18,a,7,a)].
% 0.69/0.99 Derived: -object(A) | -object(B) | B = A | -object(C) | -exemplifies_property(D,C) | exemplifies_property(D,f2(D,A,B,C)) | C != B | -exemplifies_property(D,E). [resolve(18,a,8,b)].
% 0.69/0.99 19 -property(A) | -object(B) | -object(C) | C = B | -object(D) | -exemplifies_property(A,D) | f2(A,B,C,D) != D | D != C # label(description_axiom_identity_instance) # label(axiom). [clausify(4)].
% 0.69/0.99 Derived: -object(A) | -object(B) | B = A | -object(C) | -exemplifies_property(c2,C) | f2(c2,A,B,C) != C | C != B. [resolve(19,a,7,a)].
% 0.69/0.99 Derived: -object(A) | -object(B) | B = A | -object(C) | -exemplifies_property(D,C) | f2(D,A,B,C) != C | C != B | -exemplifies_property(D,E). [resolve(19,a,8,b)].
% 0.69/0.99
% 0.69/0.99 ============================== end predicate elimination =============
% 0.69/0.99
% 0.69/0.99 Auto_denials: (non-Horn, no changes).
% 0.69/0.99
% 0.69/0.99 Term ordering decisions:
% 0.69/0.99 Function symbol KB weights: c1=1. c2=1. c3=1. f1=1. f2=1.
% 0.69/0.99
% 0.69/0.99 ============================== end of process initial clauses ========
% 0.69/0.99
% 0.69/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.69/0.99
% 0.69/0.99 ============================== end of clauses for search =============
% 0.69/0.99
% 0.69/0.99 ============================== SEARCH ================================
% 0.69/0.99
% 0.69/0.99 % Starting search at 0.02 seconds.
% 0.69/0.99
% 0.69/0.99 ============================== PROOF =================================
% 0.69/0.99 % SZS status Theorem
% 0.69/0.99 % SZS output start Refutation
% 0.69/0.99
% 0.69/0.99 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.69/0.99 % Length of proof is 20.
% 0.69/0.99 % Level of proof is 6.
% 0.69/0.99 % Maximum clause weight is 19.000.
% 0.69/0.99 % Given clauses 22.
% 0.69/0.99
% 0.69/0.99 3 (all X all F (is_the(X,F) -> property(F) & object(X))) # label(description_is_property_and_described_is_object) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 4 (all F all X all W (property(F) & object(X) & object(W) -> (is_the(X,F) & X = W <-> (exists Y (object(Y) & exemplifies_property(F,Y) & (all Z (object(Z) -> (exemplifies_property(F,Z) -> Z = Y))) & Y = W))))) # label(description_axiom_identity_instance) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 5 -(all X all F all Y (object(X) & property(F) & object(Y) -> (is_the(X,F) & X = Y -> exemplifies_property(F,Y)))) # label(lemma_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.69/0.99 9 -is_the(A,B) | property(B) # label(description_is_property_and_described_is_object) # label(axiom). [clausify(3)].
% 0.69/0.99 11 -property(A) | -object(B) | -object(C) | -is_the(B,A) | C != B | exemplifies_property(A,f1(A,B,C)) # label(description_axiom_identity_instance) # label(axiom). [clausify(4)].
% 0.69/0.99 12 -property(A) | -object(B) | -object(C) | -is_the(B,A) | C != B | f1(A,B,C) = C # label(description_axiom_identity_instance) # label(axiom). [clausify(4)].
% 0.69/0.99 20 object(c1) # label(lemma_1) # label(negated_conjecture). [clausify(5)].
% 0.69/0.99 22 is_the(c1,c2) # label(lemma_1) # label(negated_conjecture). [clausify(5)].
% 0.69/0.99 23 c3 = c1 # label(lemma_1) # label(negated_conjecture). [clausify(5)].
% 0.69/0.99 24 -exemplifies_property(c2,c3) # label(lemma_1) # label(negated_conjecture). [clausify(5)].
% 0.69/0.99 25 -exemplifies_property(c2,c1). [copy(24),rewrite([23(2)])].
% 0.69/0.99 36 -object(A) | -object(B) | -is_the(A,C) | B != A | exemplifies_property(C,f1(C,A,B)) | -is_the(D,C). [resolve(11,a,9,b)].
% 0.69/0.99 39 -object(A) | -object(B) | -is_the(A,C) | B != A | f1(C,A,B) = B | -is_the(D,C). [resolve(12,a,9,b)].
% 0.69/0.99 62 -object(A) | -is_the(A,B) | exemplifies_property(B,f1(B,A,A)) | -is_the(C,B). [factor(36,a,b),xx(c)].
% 0.69/0.99 66 -object(A) | -is_the(A,B) | f1(B,A,A) = A | -is_the(C,B). [factor(39,a,b),xx(c)].
% 0.69/0.99 110 -object(A) | -is_the(A,B) | exemplifies_property(B,f1(B,A,A)). [factor(62,b,d)].
% 0.69/0.99 111 -object(A) | -is_the(A,B) | f1(B,A,A) = A. [factor(66,b,d)].
% 0.69/0.99 147 exemplifies_property(c2,f1(c2,c1,c1)). [resolve(110,b,22,a),unit_del(a,20)].
% 0.69/0.99 148 f1(c2,c1,c1) = c1. [resolve(111,b,22,a),unit_del(a,20)].
% 0.69/0.99 149 $F. [back_rewrite(147),rewrite([148(5)]),unit_del(a,25)].
% 0.69/0.99
% 0.69/0.99 % SZS output end Refutation
% 0.69/0.99 ============================== end of proof ==========================
% 0.69/0.99
% 0.69/0.99 ============================== STATISTICS ============================
% 0.69/0.99
% 0.69/0.99 Given=22. Generated=210. Kept=126. proofs=1.
% 0.69/0.99 Usable=22. Sos=29. Demods=2. Limbo=1, Disabled=121. Hints=0.
% 0.69/0.99 Megabytes=0.14.
% 0.69/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.69/0.99
% 0.69/0.99 ============================== end of statistics =====================
% 0.69/0.99
% 0.69/0.99 ============================== end of search =========================
% 0.69/0.99
% 0.69/0.99 THEOREM PROVED
% 0.69/0.99 % SZS status Theorem
% 0.69/0.99
% 0.69/0.99 Exiting with 1 proof.
% 0.69/0.99
% 0.69/0.99 Process 26930 exit (max_proofs) Thu Jun 2 01:01:38 2022
% 0.69/0.99 Prover9 interrupted
%------------------------------------------------------------------------------