TSTP Solution File: PHI009+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PHI009+1 : TPTP v8.1.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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.48s 1.04s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PHI009+1 : TPTP v8.1.0. Released v7.2.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 2 01:32:46 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.48/1.04 ============================== Prover9 ===============================
% 0.48/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.04 Process 25064 was started by sandbox2 on n029.cluster.edu,
% 0.48/1.04 Thu Jun 2 01:32:46 2022
% 0.48/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24911_n029.cluster.edu".
% 0.48/1.04 ============================== end of head ===========================
% 0.48/1.04
% 0.48/1.04 ============================== INPUT =================================
% 0.48/1.04
% 0.48/1.04 % Reading from file /tmp/Prover9_24911_n029.cluster.edu
% 0.48/1.04
% 0.48/1.04 set(prolog_style_variables).
% 0.48/1.04 set(auto2).
% 0.48/1.04 % set(auto2) -> set(auto).
% 0.48/1.04 % set(auto) -> set(auto_inference).
% 0.48/1.04 % set(auto) -> set(auto_setup).
% 0.48/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.48/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/1.04 % set(auto) -> set(auto_limits).
% 0.48/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/1.04 % set(auto) -> set(auto_denials).
% 0.48/1.04 % set(auto) -> set(auto_process).
% 0.48/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.48/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.48/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.48/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.48/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.48/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.48/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.48/1.04 % set(auto2) -> assign(stats, some).
% 0.48/1.04 % set(auto2) -> clear(echo_input).
% 0.48/1.04 % set(auto2) -> set(quiet).
% 0.48/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.48/1.04 % set(auto2) -> clear(print_given).
% 0.48/1.04 assign(lrs_ticks,-1).
% 0.48/1.04 assign(sos_limit,10000).
% 0.48/1.04 assign(order,kbo).
% 0.48/1.04 set(lex_order_vars).
% 0.48/1.04 clear(print_given).
% 0.48/1.04
% 0.48/1.04 % formulas(sos). % not echoed (2 formulas)
% 0.48/1.04
% 0.48/1.04 ============================== end of input ==========================
% 0.48/1.04
% 0.48/1.04 % From the command line: assign(max_seconds, 300).
% 0.48/1.04
% 0.48/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/1.04
% 0.48/1.04 % Formulas that are not ordinary clauses:
% 0.48/1.04 1 (all F all G all X (property(F) & property(G) & object(X) -> (is_the(X,F) & exemplifies_property(G,X) <-> (exists Y (object(Y) & exemplifies_property(F,Y) & (all Z (object(Z) -> (exemplifies_property(F,Z) -> Z = Y))) & exemplifies_property(G,Y)))))) # label(description_axiom_schema_instance) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 2 -(all F (property(F) -> ((exists Y (object(Y) & exemplifies_property(F,Y) & (all Z (object(Z) -> (exemplifies_property(F,Z) -> Z = Y))))) -> (exists U (object(U) & is_the(U,F)))))) # label(description_theorem_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.48/1.04
% 0.48/1.04 ============================== end of process non-clausal formulas ===
% 0.48/1.04
% 0.48/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.48/1.04
% 0.48/1.04 ============================== PREDICATE ELIMINATION =================
% 0.48/1.04
% 0.48/1.04 ============================== end predicate elimination =============
% 0.48/1.04
% 0.48/1.04 Auto_denials: (non-Horn, no changes).
% 0.48/1.04
% 0.48/1.04 Term ordering decisions:
% 0.48/1.04 Function symbol KB weights: c1=1. c2=1. f1=1. f2=1.
% 0.48/1.04
% 0.48/1.04 ============================== end of process initial clauses ========
% 0.48/1.04
% 0.48/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.48/1.04
% 0.48/1.04 ============================== end of clauses for search =============
% 0.48/1.04
% 0.48/1.04 ============================== SEARCH ================================
% 0.48/1.04
% 0.48/1.04 % Starting search at 0.01 seconds.
% 0.48/1.04
% 0.48/1.04 ============================== PROOF =================================
% 0.48/1.04 % SZS status Theorem
% 0.48/1.04 % SZS output start Refutation
% 0.48/1.04
% 0.48/1.04 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.48/1.04 % Length of proof is 22.
% 0.48/1.04 % Level of proof is 5.
% 0.48/1.04 % Maximum clause weight is 24.000.
% 0.48/1.04 % Given clauses 36.
% 0.48/1.04
% 0.48/1.04 1 (all F all G all X (property(F) & property(G) & object(X) -> (is_the(X,F) & exemplifies_property(G,X) <-> (exists Y (object(Y) & exemplifies_property(F,Y) & (all Z (object(Z) -> (exemplifies_property(F,Z) -> Z = Y))) & exemplifies_property(G,Y)))))) # label(description_axiom_schema_instance) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 2 -(all F (property(F) -> ((exists Y (object(Y) & exemplifies_property(F,Y) & (all Z (object(Z) -> (exemplifies_property(F,Z) -> Z = Y))))) -> (exists U (object(U) & is_the(U,F)))))) # label(description_theorem_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.48/1.04 3 property(c1) # label(description_theorem_1) # label(negated_conjecture). [clausify(2)].
% 0.48/1.04 4 object(c2) # label(description_theorem_1) # label(negated_conjecture). [clausify(2)].
% 0.48/1.04 5 exemplifies_property(c1,c2) # label(description_theorem_1) # label(negated_conjecture). [clausify(2)].
% 0.48/1.04 6 -object(A) | -is_the(A,c1) # label(description_theorem_1) # label(negated_conjecture). [clausify(2)].
% 0.48/1.04 7 -object(A) | -exemplifies_property(c1,A) | A = c2 # label(description_theorem_1) # label(negated_conjecture). [clausify(2)].
% 0.48/1.04 8 -object(A) | -exemplifies_property(c1,A) | c2 = A. [copy(7),flip(c)].
% 0.48/1.04 14 -property(A) | -property(B) | -object(C) | is_the(C,A) | -object(D) | -exemplifies_property(A,D) | object(f2(A,B,C,D)) | -exemplifies_property(B,D) # label(description_axiom_schema_instance) # label(axiom). [clausify(1)].
% 0.48/1.04 16 -property(A) | -property(B) | -object(C) | is_the(C,A) | -object(D) | -exemplifies_property(A,D) | exemplifies_property(A,f2(A,B,C,D)) | -exemplifies_property(B,D) # label(description_axiom_schema_instance) # label(axiom). [clausify(1)].
% 0.48/1.04 17 -property(A) | -property(B) | -object(C) | is_the(C,A) | -object(D) | -exemplifies_property(A,D) | f2(A,B,C,D) != D | -exemplifies_property(B,D) # label(description_axiom_schema_instance) # label(axiom). [clausify(1)].
% 0.48/1.04 25 -property(A) | -object(B) | is_the(B,A) | -object(C) | -exemplifies_property(A,C) | object(f2(A,A,B,C)). [factor(14,a,b),merge(g)].
% 0.48/1.04 28 -property(A) | -object(B) | is_the(B,A) | -object(C) | -exemplifies_property(A,C) | exemplifies_property(A,f2(A,A,B,C)). [factor(16,a,b),merge(g)].
% 0.48/1.04 30 -property(A) | -object(B) | is_the(B,A) | -object(C) | -exemplifies_property(A,C) | f2(A,A,B,C) != C. [factor(17,a,b),merge(g)].
% 0.48/1.04 34 -property(A) | -object(B) | is_the(B,A) | -exemplifies_property(A,B) | object(f2(A,A,B,B)). [factor(25,b,d)].
% 0.48/1.04 35 -property(A) | -object(B) | is_the(B,A) | -exemplifies_property(A,B) | exemplifies_property(A,f2(A,A,B,B)). [factor(28,b,d)].
% 0.48/1.04 36 -property(A) | -object(B) | is_the(B,A) | -exemplifies_property(A,B) | f2(A,A,B,B) != B. [factor(30,b,d)].
% 0.48/1.04 37 -is_the(c2,c1). [ur(6,a,4,a)].
% 0.48/1.04 62 object(f2(c1,c1,c2,c2)). [resolve(34,d,5,a),unit_del(a,3),unit_del(b,4),unit_del(c,37)].
% 0.48/1.04 63 exemplifies_property(c1,f2(c1,c1,c2,c2)). [resolve(35,d,5,a),unit_del(a,3),unit_del(b,4),unit_del(c,37)].
% 0.48/1.04 64 f2(c1,c1,c2,c2) != c2. [resolve(36,d,5,a),unit_del(a,3),unit_del(b,4),unit_del(c,37)].
% 0.48/1.04 65 $F. [ur(8,a,62,a,c,64,a(flip)),unit_del(a,63)].
% 0.48/1.04
% 0.48/1.04 % SZS output end Refutation
% 0.48/1.04 ============================== end of proof ==========================
% 0.48/1.04
% 0.48/1.04 ============================== STATISTICS ============================
% 0.48/1.04
% 0.48/1.04 Given=36. Generated=91. Kept=60. proofs=1.
% 0.48/1.04 Usable=36. Sos=24. Demods=0. Limbo=0, Disabled=15. Hints=0.
% 0.48/1.04 Megabytes=0.10.
% 0.48/1.04 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.48/1.04
% 0.48/1.04 ============================== end of statistics =====================
% 0.48/1.04
% 0.48/1.04 ============================== end of search =========================
% 0.48/1.04
% 0.48/1.04 THEOREM PROVED
% 0.48/1.04 % SZS status Theorem
% 0.48/1.04
% 0.48/1.04 Exiting with 1 proof.
% 0.48/1.04
% 0.48/1.04 Process 25064 exit (max_proofs) Thu Jun 2 01:32:46 2022
% 0.48/1.04 Prover9 interrupted
%------------------------------------------------------------------------------