TSTP Solution File: HAL003+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : HAL003+3 : TPTP v5.0.0. Released v2.6.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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 07:25:15 EST 2010
% Result : Theorem 0.97s
% Output : Solution 0.97s
% 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/SystemOnTPTP23914/HAL003+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23914/HAL003+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23914/HAL003+3.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 24010
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(8, axiom,![X1]:![X2]:![X3]:((morphism(X1,X2,X3)&![X4]:(element(X4,X3)=>?[X5]:(element(X5,X2)&apply(X1,X5)=X4)))=>surjection(X1)),file('/tmp/SRASS.s.p', properties_for_surjection)).
% fof(12, axiom,morphism(g,b,e),file('/tmp/SRASS.s.p', g_morphism)).
% fof(14, axiom,![X6]:(element(X6,e)=>?[X7]:?[X8]:((element(X7,b)&element(X8,b))&apply(g,subtract(b,X7,X8))=X6)),file('/tmp/SRASS.s.p', lemma12)).
% fof(19, axiom,![X2]:![X12]:![X13]:((element(X12,X2)&element(X13,X2))=>element(subtract(X2,X12,X13),X2)),file('/tmp/SRASS.s.p', subtract_in_domain)).
% fof(34, conjecture,surjection(g),file('/tmp/SRASS.s.p', g_surjection)).
% fof(35, negated_conjecture,~(surjection(g)),inference(assume_negation,[status(cth)],[34])).
% fof(36, negated_conjecture,~(surjection(g)),inference(fof_simplification,[status(thm)],[35,theory(equality)])).
% fof(50, plain,![X1]:![X2]:![X3]:((~(morphism(X1,X2,X3))|?[X4]:(element(X4,X3)&![X5]:(~(element(X5,X2))|~(apply(X1,X5)=X4))))|surjection(X1)),inference(fof_nnf,[status(thm)],[8])).
% fof(51, plain,![X6]:![X7]:![X8]:((~(morphism(X6,X7,X8))|?[X9]:(element(X9,X8)&![X10]:(~(element(X10,X7))|~(apply(X6,X10)=X9))))|surjection(X6)),inference(variable_rename,[status(thm)],[50])).
% fof(52, plain,![X6]:![X7]:![X8]:((~(morphism(X6,X7,X8))|(element(esk2_3(X6,X7,X8),X8)&![X10]:(~(element(X10,X7))|~(apply(X6,X10)=esk2_3(X6,X7,X8)))))|surjection(X6)),inference(skolemize,[status(esa)],[51])).
% fof(53, plain,![X6]:![X7]:![X8]:![X10]:((((~(element(X10,X7))|~(apply(X6,X10)=esk2_3(X6,X7,X8)))&element(esk2_3(X6,X7,X8),X8))|~(morphism(X6,X7,X8)))|surjection(X6)),inference(shift_quantors,[status(thm)],[52])).
% fof(54, plain,![X6]:![X7]:![X8]:![X10]:((((~(element(X10,X7))|~(apply(X6,X10)=esk2_3(X6,X7,X8)))|~(morphism(X6,X7,X8)))|surjection(X6))&((element(esk2_3(X6,X7,X8),X8)|~(morphism(X6,X7,X8)))|surjection(X6))),inference(distribute,[status(thm)],[53])).
% cnf(55,plain,(surjection(X1)|element(esk2_3(X1,X2,X3),X3)|~morphism(X1,X2,X3)),inference(split_conjunct,[status(thm)],[54])).
% cnf(56,plain,(surjection(X1)|~morphism(X1,X2,X3)|apply(X1,X4)!=esk2_3(X1,X2,X3)|~element(X4,X2)),inference(split_conjunct,[status(thm)],[54])).
% cnf(60,plain,(morphism(g,b,e)),inference(split_conjunct,[status(thm)],[12])).
% fof(62, plain,![X6]:(~(element(X6,e))|?[X7]:?[X8]:((element(X7,b)&element(X8,b))&apply(g,subtract(b,X7,X8))=X6)),inference(fof_nnf,[status(thm)],[14])).
% fof(63, plain,![X9]:(~(element(X9,e))|?[X10]:?[X11]:((element(X10,b)&element(X11,b))&apply(g,subtract(b,X10,X11))=X9)),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X9]:(~(element(X9,e))|((element(esk3_1(X9),b)&element(esk4_1(X9),b))&apply(g,subtract(b,esk3_1(X9),esk4_1(X9)))=X9)),inference(skolemize,[status(esa)],[63])).
% fof(65, plain,![X9]:(((element(esk3_1(X9),b)|~(element(X9,e)))&(element(esk4_1(X9),b)|~(element(X9,e))))&(apply(g,subtract(b,esk3_1(X9),esk4_1(X9)))=X9|~(element(X9,e)))),inference(distribute,[status(thm)],[64])).
% cnf(66,plain,(apply(g,subtract(b,esk3_1(X1),esk4_1(X1)))=X1|~element(X1,e)),inference(split_conjunct,[status(thm)],[65])).
% cnf(67,plain,(element(esk4_1(X1),b)|~element(X1,e)),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,plain,(element(esk3_1(X1),b)|~element(X1,e)),inference(split_conjunct,[status(thm)],[65])).
% fof(90, plain,![X2]:![X12]:![X13]:((~(element(X12,X2))|~(element(X13,X2)))|element(subtract(X2,X12,X13),X2)),inference(fof_nnf,[status(thm)],[19])).
% fof(91, plain,![X14]:![X15]:![X16]:((~(element(X15,X14))|~(element(X16,X14)))|element(subtract(X14,X15,X16),X14)),inference(variable_rename,[status(thm)],[90])).
% cnf(92,plain,(element(subtract(X1,X2,X3),X1)|~element(X3,X1)|~element(X2,X1)),inference(split_conjunct,[status(thm)],[91])).
% cnf(154,negated_conjecture,(~surjection(g)),inference(split_conjunct,[status(thm)],[36])).
% cnf(186,plain,(surjection(X1)|esk2_3(X1,X2,X3)!=apply(X1,subtract(X2,X4,X5))|~morphism(X1,X2,X3)|~element(X5,X2)|~element(X4,X2)),inference(spm,[status(thm)],[56,92,theory(equality)])).
% cnf(813,plain,(surjection(g)|esk2_3(g,b,X1)!=X2|~element(esk4_1(X2),b)|~element(esk3_1(X2),b)|~morphism(g,b,X1)|~element(X2,e)),inference(spm,[status(thm)],[186,66,theory(equality)])).
% cnf(814,plain,(esk2_3(g,b,X1)!=X2|~element(esk4_1(X2),b)|~element(esk3_1(X2),b)|~morphism(g,b,X1)|~element(X2,e)),inference(sr,[status(thm)],[813,154,theory(equality)])).
% cnf(815,plain,(esk2_3(g,b,X1)!=X2|~element(esk4_1(X2),b)|~element(X2,e)|~morphism(g,b,X1)),inference(csr,[status(thm)],[814,68])).
% cnf(816,plain,(esk2_3(g,b,X1)!=X2|~element(X2,e)|~morphism(g,b,X1)),inference(csr,[status(thm)],[815,67])).
% cnf(817,plain,(~element(esk2_3(g,b,X1),e)|~morphism(g,b,X1)),inference(er,[status(thm)],[816,theory(equality)])).
% cnf(818,plain,(surjection(g)|~morphism(g,b,e)),inference(spm,[status(thm)],[817,55,theory(equality)])).
% cnf(819,plain,(surjection(g)|$false),inference(rw,[status(thm)],[818,60,theory(equality)])).
% cnf(820,plain,(surjection(g)),inference(cn,[status(thm)],[819,theory(equality)])).
% cnf(821,plain,($false),inference(sr,[status(thm)],[820,154,theory(equality)])).
% cnf(822,plain,($false),821,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 254
% # ...of these trivial : 14
% # ...subsumed : 22
% # ...remaining for further processing: 218
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 8
% # Generated clauses : 428
% # ...of the previous two non-trivial : 326
% # Contextual simplify-reflections : 24
% # Paramodulations : 416
% # Factorizations : 0
% # Equation resolutions : 9
% # Current number of processed clauses: 144
% # Positive orientable unit clauses: 31
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 111
% # Current number of unprocessed clauses: 151
% # ...number of literals in the above : 889
% # Clause-clause subsumption calls (NU) : 369
% # Rec. Clause-clause subsumption calls : 165
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 195 leaves, 1.59+/-2.255 terms/leaf
% # Paramod-from index: 73 leaves, 1.04+/-0.258 terms/leaf
% # Paramod-into index: 150 leaves, 1.29+/-0.882 terms/leaf
% # -------------------------------------------------
% # User time : 0.045 s
% # System time : 0.008 s
% # Total time : 0.053 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.24 WC
% FINAL PrfWatch: 0.15 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP23914/HAL003+3.tptp
%
%------------------------------------------------------------------------------