TSTP Solution File: PHI015+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PHI015+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.82s 1.14s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PHI015+1 : TPTP v8.1.0. Released v7.2.0.
% 0.12/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n029.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:21:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/0.98 ============================== Prover9 ===============================
% 0.42/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.98 Process 29332 was started by sandbox2 on n029.cluster.edu,
% 0.42/0.98 Thu Jun 2 01:21:31 2022
% 0.42/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_29179_n029.cluster.edu".
% 0.42/0.98 ============================== end of head ===========================
% 0.42/0.98
% 0.42/0.98 ============================== INPUT =================================
% 0.42/0.98
% 0.42/0.98 % Reading from file /tmp/Prover9_29179_n029.cluster.edu
% 0.42/0.98
% 0.42/0.98 set(prolog_style_variables).
% 0.42/0.98 set(auto2).
% 0.42/0.98 % set(auto2) -> set(auto).
% 0.42/0.98 % set(auto) -> set(auto_inference).
% 0.42/0.98 % set(auto) -> set(auto_setup).
% 0.42/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.98 % set(auto) -> set(auto_limits).
% 0.42/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.98 % set(auto) -> set(auto_denials).
% 0.42/0.98 % set(auto) -> set(auto_process).
% 0.42/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.98 % set(auto2) -> assign(stats, some).
% 0.42/0.98 % set(auto2) -> clear(echo_input).
% 0.42/0.98 % set(auto2) -> set(quiet).
% 0.42/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.98 % set(auto2) -> clear(print_given).
% 0.42/0.98 assign(lrs_ticks,-1).
% 0.42/0.98 assign(sos_limit,10000).
% 0.42/0.98 assign(order,kbo).
% 0.42/0.98 set(lex_order_vars).
% 0.42/0.98 clear(print_given).
% 0.42/0.98
% 0.42/0.98 % formulas(sos). % not echoed (11 formulas)
% 0.42/0.98
% 0.42/0.98 ============================== end of input ==========================
% 0.42/0.98
% 0.42/0.98 % From the command line: assign(max_seconds, 300).
% 0.42/0.98
% 0.42/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.98
% 0.42/0.98 % Formulas that are not ordinary clauses:
% 0.42/0.98 1 (all X (object(X) -> -property(X))) # label(objects_are_not_properties) # label(axiom) # label(non_clause). [assumption].
% 0.42/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.42/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.42/0.98 4 (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.42/0.98 5 (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.42/0.98 6 (all X all Y (object(X) & object(Y) -> exemplifies_relation(greater_than,X,Y) | exemplifies_relation(greater_than,Y,X) | X = Y)) # label(connectedness_of_greater_than) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 7 (all X (object(X) -> (exemplifies_property(none_greater,X) <-> exemplifies_property(conceivable,X) & -(exists Y (object(Y) & exemplifies_relation(greater_than,Y,X) & exemplifies_property(conceivable,Y)))))) # label(definition_none_greater) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 8 (exists X (object(X) & exemplifies_property(none_greater,X))) # label(premise_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 9 (all X (object(X) -> (is_the(X,none_greater) & -exemplifies_property(existence,X) -> (exists Y (object(Y) & exemplifies_relation(greater_than,Y,X) & exemplifies_property(conceivable,Y)))))) # label(premise_2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.14
% 0.82/1.14 ============================== end of process non-clausal formulas ===
% 0.82/1.14
% 0.82/1.14 ============================== PROCESS INITIAL CLAUSES ===============
% 0.82/1.14
% 0.82/1.14 ============================== PREDICATE ELIMINATION =================
% 0.82/1.14
% 0.82/1.14 ============================== end predicate elimination =============
% 0.82/1.14
% 0.82/1.14 Auto_denials: (non-Horn, no changes).
% 0.82/1.14
% 0.82/1.14 Term ordering decisions:
% 0.82/1.14 Function symbol KB weights: none_greater=1. conceivable=1. greater_than=1. existence=1. god=1. c1=1. f5=1. f6=1. f1=1. f3=1. f2=1. f4=1.
% 0.82/1.14
% 0.82/1.14 ============================== end of process initial clauses ========
% 0.82/1.14
% 0.82/1.14 ============================== CLAUSES FOR SEARCH ====================
% 0.82/1.14
% 0.82/1.14 ============================== end of clauses for search =============
% 0.82/1.14
% 0.82/1.14 ============================== SEARCH ================================
% 0.82/1.14
% 0.82/1.14 % Starting search at 0.02 seconds.
% 0.82/1.14
% 0.82/1.14 ============================== PROOF =================================
% 0.82/1.14 % SZS status Theorem
% 0.82/1.14 % SZS output start Refutation
% 0.82/1.14
% 0.82/1.14 % Proof 1 at 0.17 (+ 0.00) seconds.
% 0.82/1.14 % Length of proof is 29.
% 0.82/1.14 % Level of proof is 6.
% 0.82/1.14 % Maximum clause weight is 18.000.
% 0.82/1.14 % Given clauses 91.
% 0.82/1.14
% 0.82/1.14 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.82/1.14 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.82/1.14 5 (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.82/1.14 7 (all X (object(X) -> (exemplifies_property(none_greater,X) <-> exemplifies_property(conceivable,X) & -(exists Y (object(Y) & exemplifies_relation(greater_than,Y,X) & exemplifies_property(conceivable,Y)))))) # label(definition_none_greater) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.14 8 (exists X (object(X) & exemplifies_property(none_greater,X))) # label(premise_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.14 9 (all X (object(X) -> (is_the(X,none_greater) & -exemplifies_property(existence,X) -> (exists Y (object(Y) & exemplifies_relation(greater_than,Y,X) & exemplifies_property(conceivable,Y)))))) # label(premise_2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.14 11 exemplifies_property(none_greater,c1) # label(premise_1) # label(axiom). [clausify(8)].
% 0.82/1.14 12 is_the(god,none_greater) # label(definition_god) # label(axiom). [assumption].
% 0.82/1.14 13 -exemplifies_property(existence,god) # label(god_exists) # label(negated_conjecture). [assumption].
% 0.82/1.14 15 -object(A) | -exemplifies_property(none_greater,A) | -object(B) | -exemplifies_relation(greater_than,B,A) | -exemplifies_property(conceivable,B) # label(definition_none_greater) # label(axiom). [clausify(7)].
% 0.82/1.14 16 -exemplifies_property(A,B) | property(A) # label(exemplifier_is_object_and_exemplified_is_property) # label(axiom). [clausify(2)].
% 0.82/1.14 19 -is_the(A,B) | object(A) # label(description_is_property_and_described_is_object) # label(axiom). [clausify(3)].
% 0.82/1.14 22 -object(A) | -is_the(A,none_greater) | exemplifies_property(existence,A) | object(f6(A)) # label(premise_2) # label(axiom). [clausify(9)].
% 0.82/1.14 24 -object(A) | -is_the(A,none_greater) | exemplifies_property(existence,A) | exemplifies_property(conceivable,f6(A)) # label(premise_2) # label(axiom). [clausify(9)].
% 0.82/1.14 26 -object(A) | -is_the(A,none_greater) | exemplifies_property(existence,A) | exemplifies_relation(greater_than,f6(A),A) # label(premise_2) # label(axiom). [clausify(9)].
% 0.82/1.14 32 -property(A) | -object(B) | -object(C) | -is_the(B,A) | C != B | exemplifies_property(A,f3(A,B,C)) # label(description_axiom_identity_instance) # label(axiom). [clausify(5)].
% 0.82/1.14 33 -property(A) | -object(B) | -object(C) | -is_the(B,A) | C != B | C = f3(A,B,C) # label(description_axiom_identity_instance) # label(axiom). [clausify(5)].
% 0.82/1.14 34 -property(A) | -object(B) | -object(C) | -is_the(B,A) | C != B | f3(A,B,C) = C. [copy(33),flip(f)].
% 0.82/1.14 55 -property(A) | -object(B) | -is_the(B,A) | exemplifies_property(A,f3(A,B,B)). [factor(32,b,c),xx(d)].
% 0.82/1.14 56 -property(A) | -object(B) | -is_the(B,A) | f3(A,B,B) = B. [factor(34,b,c),xx(d)].
% 0.82/1.14 90 property(none_greater). [resolve(16,a,11,a)].
% 0.82/1.14 91 object(god). [resolve(19,a,12,a)].
% 0.82/1.14 93 object(f6(god)). [resolve(22,b,12,a),unit_del(a,91),unit_del(b,13)].
% 0.82/1.14 94 exemplifies_property(conceivable,f6(god)). [resolve(24,b,12,a),unit_del(a,91),unit_del(b,13)].
% 0.82/1.14 95 exemplifies_relation(greater_than,f6(god),god). [resolve(26,b,12,a),unit_del(a,91),unit_del(b,13)].
% 0.82/1.14 130 exemplifies_property(none_greater,f3(none_greater,god,god)). [resolve(55,c,12,a),unit_del(a,90),unit_del(b,91)].
% 0.82/1.14 131 f3(none_greater,god,god) = god. [resolve(56,c,12,a),unit_del(a,90),unit_del(b,91)].
% 0.82/1.14 132 exemplifies_property(none_greater,god). [back_rewrite(130),rewrite([131(5)])].
% 0.82/1.14 419 $F. [ur(15,a,91,a,b,132,a,c,93,a,e,94,a),unit_del(a,95)].
% 0.82/1.14
% 0.82/1.14 % SZS output end Refutation
% 0.82/1.14 ============================== end of proof ==========================
% 0.82/1.14
% 0.82/1.14 ============================== STATISTICS ============================
% 0.82/1.14
% 0.82/1.14 Given=91. Generated=541. Kept=406. proofs=1.
% 0.82/1.14 Usable=91. Sos=209. Demods=2. Limbo=51, Disabled=93. Hints=0.
% 0.82/1.14 Megabytes=0.48.
% 0.82/1.14 User_CPU=0.17, System_CPU=0.00, Wall_clock=1.
% 0.82/1.14
% 0.82/1.14 ============================== end of statistics =====================
% 0.82/1.14
% 0.82/1.14 ============================== end of search =========================
% 0.82/1.14
% 0.82/1.14 THEOREM PROVED
% 0.82/1.14 % SZS status Theorem
% 0.82/1.14
% 0.82/1.14 Exiting with 1 proof.
% 0.82/1.14
% 0.82/1.14 Process 29332 exit (max_proofs) Thu Jun 2 01:21:32 2022
% 0.82/1.14 Prover9 interrupted
%------------------------------------------------------------------------------