TSTP Solution File: PUZ131-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ131-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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 : Unsatisfiable 0.39s 0.97s
% Output : Refutation 0.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PUZ131-10 : TPTP v8.1.0. Released v7.5.0.
% 0.00/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun May 29 01:48:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.39/0.97 ============================== Prover9 ===============================
% 0.39/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.39/0.97 Process 6851 was started by sandbox on n025.cluster.edu,
% 0.39/0.97 Sun May 29 01:48:26 2022
% 0.39/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6493_n025.cluster.edu".
% 0.39/0.97 ============================== end of head ===========================
% 0.39/0.97
% 0.39/0.97 ============================== INPUT =================================
% 0.39/0.97
% 0.39/0.97 % Reading from file /tmp/Prover9_6493_n025.cluster.edu
% 0.39/0.97
% 0.39/0.97 set(prolog_style_variables).
% 0.39/0.97 set(auto2).
% 0.39/0.97 % set(auto2) -> set(auto).
% 0.39/0.97 % set(auto) -> set(auto_inference).
% 0.39/0.97 % set(auto) -> set(auto_setup).
% 0.39/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.39/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.39/0.97 % set(auto) -> set(auto_limits).
% 0.39/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.39/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.39/0.97 % set(auto) -> set(auto_denials).
% 0.39/0.97 % set(auto) -> set(auto_process).
% 0.39/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.39/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.39/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.39/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.39/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.39/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.39/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.39/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.39/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.39/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.39/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.39/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.39/0.97 % set(auto2) -> assign(stats, some).
% 0.39/0.97 % set(auto2) -> clear(echo_input).
% 0.39/0.97 % set(auto2) -> set(quiet).
% 0.39/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.39/0.97 % set(auto2) -> clear(print_given).
% 0.39/0.97 assign(lrs_ticks,-1).
% 0.39/0.97 assign(sos_limit,10000).
% 0.39/0.97 assign(order,kbo).
% 0.39/0.97 set(lex_order_vars).
% 0.39/0.97 clear(print_given).
% 0.39/0.97
% 0.39/0.97 % formulas(sos). % not echoed (21 formulas)
% 0.39/0.97
% 0.39/0.97 ============================== end of input ==========================
% 0.39/0.97
% 0.39/0.97 % From the command line: assign(max_seconds, 300).
% 0.39/0.97
% 0.39/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.39/0.97
% 0.39/0.97 % Formulas that are not ordinary clauses:
% 0.39/0.97
% 0.39/0.97 ============================== end of process non-clausal formulas ===
% 0.39/0.97
% 0.39/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.39/0.97
% 0.39/0.97 ============================== PREDICATE ELIMINATION =================
% 0.39/0.97
% 0.39/0.97 ============================== end predicate elimination =============
% 0.39/0.97
% 0.39/0.97 Auto_denials:
% 0.39/0.97 % copying label teaching_conjecture to answer in negative clause
% 0.39/0.97
% 0.39/0.97 Term ordering decisions:
% 0.39/0.97 Function symbol KB weights: true=1. csc410=1. michael=1. victor=1. sK5_course_type_A=1. sK6_professor_type_A=1. sK7_student_type_A=1. enrolled=1. teaches=1. taughtby=1. course=1. professor=1. student=1. coordinatorof=1. sK1_course_teaches_Y=1. sK2_course_enrolled_Y=1. sK3_professor_teaches_Y=1. sK4_student_enrolled_axiom_Y=1. ifeq=1.
% 0.39/0.97
% 0.39/0.97 ============================== end of process initial clauses ========
% 0.39/0.97
% 0.39/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.39/0.97
% 0.39/0.97 ============================== end of clauses for search =============
% 0.39/0.97
% 0.39/0.97 ============================== SEARCH ================================
% 0.39/0.97
% 0.39/0.97 % Starting search at 0.01 seconds.
% 0.39/0.97
% 0.39/0.97 ============================== PROOF =================================
% 0.39/0.97 % SZS status Unsatisfiable
% 0.39/0.97 % SZS output start Refutation
% 0.39/0.97
% 0.39/0.97 % Proof 1 at 0.02 (+ 0.00) seconds: teaching_conjecture.
% 0.39/0.97 % Length of proof is 29.
% 0.39/0.97 % Level of proof is 8.
% 0.39/0.97 % Maximum clause weight is 43.000.
% 0.39/0.97 % Given clauses 42.
% 0.39/0.97
% 0.39/0.97 1 student(sK7_student_type_A) = true # label(student_type) # label(axiom). [assumption].
% 0.39/0.97 2 true = student(sK7_student_type_A). [copy(1),flip(a)].
% 0.39/0.97 3 professor(sK6_professor_type_A) = true # label(professor_type) # label(axiom). [assumption].
% 0.39/0.97 4 student(sK7_student_type_A) = professor(sK6_professor_type_A). [copy(3),rewrite([2(3)]),flip(a)].
% 0.39/0.97 5 course(sK5_course_type_A) = true # label(course_type) # label(axiom). [assumption].
% 0.39/0.97 6 professor(sK6_professor_type_A) = course(sK5_course_type_A). [copy(5),rewrite([2(3),4(4)]),flip(a)].
% 0.39/0.97 7 student(michael) = true # label(michael_type) # label(axiom). [assumption].
% 0.39/0.97 8 student(michael) = course(sK5_course_type_A). [copy(7),rewrite([2(3),4(4),6(4)])].
% 0.39/0.97 9 professor(victor) = true # label(victor_type) # label(axiom). [assumption].
% 0.39/0.97 10 professor(victor) = course(sK5_course_type_A). [copy(9),rewrite([2(3),4(4),6(4)])].
% 0.39/0.97 11 course(csc410) = true # label(csc410_type) # label(axiom). [assumption].
% 0.39/0.97 12 course(sK5_course_type_A) = course(csc410). [copy(11),rewrite([2(3),4(4),6(4)]),flip(a)].
% 0.39/0.97 13 coordinatorof(csc410) = victor # label(victor_coordinator_csc410_axiom) # label(axiom). [assumption].
% 0.39/0.97 14 victor = coordinatorof(csc410). [copy(13),flip(a)].
% 0.39/0.97 15 enrolled(michael,csc410) = true # label(michael_enrolled_csc410_axiom) # label(axiom). [assumption].
% 0.39/0.97 16 enrolled(michael,csc410) = course(csc410). [copy(15),rewrite([2(4),4(5),6(5),12(5)])].
% 0.39/0.97 17 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 0.39/0.97 36 ifeq(course(A),true,teaches(coordinatorof(A),A),true) = true # label(coordinator_teaches) # label(axiom). [assumption].
% 0.39/0.97 37 ifeq(course(A),course(csc410),teaches(coordinatorof(A),A),course(csc410)) = course(csc410). [copy(36),rewrite([2(2),4(3),6(3),12(3),2(6),4(7),6(7),12(7),2(9),4(10),6(10),12(10)])].
% 0.39/0.97 38 ifeq(teaches(A,B),true,ifeq(enrolled(C,B),true,ifeq(course(B),true,ifeq(professor(A),true,ifeq(student(C),true,taughtby(C,A),true),true),true),true),true) = true # label(student_enrolled_taught) # label(axiom). [assumption].
% 0.39/0.97 39 ifeq(teaches(A,B),course(csc410),ifeq(enrolled(C,B),course(csc410),ifeq(course(B),course(csc410),ifeq(professor(A),course(csc410),ifeq(student(C),course(csc410),taughtby(C,A),course(csc410)),course(csc410)),course(csc410)),course(csc410)),course(csc410)) = course(csc410). [copy(38),rewrite([2(2),4(3),6(3),12(3),2(5),4(6),6(6),12(6),2(8),4(9),6(9),12(9),2(11),4(12),6(12),12(12),2(14),4(15),6(15),12(15),2(17),4(18),6(18),12(18),2(20),4(21),6(21),12(21),2(23),4(24),6(24),12(24),2(26),4(27),6(27),12(27),2(29),4(30),6(30),12(30),2(32),4(33),6(33),12(33)])].
% 0.39/0.97 40 taughtby(michael,victor) != true # label(teaching_conjecture) # label(negated_conjecture) # answer(teaching_conjecture). [assumption].
% 0.39/0.97 41 taughtby(michael,coordinatorof(csc410)) != course(csc410) # answer(teaching_conjecture). [copy(40),rewrite([14(2),2(5),4(6),6(6),12(6)])].
% 0.39/0.97 44 professor(coordinatorof(csc410)) = course(csc410). [back_rewrite(10),rewrite([14(1),12(5)])].
% 0.39/0.97 45 student(michael) = course(csc410). [back_rewrite(8),rewrite([12(4)])].
% 0.39/0.97 57 teaches(coordinatorof(csc410),csc410) = course(csc410). [para(37(a,1),17(a,1)),flip(a)].
% 0.39/0.97 59 ifeq(teaches(A,csc410),course(csc410),ifeq(professor(A),course(csc410),taughtby(michael,A),course(csc410)),course(csc410)) = course(csc410). [para(16(a,1),39(a,1,3,1)),rewrite([45(17),17(24),17(23),17(19)])].
% 0.39/0.97 138 taughtby(michael,coordinatorof(csc410)) = course(csc410). [para(44(a,1),59(a,1,3,1)),rewrite([57(4),17(15),17(11)])].
% 0.39/0.97 139 $F # answer(teaching_conjecture). [resolve(138,a,41,a)].
% 0.39/0.97
% 0.39/0.97 % SZS output end Refutation
% 0.39/0.97 ============================== end of proof ==========================
% 0.39/0.97
% 0.39/0.97 ============================== STATISTICS ============================
% 0.39/0.97
% 0.39/0.97 Given=42. Generated=185. Kept=118. proofs=1.
% 0.39/0.97 Usable=42. Sos=70. Demods=111. Limbo=0, Disabled=26. Hints=0.
% 0.39/0.97 Megabytes=0.18.
% 0.39/0.97 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.39/0.97
% 0.39/0.97 ============================== end of statistics =====================
% 0.39/0.97
% 0.39/0.97 ============================== end of search =========================
% 0.39/0.97
% 0.39/0.97 THEOREM PROVED
% 0.39/0.97 % SZS status Unsatisfiable
% 0.39/0.97
% 0.39/0.97 Exiting with 1 proof.
% 0.39/0.97
% 0.39/0.97 Process 6851 exit (max_proofs) Sun May 29 01:48:26 2022
% 0.39/0.97 Prover9 interrupted
%------------------------------------------------------------------------------