TSTP Solution File: MSC004-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MSC004-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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 : Sun Jul 17 22:56:30 EDT 2022
% Result : Unsatisfiable 0.73s 1.01s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : MSC004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.35 % Computer : n026.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 : Fri Jul 1 16:23:19 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.73/1.01 ============================== Prover9 ===============================
% 0.73/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.01 Process 26204 was started by sandbox on n026.cluster.edu,
% 0.73/1.01 Fri Jul 1 16:23:20 2022
% 0.73/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26051_n026.cluster.edu".
% 0.73/1.01 ============================== end of head ===========================
% 0.73/1.01
% 0.73/1.01 ============================== INPUT =================================
% 0.73/1.01
% 0.73/1.01 % Reading from file /tmp/Prover9_26051_n026.cluster.edu
% 0.73/1.01
% 0.73/1.01 set(prolog_style_variables).
% 0.73/1.01 set(auto2).
% 0.73/1.01 % set(auto2) -> set(auto).
% 0.73/1.01 % set(auto) -> set(auto_inference).
% 0.73/1.01 % set(auto) -> set(auto_setup).
% 0.73/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.01 % set(auto) -> set(auto_limits).
% 0.73/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.01 % set(auto) -> set(auto_denials).
% 0.73/1.01 % set(auto) -> set(auto_process).
% 0.73/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.01 % set(auto2) -> assign(stats, some).
% 0.73/1.01 % set(auto2) -> clear(echo_input).
% 0.73/1.01 % set(auto2) -> set(quiet).
% 0.73/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.01 % set(auto2) -> clear(print_given).
% 0.73/1.01 assign(lrs_ticks,-1).
% 0.73/1.01 assign(sos_limit,10000).
% 0.73/1.01 assign(order,kbo).
% 0.73/1.01 set(lex_order_vars).
% 0.73/1.01 clear(print_given).
% 0.73/1.01
% 0.73/1.01 % formulas(sos). % not echoed (8 formulas)
% 0.73/1.01
% 0.73/1.01 ============================== end of input ==========================
% 0.73/1.01
% 0.73/1.01 % From the command line: assign(max_seconds, 300).
% 0.73/1.01
% 0.73/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.01
% 0.73/1.01 % Formulas that are not ordinary clauses:
% 0.73/1.01
% 0.73/1.01 ============================== end of process non-clausal formulas ===
% 0.73/1.01
% 0.73/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.01
% 0.73/1.01 ============================== PREDICATE ELIMINATION =================
% 0.73/1.01
% 0.73/1.01 ============================== end predicate elimination =============
% 0.73/1.01
% 0.73/1.01 Auto_denials: (non-Horn, no changes).
% 0.73/1.01
% 0.73/1.01 Term ordering decisions:
% 0.73/1.01 Function symbol KB weights: arm=1. boy=1. hand=1. human=1. fingers=1. john=1. n1=1. n2=1. n5=1. times=1. object_in=1.
% 0.73/1.01
% 0.73/1.01 ============================== end of process initial clauses ========
% 0.73/1.01
% 0.73/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.01
% 0.73/1.01 ============================== end of clauses for search =============
% 0.73/1.01
% 0.73/1.01 ============================== SEARCH ================================
% 0.73/1.01
% 0.73/1.01 % Starting search at 0.01 seconds.
% 0.73/1.01
% 0.73/1.01 ============================== PROOF =================================
% 0.73/1.01 % SZS status Unsatisfiable
% 0.73/1.01 % SZS output start Refutation
% 0.73/1.01
% 0.73/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.73/1.01 % Length of proof is 21.
% 0.73/1.01 % Level of proof is 13.
% 0.73/1.01 % Maximum clause weight is 26.000.
% 0.73/1.01 % Given clauses 26.
% 0.73/1.01
% 0.73/1.01 1 in(john,boy) # label(john_is_a_boy) # label(hypothesis). [assumption].
% 0.73/1.01 2 -has_parts(john,times(times(n2,n1),n5),fingers) # label(prove_john_has_10_fingers) # label(negated_conjecture). [assumption].
% 0.73/1.01 3 in(A,human) | -in(A,boy) # label(in_boy_in_human) # label(hypothesis). [assumption].
% 0.73/1.01 4 has_parts(A,n5,fingers) | -in(A,hand) # label(hands_have_5_fingers) # label(hypothesis). [assumption].
% 0.73/1.01 5 has_parts(A,n2,arm) | -in(A,human) # label(humans_have_two_arms) # label(hypothesis). [assumption].
% 0.73/1.01 6 has_parts(A,n1,hand) | -in(A,arm) # label(arms_have_one_hand) # label(hypothesis). [assumption].
% 0.73/1.01 7 in(object_in(A,B,C,D,E),B) | has_parts(A,times(D,E),C) | -has_parts(A,D,B) # label(not_part_inheritance) # label(axiom). [assumption].
% 0.73/1.01 8 has_parts(A,times(B,C),D) | -has_parts(A,B,E) | -has_parts(object_in(A,E,D,B,C),C,D) # label(part_inheritance) # label(axiom). [assumption].
% 0.73/1.01 9 in(john,human). [resolve(3,b,1,a)].
% 0.73/1.01 10 has_parts(john,n2,arm). [resolve(9,a,5,b)].
% 0.73/1.01 11 in(object_in(john,arm,A,n2,B),arm) | has_parts(john,times(n2,B),A). [resolve(10,a,7,c)].
% 0.73/1.01 12 in(object_in(john,arm,A,n2,B),arm) | in(object_in(john,A,C,times(n2,B),D),A) | has_parts(john,times(times(n2,B),D),C). [resolve(11,b,7,c)].
% 0.73/1.01 14 in(object_in(john,arm,A,n2,n1),arm) | in(object_in(john,A,fingers,times(n2,n1),n5),A). [resolve(12,c,2,a)].
% 0.73/1.01 17 in(object_in(john,arm,hand,n2,n1),arm) | has_parts(object_in(john,hand,fingers,times(n2,n1),n5),n5,fingers). [resolve(14,b,4,b)].
% 0.73/1.01 23 in(object_in(john,arm,hand,n2,n1),arm) | -has_parts(john,times(n2,n1),hand). [resolve(17,b,8,c),unit_del(b,2)].
% 0.73/1.01 26 in(object_in(john,arm,hand,n2,n1),arm). [resolve(23,b,11,b),merge(b)].
% 0.73/1.01 27 has_parts(object_in(john,arm,hand,n2,n1),n1,hand). [resolve(26,a,6,b)].
% 0.73/1.01 28 has_parts(john,times(n2,n1),hand). [resolve(27,a,8,c),unit_del(b,10)].
% 0.73/1.01 31 -has_parts(object_in(john,hand,fingers,times(n2,n1),n5),n5,fingers). [ur(8,a,2,a,b,28,a)].
% 0.73/1.01 33 -in(object_in(john,hand,fingers,times(n2,n1),n5),hand). [ur(4,a,31,a)].
% 0.73/1.01 34 $F. [ur(7,a,33,a,b,2,a),unit_del(a,28)].
% 0.73/1.01
% 0.73/1.01 % SZS output end Refutation
% 0.73/1.01 ============================== end of proof ==========================
% 0.73/1.01
% 0.73/1.01 ============================== STATISTICS ============================
% 0.73/1.01
% 0.73/1.01 Given=26. Generated=35. Kept=33. proofs=1.
% 0.73/1.01 Usable=24. Sos=6. Demods=0. Limbo=0, Disabled=11. Hints=0.
% 0.73/1.01 Megabytes=0.08.
% 0.73/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.73/1.01
% 0.73/1.01 ============================== end of statistics =====================
% 0.73/1.01
% 0.73/1.01 ============================== end of search =========================
% 0.73/1.01
% 0.73/1.01 THEOREM PROVED
% 0.73/1.01 % SZS status Unsatisfiable
% 0.73/1.01
% 0.73/1.01 Exiting with 1 proof.
% 0.73/1.01
% 0.73/1.01 Process 26204 exit (max_proofs) Fri Jul 1 16:23:20 2022
% 0.73/1.01 Prover9 interrupted
%------------------------------------------------------------------------------