TSTP Solution File: PHI014+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PHI014+1 : TPTP v8.1.0. Released v7.2.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 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.06/0.12 % Problem : PHI014+1 : TPTP v8.1.0. Released v7.2.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n019.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:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/0.99 ============================== Prover9 ===============================
% 0.69/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.99 Process 18503 was started by sandbox on n019.cluster.edu,
% 0.69/0.99 Thu Jun 2 01:21:41 2022
% 0.69/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18350_n019.cluster.edu".
% 0.69/0.99 ============================== end of head ===========================
% 0.69/0.99
% 0.69/0.99 ============================== INPUT =================================
% 0.69/0.99
% 0.69/0.99 % Reading from file /tmp/Prover9_18350_n019.cluster.edu
% 0.69/0.99
% 0.69/0.99 set(prolog_style_variables).
% 0.69/0.99 set(auto2).
% 0.69/0.99 % set(auto2) -> set(auto).
% 0.69/0.99 % set(auto) -> set(auto_inference).
% 0.69/0.99 % set(auto) -> set(auto_setup).
% 0.69/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.69/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.99 % set(auto) -> set(auto_limits).
% 0.69/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.99 % set(auto) -> set(auto_denials).
% 0.69/0.99 % set(auto) -> set(auto_process).
% 0.69/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.69/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.69/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.69/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.69/0.99 % set(auto2) -> assign(stats, some).
% 0.69/0.99 % set(auto2) -> clear(echo_input).
% 0.69/0.99 % set(auto2) -> set(quiet).
% 0.69/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.99 % set(auto2) -> clear(print_given).
% 0.69/0.99 assign(lrs_ticks,-1).
% 0.69/0.99 assign(sos_limit,10000).
% 0.69/0.99 assign(order,kbo).
% 0.69/0.99 set(lex_order_vars).
% 0.69/0.99 clear(print_given).
% 0.69/0.99
% 0.69/0.99 % formulas(sos). % not echoed (6 formulas)
% 0.69/0.99
% 0.69/0.99 ============================== end of input ==========================
% 0.69/0.99
% 0.69/0.99 % From the command line: assign(max_seconds, 300).
% 0.69/0.99
% 0.69/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.99
% 0.69/0.99 % Formulas that are not ordinary clauses:
% 0.69/0.99 1 (all F (property(F) -> ((exists Y (object(Y) & is_the(Y,F))) -> (all Z (object(Z) -> (is_the(Z,F) -> exemplifies_property(F,Z))))))) # label(description_theorem_2) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 2 (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 3 (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.69/0.99 4 (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.69/0.99
% 0.69/0.99 ============================== end of process non-clausal formulas ===
% 0.69/0.99
% 0.69/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/0.99
% 0.69/0.99 ============================== PREDICATE ELIMINATION =================
% 0.69/0.99 5 -object(A) | exemplifies_property(none_greater,A) | -exemplifies_property(conceivable,A) | exemplifies_relation(greater_than,f1(A),A) # label(definition_none_greater) # label(axiom). [clausify(3)].
% 0.69/0.99 6 -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(3)].
% 0.69/0.99 7 -object(A) | -is_the(A,none_greater) | exemplifies_property(existence,A) | exemplifies_relation(greater_than,f2(A),A) # label(premise_2) # label(axiom). [clausify(4)].
% 0.69/0.99 Derived: -object(A) | -is_the(A,none_greater) | exemplifies_property(existence,A) | -object(A) | -exemplifies_property(none_greater,A) | -object(f2(A)) | -exemplifies_property(conceivable,f2(A)). [resolve(7,d,6,d)].
% 0.69/0.99 8 -property(A) | -object(B) | -is_the(B,A) | -object(C) | -is_the(C,A) | exemplifies_property(A,C) # label(description_theorem_2) # label(axiom). [clausify(1)].
% 0.69/0.99 9 -is_the(A,B) | property(B) # label(description_is_property_and_described_is_object) # label(axiom). [clausify(2)].
% 0.69/0.99 Derived: -object(A) | -is_the(A,B) | -object(C) | -is_the(C,B) | exemplifies_property(B,C) | -is_the(D,B). [resolve(8,a,9,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: none_greater=1. conceivable=1. existence=1. god=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.01 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.01 (+ 0.00) seconds.
% 0.69/0.99 % Length of proof is 23.
% 0.69/0.99 % Level of proof is 5.
% 0.69/0.99 % Maximum clause weight is 18.000.
% 0.69/0.99 % Given clauses 10.
% 0.69/0.99
% 0.69/0.99 1 (all F (property(F) -> ((exists Y (object(Y) & is_the(Y,F))) -> (all Z (object(Z) -> (is_the(Z,F) -> exemplifies_property(F,Z))))))) # label(description_theorem_2) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.99 2 (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 3 (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.69/0.99 4 (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.69/0.99 6 -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(3)].
% 0.69/0.99 7 -object(A) | -is_the(A,none_greater) | exemplifies_property(existence,A) | exemplifies_relation(greater_than,f2(A),A) # label(premise_2) # label(axiom). [clausify(4)].
% 0.69/0.99 8 -property(A) | -object(B) | -is_the(B,A) | -object(C) | -is_the(C,A) | exemplifies_property(A,C) # label(description_theorem_2) # label(axiom). [clausify(1)].
% 0.69/0.99 9 -is_the(A,B) | property(B) # label(description_is_property_and_described_is_object) # label(axiom). [clausify(2)].
% 0.69/0.99 10 is_the(god,none_greater) # label(definition_god) # label(axiom). [assumption].
% 0.69/0.99 11 -exemplifies_property(existence,god) # label(god_exists) # label(negated_conjecture). [assumption].
% 0.69/0.99 12 -is_the(A,B) | object(A) # label(description_is_property_and_described_is_object) # label(axiom). [clausify(2)].
% 0.69/0.99 15 -object(A) | -is_the(A,none_greater) | exemplifies_property(existence,A) | object(f2(A)) # label(premise_2) # label(axiom). [clausify(4)].
% 0.69/0.99 17 -object(A) | -is_the(A,none_greater) | exemplifies_property(existence,A) | exemplifies_property(conceivable,f2(A)) # label(premise_2) # label(axiom). [clausify(4)].
% 0.69/0.99 18 -object(A) | -is_the(A,none_greater) | exemplifies_property(existence,A) | -object(A) | -exemplifies_property(none_greater,A) | -object(f2(A)) | -exemplifies_property(conceivable,f2(A)). [resolve(7,d,6,d)].
% 0.69/0.99 19 -object(A) | -is_the(A,none_greater) | exemplifies_property(existence,A) | -exemplifies_property(none_greater,A) | -object(f2(A)) | -exemplifies_property(conceivable,f2(A)). [copy(18),merge(d)].
% 0.69/0.99 20 -object(A) | -is_the(A,B) | -object(C) | -is_the(C,B) | exemplifies_property(B,C) | -is_the(D,B). [resolve(8,a,9,b)].
% 0.69/0.99 21 -object(A) | -is_the(A,B) | exemplifies_property(B,A) | -is_the(C,B). [factor(20,a,c),merge(c)].
% 0.69/0.99 22 -object(A) | -is_the(A,B) | exemplifies_property(B,A). [factor(21,b,d)].
% 0.69/0.99 23 object(god). [resolve(12,a,10,a)].
% 0.69/0.99 24 object(f2(god)). [resolve(15,b,10,a),unit_del(a,23),unit_del(b,11)].
% 0.69/0.99 25 exemplifies_property(conceivable,f2(god)). [resolve(17,b,10,a),unit_del(a,23),unit_del(b,11)].
% 0.69/0.99 26 -exemplifies_property(none_greater,god). [resolve(19,b,10,a),unit_del(a,23),unit_del(b,11),unit_del(d,24),unit_del(e,25)].
% 0.69/0.99 27 $F. [resolve(22,b,10,a),unit_del(a,23),unit_del(b,26)].
% 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=10. Generated=20. Kept=16. proofs=1.
% 0.69/0.99 Usable=10. Sos=4. Demods=0. Limbo=0, Disabled=17. Hints=0.
% 0.69/0.99 Megabytes=0.05.
% 0.69/0.99 User_CPU=0.01, 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 18503 exit (max_proofs) Thu Jun 2 01:21:41 2022
% 0.69/0.99 Prover9 interrupted
%------------------------------------------------------------------------------