TSTP Solution File: MSC011+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MSC011+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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 16:12:01 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP5213/MSC011+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP5213/MSC011+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5213/MSC011+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 5309
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.008 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:((drunk(X1)¬_drunk(X1))=>goal),file('/tmp/SRASS.s.p', d_cons)).
% fof(2, axiom,![X1]:(drunk(X1)&neg_psi),file('/tmp/SRASS.s.p', neg_phi)).
% fof(3, axiom,(neg_psi=>?[X1]:not_drunk(X1)),file('/tmp/SRASS.s.p', neg_psi_ax)).
% fof(4, conjecture,goal,file('/tmp/SRASS.s.p', goal_to_be_proved)).
% fof(5, negated_conjecture,~(goal),inference(assume_negation,[status(cth)],[4])).
% fof(6, negated_conjecture,~(goal),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(7, plain,![X1]:((~(drunk(X1))|~(not_drunk(X1)))|goal),inference(fof_nnf,[status(thm)],[1])).
% fof(8, plain,![X2]:((~(drunk(X2))|~(not_drunk(X2)))|goal),inference(variable_rename,[status(thm)],[7])).
% cnf(9,plain,(goal|~not_drunk(X1)|~drunk(X1)),inference(split_conjunct,[status(thm)],[8])).
% fof(10, plain,![X2]:(drunk(X2)&neg_psi),inference(variable_rename,[status(thm)],[2])).
% cnf(11,plain,(neg_psi),inference(split_conjunct,[status(thm)],[10])).
% cnf(12,plain,(drunk(X1)),inference(split_conjunct,[status(thm)],[10])).
% fof(13, plain,(~(neg_psi)|?[X1]:not_drunk(X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(14, plain,(~(neg_psi)|?[X2]:not_drunk(X2)),inference(variable_rename,[status(thm)],[13])).
% fof(15, plain,(~(neg_psi)|not_drunk(esk1_0)),inference(skolemize,[status(esa)],[14])).
% cnf(16,plain,(not_drunk(esk1_0)|~neg_psi),inference(split_conjunct,[status(thm)],[15])).
% cnf(17,negated_conjecture,(~goal),inference(split_conjunct,[status(thm)],[6])).
% cnf(18,plain,(goal|$false|~not_drunk(X1)),inference(rw,[status(thm)],[9,12,theory(equality)]),['unfolding']).
% cnf(19,plain,(~not_drunk(X1)),inference(sr,[status(thm)],[18,17,theory(equality)])).
% cnf(20,plain,(not_drunk(esk1_0)|$false),inference(rw,[status(thm)],[16,11,theory(equality)])).
% cnf(21,plain,(not_drunk(esk1_0)),inference(cn,[status(thm)],[20,theory(equality)])).
% cnf(22,plain,($false),inference(sr,[status(thm)],[21,19,theory(equality)])).
% cnf(23,plain,($false),22,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 4
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 3
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # 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: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 1 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 3 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.006 s
% # System time : 0.002 s
% # Total time : 0.008 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP5213/MSC011+1.tptp
%
%------------------------------------------------------------------------------