TSTP Solution File: CSR147+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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 : Fri Jul 15 23:07:28 EDT 2022
% Result : Theorem 0.76s 1.02s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n024.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 : Fri Jun 10 07:01:49 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.76/1.02 ============================== Prover9 ===============================
% 0.76/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.02 Process 17592 was started by sandbox on n024.cluster.edu,
% 0.76/1.02 Fri Jun 10 07:01:50 2022
% 0.76/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17439_n024.cluster.edu".
% 0.76/1.02 ============================== end of head ===========================
% 0.76/1.02
% 0.76/1.02 ============================== INPUT =================================
% 0.76/1.02
% 0.76/1.02 % Reading from file /tmp/Prover9_17439_n024.cluster.edu
% 0.76/1.02
% 0.76/1.02 set(prolog_style_variables).
% 0.76/1.02 set(auto2).
% 0.76/1.02 % set(auto2) -> set(auto).
% 0.76/1.02 % set(auto) -> set(auto_inference).
% 0.76/1.02 % set(auto) -> set(auto_setup).
% 0.76/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.02 % set(auto) -> set(auto_limits).
% 0.76/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.02 % set(auto) -> set(auto_denials).
% 0.76/1.02 % set(auto) -> set(auto_process).
% 0.76/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.02 % set(auto2) -> assign(stats, some).
% 0.76/1.02 % set(auto2) -> clear(echo_input).
% 0.76/1.02 % set(auto2) -> set(quiet).
% 0.76/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.02 % set(auto2) -> clear(print_given).
% 0.76/1.02 assign(lrs_ticks,-1).
% 0.76/1.02 assign(sos_limit,10000).
% 0.76/1.02 assign(order,kbo).
% 0.76/1.02 set(lex_order_vars).
% 0.76/1.02 clear(print_given).
% 0.76/1.02
% 0.76/1.02 % formulas(sos). % not echoed (14 formulas)
% 0.76/1.02
% 0.76/1.02 ============================== end of input ==========================
% 0.76/1.02
% 0.76/1.02 % From the command line: assign(max_seconds, 300).
% 0.76/1.02
% 0.76/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.02
% 0.76/1.02 % Formulas that are not ordinary clauses:
% 0.76/1.02 1 (exists A s__Human(A)) # label(human_type) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 2 (exists A s__LivingThing(A)) # label(living_type) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 3 (all A (s__Human(A) -> s__LivingThing(A))) # label(humans_are_living) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 4 (all A (s__Human(A) -> s__Human(s__siblingFn(A)))) # label(sibling_type) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 5 (all O all OAge all YAge (s__Human(O) -> (s__age(O,OAge) & s__age(s__siblingFn(O),YAge) & greater(OAge,YAge) -> s__more_experienced(O,s__siblingFn(O)) | s__has_seen_more(s__siblingFn(O),O)))) # label(experience) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 6 (all X all Y (s__Human(X) & s__Human(Y) -> (X = s__siblingFn(Y) -> Y = s__siblingFn(X)))) # label(sibling_symmetry) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02
% 0.76/1.02 ============================== end of process non-clausal formulas ===
% 0.76/1.02
% 0.76/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.02
% 0.76/1.02 ============================== PREDICATE ELIMINATION =================
% 0.76/1.02 7 -s__Human(A) | -s__age(A,B) | -s__age(s__siblingFn(A),C) | -greater(B,C) | s__more_experienced(A,s__siblingFn(A)) | s__has_seen_more(s__siblingFn(A),A) # label(experience) # label(axiom). [clausify(5)].
% 0.76/1.02 8 greater(n54,n48) # label(greater_54_48) # label(axiom). [assumption].
% 0.76/1.02 Derived: -s__Human(A) | -s__age(A,n54) | -s__age(s__siblingFn(A),n48) | s__more_experienced(A,s__siblingFn(A)) | s__has_seen_more(s__siblingFn(A),A). [resolve(7,d,8,a)].
% 0.76/1.02
% 0.76/1.02 ============================== end predicate elimination =============
% 0.76/1.02
% 0.76/1.02 Auto_denials: (non-Horn, no changes).
% 0.76/1.02
% 0.76/1.02 Term ordering decisions:
% 0.76/1.02
% 0.76/1.02 % Assigning unary symbol s__siblingFn kb_weight 0 and highest precedence (11).
% 0.76/1.02 Function symbol KB weights: geoff=1. jim=1. n48=1. n54=1. c1=1. s__siblingFn=0.
% 0.76/1.02
% 0.76/1.02 ============================== end of process initial clauses ========
% 0.76/1.02
% 0.76/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.02
% 0.76/1.02 ============================== end of clauses for search =============
% 0.76/1.02
% 0.76/1.02 ============================== SEARCH ================================
% 0.76/1.02
% 0.76/1.02 % Starting search at 0.01 seconds.
% 0.76/1.02
% 0.76/1.02 ============================== PROOF =================================
% 0.76/1.02 % SZS status Theorem
% 0.76/1.02 % SZS output start Refutation
% 0.76/1.02
% 0.76/1.02 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.76/1.02 % Length of proof is 14.
% 0.76/1.02 % Level of proof is 3.
% 0.76/1.02 % Maximum clause weight is 17.000.
% 0.76/1.02 % Given clauses 9.
% 0.76/1.02
% 0.76/1.02 5 (all O all OAge all YAge (s__Human(O) -> (s__age(O,OAge) & s__age(s__siblingFn(O),YAge) & greater(OAge,YAge) -> s__more_experienced(O,s__siblingFn(O)) | s__has_seen_more(s__siblingFn(O),O)))) # label(experience) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.02 7 -s__Human(A) | -s__age(A,B) | -s__age(s__siblingFn(A),C) | -greater(B,C) | s__more_experienced(A,s__siblingFn(A)) | s__has_seen_more(s__siblingFn(A),A) # label(experience) # label(axiom). [clausify(5)].
% 0.76/1.02 8 greater(n54,n48) # label(greater_54_48) # label(axiom). [assumption].
% 0.76/1.02 11 s__Human(jim) # label(jim_human) # label(axiom). [assumption].
% 0.76/1.02 12 s__age(geoff,n48) # label(geoff_48) # label(axiom). [assumption].
% 0.76/1.02 13 s__age(jim,n54) # label(jim_54) # label(axiom). [assumption].
% 0.76/1.02 14 geoff = s__siblingFn(jim) # label(geoff_and_jim) # label(axiom). [assumption].
% 0.76/1.02 15 -s__has_seen_more(geoff,jim) # label(jim_has_seen_more) # label(axiom). [assumption].
% 0.76/1.02 16 -s__has_seen_more(s__siblingFn(jim),jim). [copy(15),rewrite([14(1)])].
% 0.76/1.02 17 -s__more_experienced(jim,geoff) # label(jim_is_experienced) # label(negated_conjecture). [assumption].
% 0.76/1.02 18 -s__more_experienced(jim,s__siblingFn(jim)). [copy(17),rewrite([14(2)])].
% 0.76/1.02 21 -s__Human(A) | -s__age(A,n54) | -s__age(s__siblingFn(A),n48) | s__more_experienced(A,s__siblingFn(A)) | s__has_seen_more(s__siblingFn(A),A). [resolve(7,d,8,a)].
% 0.76/1.02 22 s__age(s__siblingFn(jim),n48). [back_rewrite(12),rewrite([14(1)])].
% 0.76/1.02 29 $F. [ur(21,a,11,a,b,13,a,d,18,a,e,16,a),unit_del(a,22)].
% 0.76/1.02
% 0.76/1.02 % SZS output end Refutation
% 0.76/1.02 ============================== end of proof ==========================
% 0.76/1.02
% 0.76/1.02 ============================== STATISTICS ============================
% 0.76/1.02
% 0.76/1.02 Given=9. Generated=22. Kept=18. proofs=1.
% 0.76/1.02 Usable=9. Sos=7. Demods=1. Limbo=0, Disabled=17. Hints=0.
% 0.76/1.02 Megabytes=0.05.
% 0.76/1.02 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.76/1.02
% 0.76/1.02 ============================== end of statistics =====================
% 0.76/1.02
% 0.76/1.02 ============================== end of search =========================
% 0.76/1.02
% 0.76/1.02 THEOREM PROVED
% 0.76/1.02 % SZS status Theorem
% 0.76/1.02
% 0.76/1.02 Exiting with 1 proof.
% 0.76/1.02
% 0.76/1.02 Process 17592 exit (max_proofs) Fri Jun 10 07:01:50 2022
% 0.76/1.02 Prover9 interrupted
%------------------------------------------------------------------------------