TSTP Solution File: PUZ131+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ131+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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 18:24:05 EDT 2022
% Result : Theorem 0.62s 0.92s
% Output : Refutation 0.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : PUZ131+1 : TPTP v8.1.0. Released v4.1.0.
% 0.00/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.30 % Computer : n021.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Sun May 29 01:41:57 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.62/0.91 ============================== Prover9 ===============================
% 0.62/0.91 Prover9 (32) version 2009-11A, November 2009.
% 0.62/0.91 Process 1324 was started by sandbox2 on n021.cluster.edu,
% 0.62/0.91 Sun May 29 01:41:58 2022
% 0.62/0.91 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1169_n021.cluster.edu".
% 0.62/0.91 ============================== end of head ===========================
% 0.62/0.91
% 0.62/0.91 ============================== INPUT =================================
% 0.62/0.91
% 0.62/0.91 % Reading from file /tmp/Prover9_1169_n021.cluster.edu
% 0.62/0.91
% 0.62/0.91 set(prolog_style_variables).
% 0.62/0.91 set(auto2).
% 0.62/0.91 % set(auto2) -> set(auto).
% 0.62/0.91 % set(auto) -> set(auto_inference).
% 0.62/0.91 % set(auto) -> set(auto_setup).
% 0.62/0.91 % set(auto_setup) -> set(predicate_elim).
% 0.62/0.91 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.62/0.91 % set(auto) -> set(auto_limits).
% 0.62/0.91 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.62/0.91 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.62/0.91 % set(auto) -> set(auto_denials).
% 0.62/0.91 % set(auto) -> set(auto_process).
% 0.62/0.91 % set(auto2) -> assign(new_constants, 1).
% 0.62/0.91 % set(auto2) -> assign(fold_denial_max, 3).
% 0.62/0.91 % set(auto2) -> assign(max_weight, "200.000").
% 0.62/0.91 % set(auto2) -> assign(max_hours, 1).
% 0.62/0.91 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.62/0.91 % set(auto2) -> assign(max_seconds, 0).
% 0.62/0.91 % set(auto2) -> assign(max_minutes, 5).
% 0.62/0.91 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.62/0.91 % set(auto2) -> set(sort_initial_sos).
% 0.62/0.91 % set(auto2) -> assign(sos_limit, -1).
% 0.62/0.91 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.62/0.91 % set(auto2) -> assign(max_megs, 400).
% 0.62/0.91 % set(auto2) -> assign(stats, some).
% 0.62/0.91 % set(auto2) -> clear(echo_input).
% 0.62/0.91 % set(auto2) -> set(quiet).
% 0.62/0.91 % set(auto2) -> clear(print_initial_clauses).
% 0.62/0.91 % set(auto2) -> clear(print_given).
% 0.62/0.91 assign(lrs_ticks,-1).
% 0.62/0.91 assign(sos_limit,10000).
% 0.62/0.91 assign(order,kbo).
% 0.62/0.91 set(lex_order_vars).
% 0.62/0.91 clear(print_given).
% 0.62/0.91
% 0.62/0.91 % formulas(sos). % not echoed (16 formulas)
% 0.62/0.91
% 0.62/0.91 ============================== end of input ==========================
% 0.62/0.91
% 0.62/0.91 % From the command line: assign(max_seconds, 300).
% 0.62/0.91
% 0.62/0.91 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.62/0.91
% 0.62/0.91 % Formulas that are not ordinary clauses:
% 0.62/0.91 1 (exists A student(A)) # label(student_type) # label(axiom) # label(non_clause). [assumption].
% 0.62/0.91 2 (exists A professor(A)) # label(professor_type) # label(axiom) # label(non_clause). [assumption].
% 0.62/0.91 3 (exists A course(A)) # label(course_type) # label(axiom) # label(non_clause). [assumption].
% 0.62/0.91 4 (all A (course(A) -> professor(coordinatorof(A)))) # label(coordinator_of_type) # label(axiom) # label(non_clause). [assumption].
% 0.62/0.91 5 (all X (student(X) -> (exists Y (course(Y) & enrolled(X,Y))))) # label(student_enrolled_axiom) # label(axiom) # label(non_clause). [assumption].
% 0.62/0.91 6 (all X (professor(X) -> (exists Y (course(Y) & teaches(X,Y))))) # label(professor_teaches) # label(axiom) # label(non_clause). [assumption].
% 0.62/0.91 7 (all X (course(X) -> (exists Y (student(Y) & enrolled(Y,X))))) # label(course_enrolled) # label(axiom) # label(non_clause). [assumption].
% 0.62/0.91 8 (all X (course(X) -> (exists Y (professor(Y) & teaches(Y,X))))) # label(course_teaches) # label(axiom) # label(non_clause). [assumption].
% 0.62/0.91 9 (all X (course(X) -> teaches(coordinatorof(X),X))) # label(coordinator_teaches) # label(axiom) # label(non_clause). [assumption].
% 0.62/0.91 10 (all X all Y (student(X) & course(Y) -> (enrolled(X,Y) -> (all Z (professor(Z) -> (teaches(Z,Y) -> taughtby(X,Z))))))) # label(student_enrolled_taught) # label(axiom) # label(non_clause). [assumption].
% 0.62/0.91
% 0.62/0.91 ============================== end of process non-clausal formulas ===
% 0.62/0.91
% 0.62/0.91 ============================== PROCESS INITIAL CLAUSES ===============
% 0.62/0.91
% 0.62/0.91 ============================== PREDICATE ELIMINATION =================
% 0.62/0.91 11 -student(A) | course(f1(A)) # label(student_enrolled_axiom) # label(axiom). [clausify(5)].
% 0.62/0.91 12 student(c1) # label(student_type) # label(axiom). [clausify(1)].
% 0.62/0.91 13 student(michael) # label(michael_type) # label(axiom). [assumption].
% 0.62/0.91 Derived: course(f1(c1)). [resolve(11,a,12,a)].
% 0.62/0.91 Derived: course(f1(michael)). [resolve(11,a,13,a)].
% 0.62/0.91 14 -course(A) | student(f3(A)) # label(course_enrolled) # label(axiom). [clausify(7)].
% 0.62/0.91 Derived: -course(A) | course(f1(f3(A))). [resolve(14,b,11,a)].
% 0.62/0.91 15 -student(A) | enrolled(A,f1(A)) # label(student_enrolled_axiom) # label(axiom). [clausify(5)].
% 0.62/0.91 Derived: enrolled(c1,f1(c1)). [resolve(15,a,12,a)].
% 0.62/0.91 Derived: enrolled(michael,f1(michael)). [resolve(15,a,13,a)].
% 0.62/0.91 Derived: enrolled(f3(A),f1(f3(A))) | -course(A). [resolve(15,a,14,b)].
% 0.62/0.91 16 -student(A) | -course(B) | -enrolled(A,B) | -professor(C) | -teaches(C,B) | taughtby(A,C) # label(student_enrolled_taught) # label(axiom). [clausify(10)].
% 0.62/0.91 Derived: -course(A) | -enrolled(c1,A) | -professor(B) | -teaches(B,A) | taughtby(c1,B). [resolve(16,a,12,a)].
% 0.62/0.91 Derived: -course(A) | -enrolled(michael,A) | -professor(B) | -teaches(B,A) | taughtby(michael,B). [resolve(16,a,13,a)].
% 0.62/0.91 Derived: -course(A) | -enrolled(f3(B),A) | -professor(C) | -teaches(C,A) | taughtby(f3(B),C) | -course(B). [resolve(16,a,14,b)].
% 0.62/0.91 17 -professor(A) | course(f2(A)) # label(professor_teaches) # label(axiom). [clausify(6)].
% 0.62/0.91 18 professor(c2) # label(professor_type) # label(axiom). [clausify(2)].
% 0.62/0.91 19 professor(victor) # label(victor_type) # label(axiom). [assumption].
% 0.62/0.91 20 -course(A) | professor(coordinatorof(A)) # label(coordinator_of_type) # label(axiom). [clausify(4)].
% 0.62/0.91 Derived: course(f2(c2)). [resolve(17,a,18,a)].
% 0.62/0.91 Derived: course(f2(victor)). [resolve(17,a,19,a)].
% 0.62/0.91 Derived: course(f2(coordinatorof(A))) | -course(A). [resolve(17,a,20,b)].
% 0.62/0.91 21 -course(A) | professor(f4(A)) # label(course_teaches) # label(axiom). [clausify(8)].
% 0.62/0.91 Derived: -course(A) | course(f2(f4(A))). [resolve(21,b,17,a)].
% 0.62/0.91 22 -professor(A) | teaches(A,f2(A)) # label(professor_teaches) # label(axiom). [clausify(6)].
% 0.62/0.91 Derived: teaches(c2,f2(c2)). [resolve(22,a,18,a)].
% 0.62/0.91 Derived: teaches(victor,f2(victor)). [resolve(22,a,19,a)].
% 0.62/0.91 Derived: teaches(coordinatorof(A),f2(coordinatorof(A))) | -course(A). [resolve(22,a,20,b)].
% 0.62/0.91 Derived: teaches(f4(A),f2(f4(A))) | -course(A). [resolve(22,a,21,b)].
% 0.62/0.91 23 -course(A) | -enrolled(c1,A) | -professor(B) | -teaches(B,A) | taughtby(c1,B). [resolve(16,a,12,a)].
% 0.62/0.91 Derived: -course(A) | -enrolled(c1,A) | -teaches(c2,A) | taughtby(c1,c2). [resolve(23,c,18,a)].
% 0.62/0.91 Derived: -course(A) | -enrolled(c1,A) | -teaches(victor,A) | taughtby(c1,victor). [resolve(23,c,19,a)].
% 0.62/0.91 Derived: -course(A) | -enrolled(c1,A) | -teaches(coordinatorof(B),A) | taughtby(c1,coordinatorof(B)) | -course(B). [resolve(23,c,20,b)].
% 0.62/0.91 Derived: -course(A) | -enrolled(c1,A) | -teaches(f4(B),A) | taughtby(c1,f4(B)) | -course(B). [resolve(23,c,21,b)].
% 0.62/0.91 24 -course(A) | -enrolled(michael,A) | -professor(B) | -teaches(B,A) | taughtby(michael,B). [resolve(16,a,13,a)].
% 0.62/0.91 Derived: -course(A) | -enrolled(michael,A) | -teaches(c2,A) | taughtby(michael,c2). [resolve(24,c,18,a)].
% 0.62/0.91 Derived: -course(A) | -enrolled(michael,A) | -teaches(victor,A) | taughtby(michael,victor). [resolve(24,c,19,a)].
% 0.62/0.91 Derived: -course(A) | -enrolled(michael,A) | -teaches(coordinatorof(B),A) | taughtby(michael,coordinatorof(B)) | -course(B). [resolve(24,c,20,b)].
% 0.62/0.91 Derived: -course(A) | -enrolled(michael,A) | -teaches(f4(B),A) | taughtby(michael,f4(B)) | -course(B). [resolve(24,c,21,b)].
% 0.62/0.91 25 -course(A) | -enrolled(f3(B),A) | -professor(C) | -teaches(C,A) | taughtby(f3(B),C) | -course(B). [resolve(16,a,14,b)].
% 0.62/0.91 Derived: -course(A) | -enrolled(f3(B),A) | -teaches(c2,A) | taughtby(f3(B),c2) | -course(B). [resolve(25,c,18,a)].
% 0.62/0.91 Derived: -course(A) | -enrolled(f3(B),A) | -teaches(victor,A) | taughtby(f3(B),victor) | -course(B). [resolve(25,c,19,a)].
% 0.62/0.91 Derived: -course(A) | -enrolled(f3(B),A) | -teaches(coordinatorof(C),A) | taughtby(f3(B),coordinatorof(C)) | -course(B) | -course(C). [resolve(25,c,20,b)].
% 0.62/0.91 Derived: -course(A) | -enrolled(f3(B),A) | -teaches(f4(C),A) | taughtby(f3(B),f4(C)) | -course(B) | -course(C). [resolve(25,c,21,b)].
% 0.62/0.91
% 0.62/0.91 ============================== end predicate elimination =============
% 0.62/0.91
% 0.62/0.91 Auto_denials:
% 0.62/0.91 % copying label teaching_conjecture to answer in negative clause
% 0.62/0.91
% 0.62/0.91 Term ordering decisions:
% 0.62/0.91 Function symbol KB weights: michael=1. victor=1. csc410=1. c1=1. c2=1. c3=1. coordinatorof=1. f1=1. f2=1. f3=1. f4=1.
% 0.62/0.91
% 0.62/0.91 ============================== end of process initial clauses ========
% 0.62/0.92
% 0.62/0.92 ============================== CLAUSES FOR SEARCH ====================
% 0.62/0.92
% 0.62/0.92 ============================== end of clauses for search =============
% 0.62/0.92
% 0.62/0.92 ============================== SEARCH ================================
% 0.62/0.92
% 0.62/0.92 % Starting search at 0.01 seconds.
% 0.62/0.92
% 0.62/0.92 ============================== PROOF =================================
% 0.62/0.92 % SZS status Theorem
% 0.62/0.92 % SZS output start Refutation
% 0.62/0.92
% 0.62/0.92 % Proof 1 at 0.01 (+ 0.00) seconds: teaching_conjecture.
% 0.62/0.92 % Length of proof is 18.
% 0.62/0.92 % Level of proof is 6.
% 0.62/0.92 % Maximum clause weight is 13.000.
% 0.62/0.92 % Given clauses 28.
% 0.62/0.92
% 0.62/0.92 9 (all X (course(X) -> teaches(coordinatorof(X),X))) # label(coordinator_teaches) # label(axiom) # label(non_clause). [assumption].
% 0.62/0.92 10 (all X all Y (student(X) & course(Y) -> (enrolled(X,Y) -> (all Z (professor(Z) -> (teaches(Z,Y) -> taughtby(X,Z))))))) # label(student_enrolled_taught) # label(axiom) # label(non_clause). [assumption].
% 0.62/0.92 13 student(michael) # label(michael_type) # label(axiom). [assumption].
% 0.62/0.92 16 -student(A) | -course(B) | -enrolled(A,B) | -professor(C) | -teaches(C,B) | taughtby(A,C) # label(student_enrolled_taught) # label(axiom). [clausify(10)].
% 0.62/0.92 19 professor(victor) # label(victor_type) # label(axiom). [assumption].
% 0.62/0.92 24 -course(A) | -enrolled(michael,A) | -professor(B) | -teaches(B,A) | taughtby(michael,B). [resolve(16,a,13,a)].
% 0.62/0.92 27 course(csc410) # label(csc410_type) # label(axiom). [assumption].
% 0.62/0.92 28 enrolled(michael,csc410) # label(michael_enrolled_csc410_axiom) # label(axiom). [assumption].
% 0.62/0.92 29 coordinatorof(csc410) = victor # label(victor_coordinator_csc410_axiom) # label(axiom). [assumption].
% 0.62/0.92 30 victor = coordinatorof(csc410). [copy(29),flip(a)].
% 0.62/0.92 31 -taughtby(michael,victor) # label(teaching_conjecture) # label(negated_conjecture) # answer(teaching_conjecture). [assumption].
% 0.62/0.92 32 -taughtby(michael,coordinatorof(csc410)) # answer(teaching_conjecture). [copy(31),rewrite([30(2)])].
% 0.62/0.92 35 -course(A) | teaches(coordinatorof(A),A) # label(coordinator_teaches) # label(axiom). [clausify(9)].
% 0.62/0.92 58 -course(A) | -enrolled(michael,A) | -teaches(victor,A) | taughtby(michael,victor). [resolve(24,c,19,a)].
% 0.62/0.92 59 -course(A) | -enrolled(michael,A) | -teaches(coordinatorof(csc410),A) | taughtby(michael,coordinatorof(csc410)). [copy(58),rewrite([30(4),30(8)])].
% 0.62/0.92 71 teaches(coordinatorof(csc410),csc410). [hyper(35,a,27,a)].
% 0.62/0.92 121 -teaches(coordinatorof(csc410),csc410) # answer(teaching_conjecture). [ur(59,a,27,a,b,28,a,d,32,a)].
% 0.62/0.92 122 $F # answer(teaching_conjecture). [resolve(121,a,71,a)].
% 0.62/0.92
% 0.62/0.92 % SZS output end Refutation
% 0.62/0.92 ============================== end of proof ==========================
% 0.62/0.92
% 0.62/0.92 ============================== STATISTICS ============================
% 0.62/0.92
% 0.62/0.92 Given=28. Generated=92. Kept=89. proofs=1.
% 0.62/0.92 Usable=28. Sos=58. Demods=1. Limbo=2, Disabled=49. Hints=0.
% 0.62/0.92 Megabytes=0.11.
% 0.62/0.92 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.62/0.92
% 0.62/0.92 ============================== end of statistics =====================
% 0.62/0.92
% 0.62/0.92 ============================== end of search =========================
% 0.62/0.92
% 0.62/0.92 THEOREM PROVED
% 0.62/0.92 % SZS status Theorem
% 0.62/0.92
% 0.62/0.92 Exiting with 1 proof.
% 0.62/0.92
% 0.62/0.92 Process 1324 exit (max_proofs) Sun May 29 01:41:58 2022
% 0.62/0.92 Prover9 interrupted
%------------------------------------------------------------------------------