TSTP Solution File: ALG211+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : ALG211+1 : TPTP v5.0.0. Released v3.1.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 21:04:59 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP8425/ALG211+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP8425/ALG211+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8425/ALG211+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 8521
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(a_vector_space(X1)=>?[X2]:basis_of(X2,X1)),file('/tmp/SRASS.s.p', bg_remark_63_a)).
% fof(2, axiom,![X1]:![X2]:(a_vector_subspace_of(X1,X2)=>a_vector_space(X1)),file('/tmp/SRASS.s.p', bg_2_4_a)).
% fof(3, axiom,![X3]:![X4]:![X5]:((lin_ind_subset(X3,X5)&basis_of(X4,X5))=>?[X6]:(a_subset_of(X6,X4)&basis_of(union(X3,X6),X5))),file('/tmp/SRASS.s.p', bg_2_2_5)).
% fof(4, axiom,![X2]:![X5]:(basis_of(X2,X5)=>(lin_ind_subset(X2,X5)&a_subset_of(X2,vec_to_class(X5)))),file('/tmp/SRASS.s.p', basis_of)).
% fof(5, axiom,![X7]:![X5]:![X8]:((a_vector_subspace_of(X7,X5)&a_subset_of(X8,vec_to_class(X7)))=>(lin_ind_subset(X8,X7)<=>lin_ind_subset(X8,X5))),file('/tmp/SRASS.s.p', bg_2_4_2)).
% fof(6, conjecture,![X7]:![X5]:((a_vector_subspace_of(X7,X5)&a_vector_space(X5))=>?[X8]:?[X9]:(basis_of(union(X8,X9),X5)&basis_of(X8,X7))),file('/tmp/SRASS.s.p', bg_2_4_3)).
% fof(7, negated_conjecture,~(![X7]:![X5]:((a_vector_subspace_of(X7,X5)&a_vector_space(X5))=>?[X8]:?[X9]:(basis_of(union(X8,X9),X5)&basis_of(X8,X7)))),inference(assume_negation,[status(cth)],[6])).
% fof(8, plain,![X1]:(~(a_vector_space(X1))|?[X2]:basis_of(X2,X1)),inference(fof_nnf,[status(thm)],[1])).
% fof(9, plain,![X3]:(~(a_vector_space(X3))|?[X4]:basis_of(X4,X3)),inference(variable_rename,[status(thm)],[8])).
% fof(10, plain,![X3]:(~(a_vector_space(X3))|basis_of(esk1_1(X3),X3)),inference(skolemize,[status(esa)],[9])).
% cnf(11,plain,(basis_of(esk1_1(X1),X1)|~a_vector_space(X1)),inference(split_conjunct,[status(thm)],[10])).
% fof(12, plain,![X1]:![X2]:(~(a_vector_subspace_of(X1,X2))|a_vector_space(X1)),inference(fof_nnf,[status(thm)],[2])).
% fof(13, plain,![X3]:![X4]:(~(a_vector_subspace_of(X3,X4))|a_vector_space(X3)),inference(variable_rename,[status(thm)],[12])).
% cnf(14,plain,(a_vector_space(X1)|~a_vector_subspace_of(X1,X2)),inference(split_conjunct,[status(thm)],[13])).
% fof(15, plain,![X3]:![X4]:![X5]:((~(lin_ind_subset(X3,X5))|~(basis_of(X4,X5)))|?[X6]:(a_subset_of(X6,X4)&basis_of(union(X3,X6),X5))),inference(fof_nnf,[status(thm)],[3])).
% fof(16, plain,![X7]:![X8]:![X9]:((~(lin_ind_subset(X7,X9))|~(basis_of(X8,X9)))|?[X10]:(a_subset_of(X10,X8)&basis_of(union(X7,X10),X9))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,![X7]:![X8]:![X9]:((~(lin_ind_subset(X7,X9))|~(basis_of(X8,X9)))|(a_subset_of(esk2_3(X7,X8,X9),X8)&basis_of(union(X7,esk2_3(X7,X8,X9)),X9))),inference(skolemize,[status(esa)],[16])).
% fof(18, plain,![X7]:![X8]:![X9]:((a_subset_of(esk2_3(X7,X8,X9),X8)|(~(lin_ind_subset(X7,X9))|~(basis_of(X8,X9))))&(basis_of(union(X7,esk2_3(X7,X8,X9)),X9)|(~(lin_ind_subset(X7,X9))|~(basis_of(X8,X9))))),inference(distribute,[status(thm)],[17])).
% cnf(19,plain,(basis_of(union(X3,esk2_3(X3,X1,X2)),X2)|~basis_of(X1,X2)|~lin_ind_subset(X3,X2)),inference(split_conjunct,[status(thm)],[18])).
% fof(21, plain,![X2]:![X5]:(~(basis_of(X2,X5))|(lin_ind_subset(X2,X5)&a_subset_of(X2,vec_to_class(X5)))),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,![X6]:![X7]:(~(basis_of(X6,X7))|(lin_ind_subset(X6,X7)&a_subset_of(X6,vec_to_class(X7)))),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X6]:![X7]:((lin_ind_subset(X6,X7)|~(basis_of(X6,X7)))&(a_subset_of(X6,vec_to_class(X7))|~(basis_of(X6,X7)))),inference(distribute,[status(thm)],[22])).
% cnf(24,plain,(a_subset_of(X1,vec_to_class(X2))|~basis_of(X1,X2)),inference(split_conjunct,[status(thm)],[23])).
% cnf(25,plain,(lin_ind_subset(X1,X2)|~basis_of(X1,X2)),inference(split_conjunct,[status(thm)],[23])).
% fof(26, plain,![X7]:![X5]:![X8]:((~(a_vector_subspace_of(X7,X5))|~(a_subset_of(X8,vec_to_class(X7))))|((~(lin_ind_subset(X8,X7))|lin_ind_subset(X8,X5))&(~(lin_ind_subset(X8,X5))|lin_ind_subset(X8,X7)))),inference(fof_nnf,[status(thm)],[5])).
% fof(27, plain,![X9]:![X10]:![X11]:((~(a_vector_subspace_of(X9,X10))|~(a_subset_of(X11,vec_to_class(X9))))|((~(lin_ind_subset(X11,X9))|lin_ind_subset(X11,X10))&(~(lin_ind_subset(X11,X10))|lin_ind_subset(X11,X9)))),inference(variable_rename,[status(thm)],[26])).
% fof(28, plain,![X9]:![X10]:![X11]:(((~(lin_ind_subset(X11,X9))|lin_ind_subset(X11,X10))|(~(a_vector_subspace_of(X9,X10))|~(a_subset_of(X11,vec_to_class(X9)))))&((~(lin_ind_subset(X11,X10))|lin_ind_subset(X11,X9))|(~(a_vector_subspace_of(X9,X10))|~(a_subset_of(X11,vec_to_class(X9)))))),inference(distribute,[status(thm)],[27])).
% cnf(30,plain,(lin_ind_subset(X1,X3)|~a_subset_of(X1,vec_to_class(X2))|~a_vector_subspace_of(X2,X3)|~lin_ind_subset(X1,X2)),inference(split_conjunct,[status(thm)],[28])).
% fof(31, negated_conjecture,?[X7]:?[X5]:((a_vector_subspace_of(X7,X5)&a_vector_space(X5))&![X8]:![X9]:(~(basis_of(union(X8,X9),X5))|~(basis_of(X8,X7)))),inference(fof_nnf,[status(thm)],[7])).
% fof(32, negated_conjecture,?[X10]:?[X11]:((a_vector_subspace_of(X10,X11)&a_vector_space(X11))&![X12]:![X13]:(~(basis_of(union(X12,X13),X11))|~(basis_of(X12,X10)))),inference(variable_rename,[status(thm)],[31])).
% fof(33, negated_conjecture,((a_vector_subspace_of(esk3_0,esk4_0)&a_vector_space(esk4_0))&![X12]:![X13]:(~(basis_of(union(X12,X13),esk4_0))|~(basis_of(X12,esk3_0)))),inference(skolemize,[status(esa)],[32])).
% fof(34, negated_conjecture,![X12]:![X13]:((~(basis_of(union(X12,X13),esk4_0))|~(basis_of(X12,esk3_0)))&(a_vector_subspace_of(esk3_0,esk4_0)&a_vector_space(esk4_0))),inference(shift_quantors,[status(thm)],[33])).
% cnf(35,negated_conjecture,(a_vector_space(esk4_0)),inference(split_conjunct,[status(thm)],[34])).
% cnf(36,negated_conjecture,(a_vector_subspace_of(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[34])).
% cnf(37,negated_conjecture,(~basis_of(X1,esk3_0)|~basis_of(union(X1,X2),esk4_0)),inference(split_conjunct,[status(thm)],[34])).
% cnf(38,negated_conjecture,(a_vector_space(esk3_0)),inference(spm,[status(thm)],[14,36,theory(equality)])).
% cnf(39,negated_conjecture,(~basis_of(X1,esk3_0)|~lin_ind_subset(X1,esk4_0)|~basis_of(X2,esk4_0)),inference(spm,[status(thm)],[37,19,theory(equality)])).
% cnf(41,plain,(lin_ind_subset(X1,X2)|~lin_ind_subset(X1,X3)|~a_vector_subspace_of(X3,X2)|~basis_of(X1,X3)),inference(spm,[status(thm)],[30,24,theory(equality)])).
% cnf(44,plain,(lin_ind_subset(X1,X2)|~a_vector_subspace_of(X3,X2)|~basis_of(X1,X3)),inference(csr,[status(thm)],[41,25])).
% cnf(45,negated_conjecture,(lin_ind_subset(X1,esk4_0)|~basis_of(X1,esk3_0)),inference(spm,[status(thm)],[44,36,theory(equality)])).
% cnf(46,negated_conjecture,(~basis_of(X2,esk4_0)|~basis_of(X1,esk3_0)),inference(csr,[status(thm)],[39,45])).
% fof(47, plain,(~(epred1_0)<=>![X1]:~(basis_of(X1,esk3_0))),introduced(definition),['split']).
% cnf(48,plain,(epred1_0|~basis_of(X1,esk3_0)),inference(split_equiv,[status(thm)],[47])).
% fof(49, plain,(~(epred2_0)<=>![X2]:~(basis_of(X2,esk4_0))),introduced(definition),['split']).
% cnf(50,plain,(epred2_0|~basis_of(X2,esk4_0)),inference(split_equiv,[status(thm)],[49])).
% cnf(51,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[46,47,theory(equality)]),49,theory(equality)]),['split']).
% cnf(54,negated_conjecture,(epred1_0|~a_vector_space(esk3_0)),inference(spm,[status(thm)],[48,11,theory(equality)])).
% cnf(56,negated_conjecture,(epred1_0|$false),inference(rw,[status(thm)],[54,38,theory(equality)])).
% cnf(57,negated_conjecture,(epred1_0),inference(cn,[status(thm)],[56,theory(equality)])).
% cnf(58,negated_conjecture,(~epred2_0|$false),inference(rw,[status(thm)],[51,57,theory(equality)])).
% cnf(59,negated_conjecture,(~epred2_0),inference(cn,[status(thm)],[58,theory(equality)])).
% cnf(61,negated_conjecture,(~basis_of(X2,esk4_0)),inference(sr,[status(thm)],[50,59,theory(equality)])).
% cnf(62,negated_conjecture,(~a_vector_space(esk4_0)),inference(spm,[status(thm)],[61,11,theory(equality)])).
% cnf(64,negated_conjecture,($false),inference(rw,[status(thm)],[62,35,theory(equality)])).
% cnf(65,negated_conjecture,($false),inference(cn,[status(thm)],[64,theory(equality)])).
% cnf(66,negated_conjecture,($false),65,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 32
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 32
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 16
% # ...of the previous two non-trivial : 15
% # Contextual simplify-reflections : 2
% # Paramodulations : 13
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 18
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 4
% # ...number of literals in the above : 19
% # Clause-clause subsumption calls (NU) : 22
% # Rec. Clause-clause subsumption calls : 22
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 28 leaves, 1.32+/-0.710 terms/leaf
% # Paramod-from index: 10 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 23 leaves, 1.13+/-0.337 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.002 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP8425/ALG211+1.tptp
%
%------------------------------------------------------------------------------