TSTP Solution File: PUZ131+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : PUZ131+1 : TPTP v5.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 00:57:20 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 17 unt; 0 def)
% Number of atoms : 83 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 89 ( 41 ~; 42 |; 1 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1] :
( course(X1)
=> teaches(coordinatorof(X1),X1) ),
file('/tmp/tmpjHQDqO/sel_PUZ131+1.p_1',coordinator_teaches) ).
fof(8,axiom,
! [X1,X2] :
( ( student(X1)
& course(X2) )
=> ( enrolled(X1,X2)
=> ! [X4] :
( professor(X4)
=> ( teaches(X4,X2)
=> taughtby(X1,X4) ) ) ) ),
file('/tmp/tmpjHQDqO/sel_PUZ131+1.p_1',student_enrolled_taught) ).
fof(10,axiom,
student(michael),
file('/tmp/tmpjHQDqO/sel_PUZ131+1.p_1',michael_type) ).
fof(11,axiom,
coordinatorof(csc410) = victor,
file('/tmp/tmpjHQDqO/sel_PUZ131+1.p_1',victor_coordinator_csc410_axiom) ).
fof(12,axiom,
course(csc410),
file('/tmp/tmpjHQDqO/sel_PUZ131+1.p_1',csc410_type) ).
fof(13,axiom,
professor(victor),
file('/tmp/tmpjHQDqO/sel_PUZ131+1.p_1',victor_type) ).
fof(15,conjecture,
taughtby(michael,victor),
file('/tmp/tmpjHQDqO/sel_PUZ131+1.p_1',teaching_conjecture) ).
fof(16,axiom,
enrolled(michael,csc410),
file('/tmp/tmpjHQDqO/sel_PUZ131+1.p_1',michael_enrolled_csc410_axiom) ).
fof(17,negated_conjecture,
~ taughtby(michael,victor),
inference(assume_negation,[status(cth)],[15]) ).
fof(18,negated_conjecture,
~ taughtby(michael,victor),
inference(fof_simplification,[status(thm)],[17,theory(equality)]) ).
fof(31,plain,
! [X1] :
( ~ course(X1)
| teaches(coordinatorof(X1),X1) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(32,plain,
! [X2] :
( ~ course(X2)
| teaches(coordinatorof(X2),X2) ),
inference(variable_rename,[status(thm)],[31]) ).
cnf(33,plain,
( teaches(coordinatorof(X1),X1)
| ~ course(X1) ),
inference(split_conjunct,[status(thm)],[32]) ).
fof(49,plain,
! [X1,X2] :
( ~ student(X1)
| ~ course(X2)
| ~ enrolled(X1,X2)
| ! [X4] :
( ~ professor(X4)
| ~ teaches(X4,X2)
| taughtby(X1,X4) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(50,plain,
! [X5,X6] :
( ~ student(X5)
| ~ course(X6)
| ~ enrolled(X5,X6)
| ! [X7] :
( ~ professor(X7)
| ~ teaches(X7,X6)
| taughtby(X5,X7) ) ),
inference(variable_rename,[status(thm)],[49]) ).
fof(51,plain,
! [X5,X6,X7] :
( ~ professor(X7)
| ~ teaches(X7,X6)
| taughtby(X5,X7)
| ~ enrolled(X5,X6)
| ~ student(X5)
| ~ course(X6) ),
inference(shift_quantors,[status(thm)],[50]) ).
cnf(52,plain,
( taughtby(X2,X3)
| ~ course(X1)
| ~ student(X2)
| ~ enrolled(X2,X1)
| ~ teaches(X3,X1)
| ~ professor(X3) ),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(56,plain,
student(michael),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(57,plain,
coordinatorof(csc410) = victor,
inference(split_conjunct,[status(thm)],[11]) ).
cnf(58,plain,
course(csc410),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(59,plain,
professor(victor),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(66,negated_conjecture,
~ taughtby(michael,victor),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(67,plain,
enrolled(michael,csc410),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(72,plain,
( teaches(victor,csc410)
| ~ course(csc410) ),
inference(spm,[status(thm)],[33,57,theory(equality)]) ).
cnf(73,plain,
( teaches(victor,csc410)
| $false ),
inference(rw,[status(thm)],[72,58,theory(equality)]) ).
cnf(74,plain,
teaches(victor,csc410),
inference(cn,[status(thm)],[73,theory(equality)]) ).
cnf(78,plain,
( taughtby(X1,victor)
| ~ professor(victor)
| ~ enrolled(X1,csc410)
| ~ student(X1)
| ~ course(csc410) ),
inference(spm,[status(thm)],[52,74,theory(equality)]) ).
cnf(79,plain,
( taughtby(X1,victor)
| $false
| ~ enrolled(X1,csc410)
| ~ student(X1)
| ~ course(csc410) ),
inference(rw,[status(thm)],[78,59,theory(equality)]) ).
cnf(80,plain,
( taughtby(X1,victor)
| $false
| ~ enrolled(X1,csc410)
| ~ student(X1)
| $false ),
inference(rw,[status(thm)],[79,58,theory(equality)]) ).
cnf(81,plain,
( taughtby(X1,victor)
| ~ enrolled(X1,csc410)
| ~ student(X1) ),
inference(cn,[status(thm)],[80,theory(equality)]) ).
cnf(82,negated_conjecture,
( ~ enrolled(michael,csc410)
| ~ student(michael) ),
inference(spm,[status(thm)],[66,81,theory(equality)]) ).
cnf(83,negated_conjecture,
( $false
| ~ student(michael) ),
inference(rw,[status(thm)],[82,67,theory(equality)]) ).
cnf(84,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[83,56,theory(equality)]) ).
cnf(85,negated_conjecture,
$false,
inference(cn,[status(thm)],[84,theory(equality)]) ).
cnf(86,negated_conjecture,
$false,
85,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/PUZ/PUZ131+1.p
% --creating new selector for []
% -running prover on /tmp/tmpjHQDqO/sel_PUZ131+1.p_1 with time limit 29
% -prover status Theorem
% Problem PUZ131+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/PUZ/PUZ131+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/PUZ/PUZ131+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------