TSTP Solution File: PUZ005+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PUZ005+1 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 : Wed Dec 29 21:25:45 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP18267/PUZ005+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18267/PUZ005+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18267/PUZ005+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 18363
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(day(X1)=>![X2]:(day(X2)=>((~(lion_lies(X1))&~(lies_on_one_of(a_lion,X1,X2)))=>~(lion_lies(X2))))),file('/tmp/SRASS.s.p', lion_lies_on_neither)).
% fof(8, axiom,![X1]:(day(X1)=>![X2]:(day(X2)=>((unicorn_lies(X1)&~(lies_on_one_of(a_unicorn,X1,X2)))=>unicorn_lies(X2)))),file('/tmp/SRASS.s.p', unicorn_lies_on_both)).
% fof(9, axiom,![X1]:(lion_lies(X1)=>day(X1)),file('/tmp/SRASS.s.p', lion_lies_on_a_day)).
% fof(10, axiom,![X1]:(unicorn_lies(X1)=>day(X1)),file('/tmp/SRASS.s.p', unicorn_lies_on_a_day)).
% fof(21, axiom,![X1]:(thursday(X1)=>wednesday(yesterday(X1))),file('/tmp/SRASS.s.p', thursday_follows_wednesday)).
% fof(28, axiom,thursday(a_thursday),file('/tmp/SRASS.s.p', thursday)).
% fof(34, axiom,![X1]:(wednesday(X1)=>lion_lies(X1)),file('/tmp/SRASS.s.p', lion_lies_wednesday)).
% fof(35, axiom,![X1]:(thursday(X1)=>~(lion_lies(X1))),file('/tmp/SRASS.s.p', lion_does_not_lie_thursday)).
% fof(41, axiom,![X1]:(wednesday(X1)=>~(unicorn_lies(X1))),file('/tmp/SRASS.s.p', unicorn_does_not_lie_wednesday)).
% fof(42, axiom,![X1]:(thursday(X1)=>unicorn_lies(X1)),file('/tmp/SRASS.s.p', unicorn_lies_thursday)).
% fof(46, conjecture,?[X1]:((day(X1)&lies_on_one_of(a_lion,X1,yesterday(X1)))&lies_on_one_of(a_unicorn,X1,yesterday(X1))),file('/tmp/SRASS.s.p', prove_there_are_close_lying_days)).
% fof(47, negated_conjecture,~(?[X1]:((day(X1)&lies_on_one_of(a_lion,X1,yesterday(X1)))&lies_on_one_of(a_unicorn,X1,yesterday(X1)))),inference(assume_negation,[status(cth)],[46])).
% fof(50, plain,![X1]:(day(X1)=>![X2]:(day(X2)=>((~(lion_lies(X1))&~(lies_on_one_of(a_lion,X1,X2)))=>~(lion_lies(X2))))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(55, plain,![X1]:(day(X1)=>![X2]:(day(X2)=>((unicorn_lies(X1)&~(lies_on_one_of(a_unicorn,X1,X2)))=>unicorn_lies(X2)))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(56, plain,![X1]:(thursday(X1)=>~(lion_lies(X1))),inference(fof_simplification,[status(thm)],[35,theory(equality)])).
% fof(62, plain,![X1]:(wednesday(X1)=>~(unicorn_lies(X1))),inference(fof_simplification,[status(thm)],[41,theory(equality)])).
% fof(72, plain,![X1]:(~(day(X1))|![X2]:(~(day(X2))|((lion_lies(X1)|lies_on_one_of(a_lion,X1,X2))|~(lion_lies(X2))))),inference(fof_nnf,[status(thm)],[50])).
% fof(73, plain,![X3]:(~(day(X3))|![X4]:(~(day(X4))|((lion_lies(X3)|lies_on_one_of(a_lion,X3,X4))|~(lion_lies(X4))))),inference(variable_rename,[status(thm)],[72])).
% fof(74, plain,![X3]:![X4]:((~(day(X4))|((lion_lies(X3)|lies_on_one_of(a_lion,X3,X4))|~(lion_lies(X4))))|~(day(X3))),inference(shift_quantors,[status(thm)],[73])).
% cnf(75,plain,(lies_on_one_of(a_lion,X1,X2)|lion_lies(X1)|~day(X1)|~lion_lies(X2)|~day(X2)),inference(split_conjunct,[status(thm)],[74])).
% fof(92, plain,![X1]:(~(day(X1))|![X2]:(~(day(X2))|((~(unicorn_lies(X1))|lies_on_one_of(a_unicorn,X1,X2))|unicorn_lies(X2)))),inference(fof_nnf,[status(thm)],[55])).
% fof(93, plain,![X3]:(~(day(X3))|![X4]:(~(day(X4))|((~(unicorn_lies(X3))|lies_on_one_of(a_unicorn,X3,X4))|unicorn_lies(X4)))),inference(variable_rename,[status(thm)],[92])).
% fof(94, plain,![X3]:![X4]:((~(day(X4))|((~(unicorn_lies(X3))|lies_on_one_of(a_unicorn,X3,X4))|unicorn_lies(X4)))|~(day(X3))),inference(shift_quantors,[status(thm)],[93])).
% cnf(95,plain,(unicorn_lies(X2)|lies_on_one_of(a_unicorn,X1,X2)|~day(X1)|~unicorn_lies(X1)|~day(X2)),inference(split_conjunct,[status(thm)],[94])).
% fof(96, plain,![X1]:(~(lion_lies(X1))|day(X1)),inference(fof_nnf,[status(thm)],[9])).
% fof(97, plain,![X2]:(~(lion_lies(X2))|day(X2)),inference(variable_rename,[status(thm)],[96])).
% cnf(98,plain,(day(X1)|~lion_lies(X1)),inference(split_conjunct,[status(thm)],[97])).
% fof(99, plain,![X1]:(~(unicorn_lies(X1))|day(X1)),inference(fof_nnf,[status(thm)],[10])).
% fof(100, plain,![X2]:(~(unicorn_lies(X2))|day(X2)),inference(variable_rename,[status(thm)],[99])).
% cnf(101,plain,(day(X1)|~unicorn_lies(X1)),inference(split_conjunct,[status(thm)],[100])).
% fof(132, plain,![X1]:(~(thursday(X1))|wednesday(yesterday(X1))),inference(fof_nnf,[status(thm)],[21])).
% fof(133, plain,![X2]:(~(thursday(X2))|wednesday(yesterday(X2))),inference(variable_rename,[status(thm)],[132])).
% cnf(134,plain,(wednesday(yesterday(X1))|~thursday(X1)),inference(split_conjunct,[status(thm)],[133])).
% cnf(147,plain,(thursday(a_thursday)),inference(split_conjunct,[status(thm)],[28])).
% fof(157, plain,![X1]:(~(wednesday(X1))|lion_lies(X1)),inference(fof_nnf,[status(thm)],[34])).
% fof(158, plain,![X2]:(~(wednesday(X2))|lion_lies(X2)),inference(variable_rename,[status(thm)],[157])).
% cnf(159,plain,(lion_lies(X1)|~wednesday(X1)),inference(split_conjunct,[status(thm)],[158])).
% fof(160, plain,![X1]:(~(thursday(X1))|~(lion_lies(X1))),inference(fof_nnf,[status(thm)],[56])).
% fof(161, plain,![X2]:(~(thursday(X2))|~(lion_lies(X2))),inference(variable_rename,[status(thm)],[160])).
% cnf(162,plain,(~lion_lies(X1)|~thursday(X1)),inference(split_conjunct,[status(thm)],[161])).
% fof(178, plain,![X1]:(~(wednesday(X1))|~(unicorn_lies(X1))),inference(fof_nnf,[status(thm)],[62])).
% fof(179, plain,![X2]:(~(wednesday(X2))|~(unicorn_lies(X2))),inference(variable_rename,[status(thm)],[178])).
% cnf(180,plain,(~unicorn_lies(X1)|~wednesday(X1)),inference(split_conjunct,[status(thm)],[179])).
% fof(181, plain,![X1]:(~(thursday(X1))|unicorn_lies(X1)),inference(fof_nnf,[status(thm)],[42])).
% fof(182, plain,![X2]:(~(thursday(X2))|unicorn_lies(X2)),inference(variable_rename,[status(thm)],[181])).
% cnf(183,plain,(unicorn_lies(X1)|~thursday(X1)),inference(split_conjunct,[status(thm)],[182])).
% fof(193, negated_conjecture,![X1]:((~(day(X1))|~(lies_on_one_of(a_lion,X1,yesterday(X1))))|~(lies_on_one_of(a_unicorn,X1,yesterday(X1)))),inference(fof_nnf,[status(thm)],[47])).
% fof(194, negated_conjecture,![X2]:((~(day(X2))|~(lies_on_one_of(a_lion,X2,yesterday(X2))))|~(lies_on_one_of(a_unicorn,X2,yesterday(X2)))),inference(variable_rename,[status(thm)],[193])).
% cnf(195,negated_conjecture,(~lies_on_one_of(a_unicorn,X1,yesterday(X1))|~lies_on_one_of(a_lion,X1,yesterday(X1))|~day(X1)),inference(split_conjunct,[status(thm)],[194])).
% cnf(197,plain,(lies_on_one_of(a_lion,X1,X2)|lion_lies(X1)|~lion_lies(X2)|~day(X1)),inference(csr,[status(thm)],[75,98])).
% cnf(198,plain,(unicorn_lies(X2)|lies_on_one_of(a_unicorn,X1,X2)|~unicorn_lies(X1)|~day(X2)),inference(csr,[status(thm)],[95,101])).
% cnf(223,plain,(lion_lies(yesterday(X1))|~thursday(X1)),inference(spm,[status(thm)],[159,134,theory(equality)])).
% cnf(241,plain,(~unicorn_lies(yesterday(X1))|~thursday(X1)),inference(spm,[status(thm)],[180,134,theory(equality)])).
% cnf(251,negated_conjecture,(unicorn_lies(yesterday(X1))|~lies_on_one_of(a_lion,X1,yesterday(X1))|~day(X1)|~unicorn_lies(X1)|~day(yesterday(X1))),inference(spm,[status(thm)],[195,198,theory(equality)])).
% cnf(309,negated_conjecture,(unicorn_lies(yesterday(X1))|~unicorn_lies(X1)|~lies_on_one_of(a_lion,X1,yesterday(X1))|~day(yesterday(X1))),inference(csr,[status(thm)],[251,101])).
% cnf(311,negated_conjecture,(unicorn_lies(yesterday(X1))|lion_lies(X1)|~unicorn_lies(X1)|~day(yesterday(X1))|~lion_lies(yesterday(X1))|~day(X1)),inference(spm,[status(thm)],[309,197,theory(equality)])).
% cnf(380,negated_conjecture,(unicorn_lies(yesterday(X1))|lion_lies(X1)|~unicorn_lies(X1)|~lion_lies(yesterday(X1))|~day(yesterday(X1))),inference(csr,[status(thm)],[311,101])).
% cnf(381,negated_conjecture,(unicorn_lies(yesterday(X1))|lion_lies(X1)|~unicorn_lies(X1)|~lion_lies(yesterday(X1))),inference(csr,[status(thm)],[380,98])).
% cnf(385,negated_conjecture,(lion_lies(X1)|~thursday(X1)|~unicorn_lies(X1)|~lion_lies(yesterday(X1))),inference(spm,[status(thm)],[241,381,theory(equality)])).
% cnf(401,negated_conjecture,(lion_lies(X1)|~thursday(X1)|~unicorn_lies(X1)),inference(csr,[status(thm)],[385,223])).
% cnf(402,negated_conjecture,(lion_lies(X1)|~thursday(X1)),inference(csr,[status(thm)],[401,183])).
% cnf(403,negated_conjecture,(~thursday(X1)),inference(csr,[status(thm)],[402,162])).
% cnf(405,plain,($false),inference(sr,[status(thm)],[147,403,theory(equality)])).
% cnf(406,plain,($false),405,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 214
% # ...of these trivial : 0
% # ...subsumed : 32
% # ...remaining for further processing: 182
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 155
% # ...of the previous two non-trivial : 134
% # Contextual simplify-reflections : 49
% # Paramodulations : 154
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 135
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 26
% # Non-unit-clauses : 90
% # Current number of unprocessed clauses: 12
% # ...number of literals in the above : 26
% # Clause-clause subsumption calls (NU) : 174
% # Rec. Clause-clause subsumption calls : 168
% # Unit Clause-clause subsumption calls : 292
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 77 leaves, 1.09+/-0.367 terms/leaf
% # Paramod-from index: 31 leaves, 1.03+/-0.177 terms/leaf
% # Paramod-into index: 75 leaves, 1.05+/-0.322 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.006 s
% # Total time : 0.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.20 WC
% FINAL PrfWatch: 0.13 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP18267/PUZ005+1.tptp
%
%------------------------------------------------------------------------------