TSTP Solution File: LAT300+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LAT300+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 : art02.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 09:53:50 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/SystemOnTPTP14400/LAT300+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14400/LAT300+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14400/LAT300+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 14496
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:?[X2]:m1_subset_1(X2,X1),file('/tmp/SRASS.s.p', existence_m1_subset_1)).
% fof(6, axiom,![X1]:![X2]:(m1_subset_1(X1,X2)=>(v1_xboole_0(X2)|r2_hidden(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(8, axiom,![X1]:(((~(v3_struct_0(X1))&v10_lattices(X1))&l3_lattices(X1))=>![X2]:(m2_lattice4(X2,X1)=>m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))))),file('/tmp/SRASS.s.p', dt_m2_lattice4)).
% fof(9, axiom,![X1]:(((~(v3_struct_0(X1))&v10_lattices(X1))&l3_lattices(X1))=>![X2]:(m2_filter_2(X2,X1)=>(~(v1_xboole_0(X2))&m2_lattice4(X2,X1)))),file('/tmp/SRASS.s.p', dt_m2_filter_2)).
% fof(10, axiom,![X1]:![X2]:![X3]:((r2_hidden(X1,X2)&m1_subset_1(X2,k1_zfmisc_1(X3)))=>m1_subset_1(X1,X3)),file('/tmp/SRASS.s.p', t4_subset)).
% fof(44, conjecture,![X1]:(((~(v3_struct_0(X1))&v10_lattices(X1))&l3_lattices(X1))=>![X2]:(m2_filter_2(X2,X1)=>?[X3]:(m1_subset_1(X3,u1_struct_0(X1))&r2_hidden(X3,X2)))),file('/tmp/SRASS.s.p', t24_filter_2)).
% fof(45, negated_conjecture,~(![X1]:(((~(v3_struct_0(X1))&v10_lattices(X1))&l3_lattices(X1))=>![X2]:(m2_filter_2(X2,X1)=>?[X3]:(m1_subset_1(X3,u1_struct_0(X1))&r2_hidden(X3,X2))))),inference(assume_negation,[status(cth)],[44])).
% fof(49, plain,![X1]:(((~(v3_struct_0(X1))&v10_lattices(X1))&l3_lattices(X1))=>![X2]:(m2_lattice4(X2,X1)=>m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(50, plain,![X1]:(((~(v3_struct_0(X1))&v10_lattices(X1))&l3_lattices(X1))=>![X2]:(m2_filter_2(X2,X1)=>(~(v1_xboole_0(X2))&m2_lattice4(X2,X1)))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(63, negated_conjecture,~(![X1]:(((~(v3_struct_0(X1))&v10_lattices(X1))&l3_lattices(X1))=>![X2]:(m2_filter_2(X2,X1)=>?[X3]:(m1_subset_1(X3,u1_struct_0(X1))&r2_hidden(X3,X2))))),inference(fof_simplification,[status(thm)],[45,theory(equality)])).
% fof(70, plain,![X3]:?[X4]:m1_subset_1(X4,X3),inference(variable_rename,[status(thm)],[3])).
% fof(71, plain,![X3]:m1_subset_1(esk2_1(X3),X3),inference(skolemize,[status(esa)],[70])).
% cnf(72,plain,(m1_subset_1(esk2_1(X1),X1)),inference(split_conjunct,[status(thm)],[71])).
% fof(80, plain,![X1]:![X2]:(~(m1_subset_1(X1,X2))|(v1_xboole_0(X2)|r2_hidden(X1,X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(81, plain,![X3]:![X4]:(~(m1_subset_1(X3,X4))|(v1_xboole_0(X4)|r2_hidden(X3,X4))),inference(variable_rename,[status(thm)],[80])).
% cnf(82,plain,(r2_hidden(X1,X2)|v1_xboole_0(X2)|~m1_subset_1(X1,X2)),inference(split_conjunct,[status(thm)],[81])).
% fof(87, plain,![X1]:(((v3_struct_0(X1)|~(v10_lattices(X1)))|~(l3_lattices(X1)))|![X2]:(~(m2_lattice4(X2,X1))|m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))))),inference(fof_nnf,[status(thm)],[49])).
% fof(88, plain,![X3]:(((v3_struct_0(X3)|~(v10_lattices(X3)))|~(l3_lattices(X3)))|![X4]:(~(m2_lattice4(X4,X3))|m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3))))),inference(variable_rename,[status(thm)],[87])).
% fof(89, plain,![X3]:![X4]:((~(m2_lattice4(X4,X3))|m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3))))|((v3_struct_0(X3)|~(v10_lattices(X3)))|~(l3_lattices(X3)))),inference(shift_quantors,[status(thm)],[88])).
% cnf(90,plain,(v3_struct_0(X1)|m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))|~l3_lattices(X1)|~v10_lattices(X1)|~m2_lattice4(X2,X1)),inference(split_conjunct,[status(thm)],[89])).
% fof(91, plain,![X1]:(((v3_struct_0(X1)|~(v10_lattices(X1)))|~(l3_lattices(X1)))|![X2]:(~(m2_filter_2(X2,X1))|(~(v1_xboole_0(X2))&m2_lattice4(X2,X1)))),inference(fof_nnf,[status(thm)],[50])).
% fof(92, plain,![X3]:(((v3_struct_0(X3)|~(v10_lattices(X3)))|~(l3_lattices(X3)))|![X4]:(~(m2_filter_2(X4,X3))|(~(v1_xboole_0(X4))&m2_lattice4(X4,X3)))),inference(variable_rename,[status(thm)],[91])).
% fof(93, plain,![X3]:![X4]:((~(m2_filter_2(X4,X3))|(~(v1_xboole_0(X4))&m2_lattice4(X4,X3)))|((v3_struct_0(X3)|~(v10_lattices(X3)))|~(l3_lattices(X3)))),inference(shift_quantors,[status(thm)],[92])).
% fof(94, plain,![X3]:![X4]:(((~(v1_xboole_0(X4))|~(m2_filter_2(X4,X3)))|((v3_struct_0(X3)|~(v10_lattices(X3)))|~(l3_lattices(X3))))&((m2_lattice4(X4,X3)|~(m2_filter_2(X4,X3)))|((v3_struct_0(X3)|~(v10_lattices(X3)))|~(l3_lattices(X3))))),inference(distribute,[status(thm)],[93])).
% cnf(95,plain,(v3_struct_0(X1)|m2_lattice4(X2,X1)|~l3_lattices(X1)|~v10_lattices(X1)|~m2_filter_2(X2,X1)),inference(split_conjunct,[status(thm)],[94])).
% cnf(96,plain,(v3_struct_0(X1)|~l3_lattices(X1)|~v10_lattices(X1)|~m2_filter_2(X2,X1)|~v1_xboole_0(X2)),inference(split_conjunct,[status(thm)],[94])).
% fof(97, plain,![X1]:![X2]:![X3]:((~(r2_hidden(X1,X2))|~(m1_subset_1(X2,k1_zfmisc_1(X3))))|m1_subset_1(X1,X3)),inference(fof_nnf,[status(thm)],[10])).
% fof(98, plain,![X4]:![X5]:![X6]:((~(r2_hidden(X4,X5))|~(m1_subset_1(X5,k1_zfmisc_1(X6))))|m1_subset_1(X4,X6)),inference(variable_rename,[status(thm)],[97])).
% cnf(99,plain,(m1_subset_1(X1,X2)|~m1_subset_1(X3,k1_zfmisc_1(X2))|~r2_hidden(X1,X3)),inference(split_conjunct,[status(thm)],[98])).
% fof(213, negated_conjecture,?[X1]:(((~(v3_struct_0(X1))&v10_lattices(X1))&l3_lattices(X1))&?[X2]:(m2_filter_2(X2,X1)&![X3]:(~(m1_subset_1(X3,u1_struct_0(X1)))|~(r2_hidden(X3,X2))))),inference(fof_nnf,[status(thm)],[63])).
% fof(214, negated_conjecture,?[X4]:(((~(v3_struct_0(X4))&v10_lattices(X4))&l3_lattices(X4))&?[X5]:(m2_filter_2(X5,X4)&![X6]:(~(m1_subset_1(X6,u1_struct_0(X4)))|~(r2_hidden(X6,X5))))),inference(variable_rename,[status(thm)],[213])).
% fof(215, negated_conjecture,(((~(v3_struct_0(esk16_0))&v10_lattices(esk16_0))&l3_lattices(esk16_0))&(m2_filter_2(esk17_0,esk16_0)&![X6]:(~(m1_subset_1(X6,u1_struct_0(esk16_0)))|~(r2_hidden(X6,esk17_0))))),inference(skolemize,[status(esa)],[214])).
% fof(216, negated_conjecture,![X6]:(((~(m1_subset_1(X6,u1_struct_0(esk16_0)))|~(r2_hidden(X6,esk17_0)))&m2_filter_2(esk17_0,esk16_0))&((~(v3_struct_0(esk16_0))&v10_lattices(esk16_0))&l3_lattices(esk16_0))),inference(shift_quantors,[status(thm)],[215])).
% cnf(217,negated_conjecture,(l3_lattices(esk16_0)),inference(split_conjunct,[status(thm)],[216])).
% cnf(218,negated_conjecture,(v10_lattices(esk16_0)),inference(split_conjunct,[status(thm)],[216])).
% cnf(219,negated_conjecture,(~v3_struct_0(esk16_0)),inference(split_conjunct,[status(thm)],[216])).
% cnf(220,negated_conjecture,(m2_filter_2(esk17_0,esk16_0)),inference(split_conjunct,[status(thm)],[216])).
% cnf(221,negated_conjecture,(~r2_hidden(X1,esk17_0)|~m1_subset_1(X1,u1_struct_0(esk16_0))),inference(split_conjunct,[status(thm)],[216])).
% cnf(268,negated_conjecture,(v3_struct_0(esk16_0)|~v1_xboole_0(esk17_0)|~v10_lattices(esk16_0)|~l3_lattices(esk16_0)),inference(pm,[status(thm)],[96,220,theory(equality)])).
% cnf(269,negated_conjecture,(v3_struct_0(esk16_0)|~v1_xboole_0(esk17_0)|$false|~l3_lattices(esk16_0)),inference(rw,[status(thm)],[268,218,theory(equality)])).
% cnf(270,negated_conjecture,(v3_struct_0(esk16_0)|~v1_xboole_0(esk17_0)|$false|$false),inference(rw,[status(thm)],[269,217,theory(equality)])).
% cnf(271,negated_conjecture,(v3_struct_0(esk16_0)|~v1_xboole_0(esk17_0)),inference(cn,[status(thm)],[270,theory(equality)])).
% cnf(272,negated_conjecture,(~v1_xboole_0(esk17_0)),inference(sr,[status(thm)],[271,219,theory(equality)])).
% cnf(275,plain,(v1_xboole_0(X1)|r2_hidden(esk2_1(X1),X1)),inference(pm,[status(thm)],[82,72,theory(equality)])).
% cnf(293,negated_conjecture,(m2_lattice4(esk17_0,esk16_0)|v3_struct_0(esk16_0)|~v10_lattices(esk16_0)|~l3_lattices(esk16_0)),inference(pm,[status(thm)],[95,220,theory(equality)])).
% cnf(294,negated_conjecture,(m2_lattice4(esk17_0,esk16_0)|v3_struct_0(esk16_0)|$false|~l3_lattices(esk16_0)),inference(rw,[status(thm)],[293,218,theory(equality)])).
% cnf(295,negated_conjecture,(m2_lattice4(esk17_0,esk16_0)|v3_struct_0(esk16_0)|$false|$false),inference(rw,[status(thm)],[294,217,theory(equality)])).
% cnf(296,negated_conjecture,(m2_lattice4(esk17_0,esk16_0)|v3_struct_0(esk16_0)),inference(cn,[status(thm)],[295,theory(equality)])).
% cnf(297,negated_conjecture,(m2_lattice4(esk17_0,esk16_0)),inference(sr,[status(thm)],[296,219,theory(equality)])).
% cnf(363,negated_conjecture,(v3_struct_0(esk16_0)|m1_subset_1(esk17_0,k1_zfmisc_1(u1_struct_0(esk16_0)))|~v10_lattices(esk16_0)|~l3_lattices(esk16_0)),inference(pm,[status(thm)],[90,297,theory(equality)])).
% cnf(364,negated_conjecture,(v3_struct_0(esk16_0)|m1_subset_1(esk17_0,k1_zfmisc_1(u1_struct_0(esk16_0)))|$false|~l3_lattices(esk16_0)),inference(rw,[status(thm)],[363,218,theory(equality)])).
% cnf(365,negated_conjecture,(v3_struct_0(esk16_0)|m1_subset_1(esk17_0,k1_zfmisc_1(u1_struct_0(esk16_0)))|$false|$false),inference(rw,[status(thm)],[364,217,theory(equality)])).
% cnf(366,negated_conjecture,(v3_struct_0(esk16_0)|m1_subset_1(esk17_0,k1_zfmisc_1(u1_struct_0(esk16_0)))),inference(cn,[status(thm)],[365,theory(equality)])).
% cnf(367,negated_conjecture,(m1_subset_1(esk17_0,k1_zfmisc_1(u1_struct_0(esk16_0)))),inference(sr,[status(thm)],[366,219,theory(equality)])).
% cnf(419,negated_conjecture,(m1_subset_1(X1,u1_struct_0(esk16_0))|~r2_hidden(X1,esk17_0)),inference(pm,[status(thm)],[99,367,theory(equality)])).
% cnf(453,negated_conjecture,(m1_subset_1(esk2_1(esk17_0),u1_struct_0(esk16_0))|v1_xboole_0(esk17_0)),inference(pm,[status(thm)],[419,275,theory(equality)])).
% cnf(459,negated_conjecture,(m1_subset_1(esk2_1(esk17_0),u1_struct_0(esk16_0))),inference(sr,[status(thm)],[453,272,theory(equality)])).
% cnf(501,negated_conjecture,(~r2_hidden(esk2_1(esk17_0),esk17_0)),inference(pm,[status(thm)],[221,459,theory(equality)])).
% cnf(521,negated_conjecture,(v1_xboole_0(esk17_0)),inference(pm,[status(thm)],[501,275,theory(equality)])).
% cnf(522,negated_conjecture,($false),inference(sr,[status(thm)],[521,272,theory(equality)])).
% cnf(523,negated_conjecture,($false),522,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 131
% # ...of these trivial : 2
% # ...subsumed : 11
% # ...remaining for further processing: 118
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 150
% # ...of the previous two non-trivial : 125
% # Contextual simplify-reflections : 0
% # Paramodulations : 147
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 112
% # Positive orientable unit clauses: 48
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 52
% # Current number of unprocessed clauses: 40
% # ...number of literals in the above : 124
% # Clause-clause subsumption calls (NU) : 59
% # Rec. Clause-clause subsumption calls : 45
% # Unit Clause-clause subsumption calls : 38
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 15
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 142 leaves, 1.17+/-0.543 terms/leaf
% # Paramod-from index: 53 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 121 leaves, 1.10+/-0.394 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.003 s
% # Total time : 0.026 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP14400/LAT300+1.tptp
%
%------------------------------------------------------------------------------