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