TSTP Solution File: MSC009+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MSC009+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:34 EDT 2022
% Result : Unknown 0.44s 1.01s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MSC009+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 1 16:05:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.01 ============================== Prover9 ===============================
% 0.44/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.01 Process 26515 was started by sandbox on n020.cluster.edu,
% 0.44/1.01 Fri Jul 1 16:05:01 2022
% 0.44/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26362_n020.cluster.edu".
% 0.44/1.01 ============================== end of head ===========================
% 0.44/1.01
% 0.44/1.01 ============================== INPUT =================================
% 0.44/1.01
% 0.44/1.01 % Reading from file /tmp/Prover9_26362_n020.cluster.edu
% 0.44/1.01
% 0.44/1.01 set(prolog_style_variables).
% 0.44/1.01 set(auto2).
% 0.44/1.01 % set(auto2) -> set(auto).
% 0.44/1.01 % set(auto) -> set(auto_inference).
% 0.44/1.01 % set(auto) -> set(auto_setup).
% 0.44/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.01 % set(auto) -> set(auto_limits).
% 0.44/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.01 % set(auto) -> set(auto_denials).
% 0.44/1.01 % set(auto) -> set(auto_process).
% 0.44/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.01 % set(auto2) -> assign(stats, some).
% 0.44/1.01 % set(auto2) -> clear(echo_input).
% 0.44/1.01 % set(auto2) -> set(quiet).
% 0.44/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.01 % set(auto2) -> clear(print_given).
% 0.44/1.01 assign(lrs_ticks,-1).
% 0.44/1.01 assign(sos_limit,10000).
% 0.44/1.01 assign(order,kbo).
% 0.44/1.01 set(lex_order_vars).
% 0.44/1.01 clear(print_given).
% 0.44/1.01
% 0.44/1.01 % formulas(sos). % not echoed (7 formulas)
% 0.44/1.01
% 0.44/1.01 ============================== end of input ==========================
% 0.44/1.01
% 0.44/1.01 % From the command line: assign(max_seconds, 300).
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.01
% 0.44/1.01 % Formulas that are not ordinary clauses:
% 0.44/1.01 1 (all X (female(X) <-> -male(X))) # label(female) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 2 (all X (person(X) <-> (exists Y (sex(X,Y) & (male(Y) | female(Y)))))) # label(person) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 3 (all X (parent(X) <-> person(X) & (exists Y (child(X,Y) & person(Y))))) # label(parent) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 4 (all X (mother(X) <-> parent(X) & (exists Y (sex(X,Y) & female(Y))))) # label(mother) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 5 (all X (father(X) <-> parent(X) & -mother(X))) # label(father) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 6 (all X (grandparent(X) <-> parent(X) & (exists Y (child(X,Y) & parent(Y))))) # label(grandparent) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 7 (all X (parent_with_sons_only(X) <-> parent(X) & (all Y (child(X,Y) -> (exists Z (sex(Y,Z) & male(Z))))))) # label(parent_with_sons_only) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01
% 0.44/1.01 ============================== end of process non-clausal formulas ===
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.01
% 0.44/1.01 ============================== PREDICATE ELIMINATION =================
% 0.44/1.01 8 -female(A) | -male(A) # label(female) # label(axiom). [clausify(1)].
% 0.44/1.01 9 female(A) | male(A) # label(female) # label(axiom). [clausify(1)].
% 0.44/1.01 10 -mother(A) | female(f3(A)) # label(mother) # label(axiom). [clausify(4)].
% 0.44/1.01 Derived: -mother(A) | -male(f3(A)). [resolve(10,b,8,a)].
% 0.44/1.01 11 person(A) | -sex(A,B) | -female(B) # label(person) # label(axiom). [clausify(2)].
% 0.44/1.01 Derived: person(A) | -sex(A,B) | male(B). [resolve(11,c,9,a)].
% 0.44/1.01 Derived: person(A) | -sex(A,f3(B)) | -mother(B). [resolve(11,c,10,b)].
% 0.44/1.01 12 -person(A) | male(f1(A)) | female(f1(A)) # label(person) # label(axiom). [clausify(2)].
% 0.44/1.01 13 mother(A) | -parent(A) | -sex(A,B) | -female(B) # label(mother) # label(axiom). [clausify(4)].
% 0.44/1.01 Derived: mother(A) | -parent(A) | -sex(A,B) | male(B). [resolve(13,d,9,a)].
% 0.44/1.01 Derived: mother(A) | -parent(A) | -sex(A,f3(B)) | -mother(B). [resolve(13,d,10,b)].
% 0.44/1.01 14 father(A) | -parent(A) | mother(A) # label(father) # label(axiom). [clausify(5)].
% 0.44/1.01 15 -father(A) | -mother(A) # label(father) # label(axiom). [clausify(5)].
% 0.44/1.01 16 -father(A) | parent(A) # label(father) # label(axiom). [clausify(5)].
% 0.44/1.01 17 grandparent(A) | -parent(A) | -child(A,B) | -parent(B) # label(grandparent) # label(axiom). [clausify(6)].
% 0.44/1.01 18 -grandparent(A) | parent(A) # label(grandparent) # label(axiom). [clausify(6)].
% 0.44/1.01 19 -grandparent(A) | parent(f4(A)) # label(grandparent) # label(axiom). [clausify(6)].
% 0.44/1.01 20 -grandparent(A) | child(A,f4(A)) # label(grandparent) # label(axiom). [clausify(6)].
% 0.44/1.01 Derived: -parent(A) | -child(A,B) | -parent(B) | parent(f4(A)). [resolve(17,a,19,a)].
% 0.44/1.01 Derived: -parent(A) | -child(A,B) | -parent(B) | child(A,f4(A)). [resolve(17,a,20,a)].
% 0.44/1.01 21 parent_with_sons_only(A) | -parent(A) | child(A,f6(A)) # label(parent_with_sons_only) # label(axiom). [clausify(7)].
% 0.44/1.01 22 -parent_with_sons_only(A) | parent(A) # label(parent_with_sons_only) # label(axiom). [clausify(7)].
% 0.44/1.01 23 -parent_with_sons_only(A) | -child(A,B) | male(f5(A,B)) # label(parent_with_sons_only) # label(axiom). [clausify(7)].
% 0.44/1.01 Derived: -child(A,B) | male(f5(A,B)) | -parent(A) | child(A,f6(A)). [resolve(23,a,21,a)].
% 0.44/1.01 24 -parent_with_sons_only(A) | -child(A,B) | sex(B,f5(A,B)) # label(parent_with_sons_only) # label(axiom). [clausify(7)].
% 0.44/1.01 Derived: -child(A,B) | sex(B,f5(A,B)) | -parent(A) | child(A,f6(A)). [resolve(24,a,21,a)].
% 0.44/1.01 25 parent_with_sons_only(A) | -parent(A) | -sex(f6(A),B) | -male(B) # label(parent_with_sons_only) # label(axiom). [clausify(7)].
% 0.44/1.01 Derived: -parent(A) | -sex(f6(A),B) | -male(B) | -child(A,C) | male(f5(A,C)). [resolve(25,a,23,a)].
% 0.44/1.01 Derived: -parent(A) | -sex(f6(A),B) | -male(B) | -child(A,C) | sex(C,f5(A,C)). [resolve(25,a,24,a)].
% 0.44/1.01
% 0.44/1.01 ============================== end predicate elimination =============
% 0.44/1.01
% 0.44/1.01 Auto_denials: (non-Horn, no changes).
% 0.44/1.01
% 0.44/1.01 Term ordering decisions:
% 0.44/1.01 Function symbol KB weights: f5=1. f1=1. f2=1. f3=1. f4=1. f6=1.
% 0.44/1.01
% 0.44/1.01 ============================== end of process initial clauses ========
% 0.44/1.01
% 0.44/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.01
% 0.44/1.01 ============================== end of clauses for search =============
% 0.44/1.01
% 0.44/1.01 ============================== SEARCH ================================
% 0.44/1.01
% 0.44/1.01 % Starting search at 0.01 seconds.
% 0.44/1.01
% 0.44/1.01 ============================== STATISTICS ============================
% 0.44/1.01
% 0.44/1.01 Given=22. Generated=22. Kept=22. proofs=0.
% 0.44/1.01 Usable=22. Sos=0. Demods=0. Limbo=0, Disabled=37. Hints=0.
% 0.44/1.01 Megabytes=0.06.
% 0.44/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/1.01
% 0.44/1.01 ============================== end of statistics =====================
% 0.44/1.01
% 0.44/1.01 ============================== end of search =========================
% 0.44/1.01
% 0.44/1.01 SEARCH FAILED
% 0.44/1.01
% 0.44/1.01 Exiting with failure.
% 0.44/1.01
% 0.44/1.01 Process 26515 exit (sos_empty) Fri Jul 1 16:05:01 2022
% 0.44/1.01 Prover9 interrupted
%------------------------------------------------------------------------------