TSTP Solution File: PUZ131+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PUZ131+1 : TPTP v5.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 21:37:33 EST 2010
% Result : Theorem 1.12s
% Output : Solution 1.12s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP20316/PUZ131+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20316/PUZ131+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20316/PUZ131+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 20448
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,professor(victor),file('/tmp/SRASS.s.p', victor_type)).
% fof(2, axiom,student(michael),file('/tmp/SRASS.s.p', michael_type)).
% fof(5, axiom,enrolled(michael,csc410),file('/tmp/SRASS.s.p', michael_enrolled_csc410_axiom)).
% fof(7, axiom,course(csc410),file('/tmp/SRASS.s.p', csc410_type)).
% fof(8, axiom,coordinatorof(csc410)=victor,file('/tmp/SRASS.s.p', victor_coordinator_csc410_axiom)).
% fof(9, axiom,![X2]:![X3]:((student(X2)&course(X3))=>(enrolled(X2,X3)=>![X4]:(professor(X4)=>(teaches(X4,X3)=>taughtby(X2,X4))))),file('/tmp/SRASS.s.p', student_enrolled_taught)).
% fof(10, axiom,![X2]:(course(X2)=>teaches(coordinatorof(X2),X2)),file('/tmp/SRASS.s.p', coordinator_teaches)).
% fof(16, conjecture,taughtby(michael,victor),file('/tmp/SRASS.s.p', teaching_conjecture)).
% fof(17, negated_conjecture,~(taughtby(michael,victor)),inference(assume_negation,[status(cth)],[16])).
% fof(18, negated_conjecture,~(taughtby(michael,victor)),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% cnf(19,plain,(professor(victor)),inference(split_conjunct,[status(thm)],[1])).
% cnf(20,plain,(student(michael)),inference(split_conjunct,[status(thm)],[2])).
% cnf(27,plain,(enrolled(michael,csc410)),inference(split_conjunct,[status(thm)],[5])).
% cnf(31,plain,(course(csc410)),inference(split_conjunct,[status(thm)],[7])).
% cnf(32,plain,(coordinatorof(csc410)=victor),inference(split_conjunct,[status(thm)],[8])).
% fof(33, plain,![X2]:![X3]:((~(student(X2))|~(course(X3)))|(~(enrolled(X2,X3))|![X4]:(~(professor(X4))|(~(teaches(X4,X3))|taughtby(X2,X4))))),inference(fof_nnf,[status(thm)],[9])).
% fof(34, plain,![X5]:![X6]:((~(student(X5))|~(course(X6)))|(~(enrolled(X5,X6))|![X7]:(~(professor(X7))|(~(teaches(X7,X6))|taughtby(X5,X7))))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X5]:![X6]:![X7]:(((~(professor(X7))|(~(teaches(X7,X6))|taughtby(X5,X7)))|~(enrolled(X5,X6)))|(~(student(X5))|~(course(X6)))),inference(shift_quantors,[status(thm)],[34])).
% cnf(36,plain,(taughtby(X2,X3)|~course(X1)|~student(X2)|~enrolled(X2,X1)|~teaches(X3,X1)|~professor(X3)),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X2]:(~(course(X2))|teaches(coordinatorof(X2),X2)),inference(fof_nnf,[status(thm)],[10])).
% fof(38, plain,![X3]:(~(course(X3))|teaches(coordinatorof(X3),X3)),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(teaches(coordinatorof(X1),X1)|~course(X1)),inference(split_conjunct,[status(thm)],[38])).
% cnf(67,negated_conjecture,(~taughtby(michael,victor)),inference(split_conjunct,[status(thm)],[18])).
% cnf(72,plain,(teaches(victor,csc410)|~course(csc410)),inference(spm,[status(thm)],[39,32,theory(equality)])).
% cnf(73,plain,(teaches(victor,csc410)|$false),inference(rw,[status(thm)],[72,31,theory(equality)])).
% cnf(74,plain,(teaches(victor,csc410)),inference(cn,[status(thm)],[73,theory(equality)])).
% cnf(78,plain,(taughtby(X1,victor)|~course(csc410)|~enrolled(X1,csc410)|~student(X1)|~professor(victor)),inference(spm,[status(thm)],[36,74,theory(equality)])).
% cnf(79,plain,(taughtby(X1,victor)|$false|~enrolled(X1,csc410)|~student(X1)|~professor(victor)),inference(rw,[status(thm)],[78,31,theory(equality)])).
% cnf(80,plain,(taughtby(X1,victor)|$false|~enrolled(X1,csc410)|~student(X1)|$false),inference(rw,[status(thm)],[79,19,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)],[67,81,theory(equality)])).
% cnf(83,negated_conjecture,($false|~student(michael)),inference(rw,[status(thm)],[82,27,theory(equality)])).
% cnf(84,negated_conjecture,($false|$false),inference(rw,[status(thm)],[83,20,theory(equality)])).
% cnf(85,negated_conjecture,($false),inference(cn,[status(thm)],[84,theory(equality)])).
% cnf(86,negated_conjecture,($false),85,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 42
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 42
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 7
% # ...of the previous two non-trivial : 5
% # Contextual simplify-reflections : 0
% # Paramodulations : 7
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 22
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 3
% # ...number of literals in the above : 15
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 40 leaves, 1.05+/-0.218 terms/leaf
% # Paramod-from index: 20 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 33 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.006 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP20316/PUZ131+1.tptp
%
%------------------------------------------------------------------------------