TSTP Solution File: CSR051+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR051+1 : TPTP v5.0.0. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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 : Tue Dec 28 23:31:58 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP22484/CSR051+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP22484/CSR051+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22484/CSR051+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 22580
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(mtvisible(c_tptp_member3356_mt)=>marriagelicensedocument(c_tptpmarriagelicensedocument)),file('/tmp/SRASS.s.p', just1)).
% fof(28, conjecture,?[X1]:(mtvisible(c_tptp_member3356_mt)=>marriagelicensedocument(X1)),file('/tmp/SRASS.s.p', query51)).
% fof(29, negated_conjecture,~(?[X1]:(mtvisible(c_tptp_member3356_mt)=>marriagelicensedocument(X1))),inference(assume_negation,[status(cth)],[28])).
% fof(30, plain,(~(mtvisible(c_tptp_member3356_mt))|marriagelicensedocument(c_tptpmarriagelicensedocument)),inference(fof_nnf,[status(thm)],[1])).
% cnf(31,plain,(marriagelicensedocument(c_tptpmarriagelicensedocument)|~mtvisible(c_tptp_member3356_mt)),inference(split_conjunct,[status(thm)],[30])).
% fof(108, negated_conjecture,![X1]:(mtvisible(c_tptp_member3356_mt)&~(marriagelicensedocument(X1))),inference(fof_nnf,[status(thm)],[29])).
% fof(109, negated_conjecture,![X2]:(mtvisible(c_tptp_member3356_mt)&~(marriagelicensedocument(X2))),inference(variable_rename,[status(thm)],[108])).
% cnf(110,negated_conjecture,(~marriagelicensedocument(X1)),inference(split_conjunct,[status(thm)],[109])).
% cnf(111,negated_conjecture,(mtvisible(c_tptp_member3356_mt)),inference(split_conjunct,[status(thm)],[109])).
% cnf(112,plain,(marriagelicensedocument(c_tptpmarriagelicensedocument)|$false),inference(rw,[status(thm)],[31,111,theory(equality)])).
% cnf(113,plain,(marriagelicensedocument(c_tptpmarriagelicensedocument)),inference(cn,[status(thm)],[112,theory(equality)])).
% cnf(114,plain,($false),inference(sr,[status(thm)],[113,110,theory(equality)])).
% cnf(115,plain,($false),114,['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: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 25
% # ...number of literals in the above : 58
% # 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: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 5 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.003 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP22484/CSR051+1.tptp
%
%------------------------------------------------------------------------------