TSTP Solution File: NLP224-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP224-1 : TPTP v8.1.0. Released v2.4.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 : Mon Jul 18 05:08:03 EDT 2022
% Result : Unknown 0.49s 1.15s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NLP224-1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.36 % Computer : n026.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Thu Jun 30 19:10:04 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.49/1.11 ============================== Prover9 ===============================
% 0.49/1.11 Prover9 (32) version 2009-11A, November 2009.
% 0.49/1.11 Process 9846 was started by sandbox2 on n026.cluster.edu,
% 0.49/1.11 Thu Jun 30 19:10:05 2022
% 0.49/1.11 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9693_n026.cluster.edu".
% 0.49/1.11 ============================== end of head ===========================
% 0.49/1.11
% 0.49/1.11 ============================== INPUT =================================
% 0.49/1.11
% 0.49/1.11 % Reading from file /tmp/Prover9_9693_n026.cluster.edu
% 0.49/1.11
% 0.49/1.11 set(prolog_style_variables).
% 0.49/1.11 set(auto2).
% 0.49/1.11 % set(auto2) -> set(auto).
% 0.49/1.11 % set(auto) -> set(auto_inference).
% 0.49/1.11 % set(auto) -> set(auto_setup).
% 0.49/1.11 % set(auto_setup) -> set(predicate_elim).
% 0.49/1.11 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/1.11 % set(auto) -> set(auto_limits).
% 0.49/1.11 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/1.11 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/1.11 % set(auto) -> set(auto_denials).
% 0.49/1.11 % set(auto) -> set(auto_process).
% 0.49/1.11 % set(auto2) -> assign(new_constants, 1).
% 0.49/1.11 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/1.11 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/1.11 % set(auto2) -> assign(max_hours, 1).
% 0.49/1.11 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/1.11 % set(auto2) -> assign(max_seconds, 0).
% 0.49/1.11 % set(auto2) -> assign(max_minutes, 5).
% 0.49/1.11 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/1.11 % set(auto2) -> set(sort_initial_sos).
% 0.49/1.11 % set(auto2) -> assign(sos_limit, -1).
% 0.49/1.11 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/1.11 % set(auto2) -> assign(max_megs, 400).
% 0.49/1.11 % set(auto2) -> assign(stats, some).
% 0.49/1.11 % set(auto2) -> clear(echo_input).
% 0.49/1.11 % set(auto2) -> set(quiet).
% 0.49/1.11 % set(auto2) -> clear(print_initial_clauses).
% 0.49/1.11 % set(auto2) -> clear(print_given).
% 0.49/1.11 assign(lrs_ticks,-1).
% 0.49/1.11 assign(sos_limit,10000).
% 0.49/1.11 assign(order,kbo).
% 0.49/1.11 set(lex_order_vars).
% 0.49/1.11 clear(print_given).
% 0.49/1.11
% 0.49/1.11 % formulas(sos). % not echoed (94 formulas)
% 0.49/1.11
% 0.49/1.11 ============================== end of input ==========================
% 0.49/1.11
% 0.49/1.11 % From the command line: assign(max_seconds, 300).
% 0.49/1.11
% 0.49/1.11 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/1.11
% 0.49/1.11 % Formulas that are not ordinary clauses:
% 0.49/1.11
% 0.49/1.11 ============================== end of process non-clausal formulas ===
% 0.49/1.11
% 0.49/1.11 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/1.11
% 0.49/1.11 ============================== PREDICATE ELIMINATION =================
% 0.49/1.11 1 -accessible_world(A,B) | -state(A,C) | state(B,C) # label(clause36) # label(axiom). [assumption].
% 0.49/1.11 2 accessible_world(skc9,skc14) # label(clause84) # label(negated_conjecture). [assumption].
% 0.49/1.11 Derived: -state(skc9,A) | state(skc14,A). [resolve(1,a,2,a)].
% 0.49/1.11 3 -accessible_world(A,B) | -eventuality(A,C) | eventuality(B,C) # label(clause37) # label(axiom). [assumption].
% 0.49/1.11 Derived: -eventuality(skc9,A) | eventuality(skc14,A). [resolve(3,a,2,a)].
% 0.49/1.11 4 -accessible_world(A,B) | -thing(A,C) | thing(B,C) # label(clause38) # label(axiom). [assumption].
% 0.49/1.11 Derived: -thing(skc9,A) | thing(skc14,A). [resolve(4,a,2,a)].
% 0.49/1.11 5 -accessible_world(A,B) | -singleton(A,C) | singleton(B,C) # label(clause39) # label(axiom). [assumption].
% 0.49/1.11 Derived: -singleton(skc9,A) | singleton(skc14,A). [resolve(5,a,2,a)].
% 0.49/1.11 6 -accessible_world(A,B) | -specific(A,C) | specific(B,C) # label(clause40) # label(axiom). [assumption].
% 0.49/1.11 Derived: -specific(skc9,A) | specific(skc14,A). [resolve(6,a,2,a)].
% 0.49/1.11 7 -accessible_world(A,B) | -nonexistent(A,C) | nonexistent(B,C) # label(clause41) # label(axiom). [assumption].
% 0.49/1.11 Derived: -nonexistent(skc9,A) | nonexistent(skc14,A). [resolve(7,a,2,a)].
% 0.49/1.11 8 -accessible_world(A,B) | -unisex(A,C) | unisex(B,C) # label(clause42) # label(axiom). [assumption].
% 0.49/1.11 Derived: -unisex(skc9,A) | unisex(skc14,A). [resolve(8,a,2,a)].
% 0.49/1.11 9 -accessible_world(A,B) | -event(A,C) | event(B,C) # label(clause43) # label(axiom). [assumption].
% 0.49/1.11 Derived: -event(skc9,A) | event(skc14,A). [resolve(9,a,2,a)].
% 0.49/1.11 10 -accessible_world(A,B) | -man(A,C) | man(B,C) # label(clause44) # label(axiom). [assumption].
% 0.49/1.11 Derived: -man(skc9,A) | man(skc14,A). [resolve(10,a,2,a)].
% 0.49/1.11 11 -accessible_world(A,B) | -human_person(A,C) | human_person(B,C) # label(clause45) # label(axiom). [assumption].
% 0.49/1.11 Derived: -human_person(skc9,A) | human_person(skc14,A). [resolve(11,a,2,a)].
% 0.49/1.11 12 -accessible_world(A,B) | -organism(A,C) | organism(B,C) # label(clause46) # label(axiom). [assumption].
% 0.49/1.11 Derived: -organism(skc9,A) | organism(skc14,A). [resolve(12,a,2,a)].
% 0.49/1.11 13 -accessible_world(A,B) | -entity(A,C) | entity(B,C) # label(clause47) # label(axiom). [assumption].
% 0.49/1.11 Derived: -entity(skc9,A) | entity(skc14,A). [resolve(13,a,2,a)].
% 0.49/1.11 14 -accessible_world(A,B) | -existent(A,C) | existent(B,C) # label(clause48) # label(axiom). [assumption].
% 0.49/1.11 Derived: -existent(skc9,A) | existent(skc14,A). [resolve(14,a,2,a)].
% 0.49/1.11 15 -accessible_world(A,B) | -impartial(A,C) | impartial(B,C) # label(clause49) # label(axiom). [assumption].
% 0.49/1.11 Derived: -impartial(skc9,A) | impartial(skc14,A). [resolve(15,a,2,a)].
% 0.49/1.11 16 -accessible_world(A,B) | -living(A,C) | living(B,C) # label(clause50) # label(axiom). [assumption].
% 0.49/1.11 Derived: -living(skc9,A) | living(skc14,A). [resolve(16,a,2,a)].
% 0.49/1.11 17 -accessible_world(A,B) | -human(A,C) | human(B,C) # label(clause51) # label(axiom). [assumption].
% 0.49/1.11 Derived: -human(skc9,A) | human(skc14,A). [resolve(17,a,2,a)].
% 0.49/1.11 18 -accessible_world(A,B) | -animate(A,C) | animate(B,C) # label(clause52) # label(axiom). [assumption].
% 0.49/1.11 Derived: -animate(skc9,A) | animate(skc14,A). [resolve(18,a,2,a)].
% 0.49/1.11 19 -accessible_world(A,B) | -male(A,C) | male(B,C) # label(clause53) # label(axiom). [assumption].
% 0.49/1.11 Derived: -male(skc9,A) | male(skc14,A). [resolve(19,a,2,a)].
% 0.49/1.11 20 -accessible_world(A,B) | -forename(A,C) | forename(B,C) # label(clause54) # label(axiom). [assumption].
% 0.49/1.11 Derived: -forename(skc9,A) | forename(skc14,A). [resolve(20,a,2,a)].
% 0.49/1.11 21 -accessible_world(A,B) | -relname(A,C) | relname(B,C) # label(clause55) # label(axiom). [assumption].
% 0.49/1.11 Derived: -relname(skc9,A) | relname(skc14,A). [resolve(21,a,2,a)].
% 0.49/1.11 22 -accessible_world(A,B) | -relation(A,C) | relation(B,C) # label(clause56) # label(axiom). [assumption].
% 0.49/1.11 Derived: -relation(skc9,A) | relation(skc14,A). [resolve(22,a,2,a)].
% 0.49/1.11 23 -accessible_world(A,B) | -abstraction(A,C) | abstraction(B,C) # label(clause57) # label(axiom). [assumption].
% 0.49/1.11 Derived: -abstraction(skc9,A) | abstraction(skc14,A). [resolve(23,a,2,a)].
% 0.49/1.11 24 -accessible_world(A,B) | -nonhuman(A,C) | nonhuman(B,C) # label(clause58) # label(axiom). [assumption].
% 0.49/1.11 Derived: -nonhuman(skc9,A) | nonhuman(skc14,A). [resolve(24,a,2,a)].
% 0.49/1.11 25 -accessible_world(A,B) | -general(A,C) | general(B,C) # label(clause59) # label(axiom). [assumption].
% 0.49/1.11 Derived: -general(skc9,A) | general(skc14,A). [resolve(25,a,2,a)].
% 0.49/1.11 26 -accessible_world(A,B) | -jules_forename(A,C) | jules_forename(B,C) # label(clause60) # label(axiom). [assumption].
% 0.49/1.11 Derived: -jules_forename(skc9,A) | jules_forename(skc14,A). [resolve(26,a,2,a)].
% 0.49/1.11 27 -accessible_world(A,B) | -smoke(A,C) | smoke(B,C) # label(clause61) # label(axiom). [assumption].
% 0.49/1.11 Derived: -smoke(skc9,A) | smoke(skc14,A). [resolve(27,a,2,a)].
% 0.49/1.11 28 -accessible_world(A,B) | -present(A,C) | present(B,C) # label(clause62) # label(axiom). [assumption].
% 0.49/1.11 Derived: -present(skc9,A) | present(skc14,A). [resolve(28,a,2,a)].
% 0.49/1.11 29 -accessible_world(A,B) | -think_believe_consider(A,C) | think_believe_consider(B,C) # label(clause63) # label(axiom). [assumption].
% 0.49/1.11 Derived: -think_believe_consider(skc9,A) | think_believe_consider(skc14,A). [resolve(29,a,2,a)].
% 0.49/1.11 30 -accessible_world(A,B) | -proposition(A,C) | proposition(B,C) # label(clause64) # label(axiom). [assumption].
% 0.49/1.11 Derived: -proposition(skc9,A) | proposition(skc14,A). [resolve(30,a,2,a)].
% 0.49/1.11 31 -accessible_world(A,B) | -vincent_forename(A,C) | vincent_forename(B,C) # label(clause65) # label(axiom). [assumption].
% 0.49/1.11 Derived: -vincent_forename(skc9,A) | vincent_forename(skc14,A). [resolve(31,a,2,a)].
% 0.49/1.11 32 -accessible_world(A,B) | -of(A,C,D) | of(B,C,D) # label(clause66) # label(axiom). [assumption].
% 0.49/1.11 Derived: -of(skc9,A,B) | of(skc14,A,B). [resolve(32,a,2,a)].
% 0.49/1.11 33 -accessible_world(A,B) | -agent(A,C,D) | agent(B,C,D) # label(clause67) # label(axiom). [assumption].
% 0.49/1.11 Derived: -agent(skc9,A,B) | agent(skc14,A,B). [resolve(33,a,2,a)].
% 0.49/1.11 34 -accessible_world(A,B) | -theme(A,C,D) | theme(B,C,D) # label(clause68) # label(axiom). [assumption].
% 0.49/1.15 Derived: -theme(skc9,A,B) | theme(skc14,A,B). [resolve(34,a,2,a)].
% 0.49/1.15 35 -accessible_world(A,B) | -be(A,C,D,E) | be(B,C,D,E) # label(clause69) # label(axiom). [assumption].
% 0.49/1.15 Derived: -be(skc9,A,B,C) | be(skc14,A,B,C). [resolve(35,a,2,a)].
% 0.49/1.15
% 0.49/1.15 ============================== end predicate elimination =============
% 0.49/1.15
% 0.49/1.15 Auto_denials:
% 0.49/1.15 % copying label clause31 to answer in negative clause
% 0.49/1.15 % copying label clause32 to answer in negative clause
% 0.49/1.15 % copying label clause33 to answer in negative clause
% 0.49/1.15 % copying label clause34 to answer in negative clause
% 0.49/1.15 % assign(max_proofs, 4). % (Horn set with more than one neg. clause)
% 0.49/1.15
% 0.49/1.15 Term ordering decisions:
% 0.49/1.15
% 0.49/1.15 % Assigning unary symbol skf1 kb_weight 0 and highest precedence (45).
% 0.49/1.15 Function symbol KB weights: skc9=1. skc14=1. skc15=1. skc12=1. skc13=1. skc16=1. skc17=1. skc10=1. skc11=1. skf1=0.
% 0.49/1.15
% 0.49/1.15 ============================== end of process initial clauses ========
% 0.49/1.15
% 0.49/1.15 ============================== CLAUSES FOR SEARCH ====================
% 0.49/1.15
% 0.49/1.15 ============================== end of clauses for search =============
% 0.49/1.15
% 0.49/1.15 ============================== SEARCH ================================
% 0.49/1.15
% 0.49/1.15 % Starting search at 0.02 seconds.
% 0.49/1.15
% 0.49/1.15 ============================== STATISTICS ============================
% 0.49/1.15
% 0.49/1.15 Given=451. Generated=675. Kept=453. proofs=0.
% 0.49/1.15 Usable=446. Sos=0. Demods=1. Limbo=0, Disabled=135. Hints=0.
% 0.49/1.15 Megabytes=0.34.
% 0.49/1.15 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.49/1.15
% 0.49/1.15 ============================== end of statistics =====================
% 0.49/1.15
% 0.49/1.15 ============================== end of search =========================
% 0.49/1.15
% 0.49/1.15 SEARCH FAILED
% 0.49/1.15
% 0.49/1.15 Exiting with failure.
% 0.49/1.15
% 0.49/1.15 Process 9846 exit (sos_empty) Thu Jun 30 19:10:05 2022
% 0.49/1.15 Prover9 interrupted
%------------------------------------------------------------------------------