TSTP Solution File: CAT033+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CAT033+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 : art06.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 22:25:15 EST 2010
% Result : Theorem 1.01s
% Output : Solution 1.01s
% 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/SystemOnTPTP11956/CAT033+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11956/CAT033+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11956/CAT033+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 12052
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X1]:(~(v1_xboole_0(X1))=>![X2]:((v2_cat_1(X2)&l1_cat_1(X2))=>![X3]:(m1_subset_1(X3,u1_cat_1(X2))=>(r1_tarski(k17_ens_1(X2),X1)=>m2_cat_1(k20_ens_1(X2,X3),X2,k12_ens_1(X1)))))),file('/tmp/SRASS.s.p', t49_ens_1)).
% fof(9, axiom,![X1]:![X2]:r1_tarski(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(11, axiom,![X1]:((v2_cat_1(X1)&l1_cat_1(X1))=>~(v1_xboole_0(k17_ens_1(X1)))),file('/tmp/SRASS.s.p', fc5_ens_1)).
% fof(15, axiom,![X1]:((v2_cat_1(X1)&l1_cat_1(X1))=>k1_yoneda_1(X1)=k12_ens_1(k17_ens_1(X1))),file('/tmp/SRASS.s.p', d1_yoneda_1)).
% fof(53, conjecture,![X1]:((v2_cat_1(X1)&l1_cat_1(X1))=>![X2]:(m1_subset_1(X2,u1_cat_1(X1))=>m2_cat_1(k20_ens_1(X1,X2),X1,k1_yoneda_1(X1)))),file('/tmp/SRASS.s.p', t2_yoneda_1)).
% fof(54, negated_conjecture,~(![X1]:((v2_cat_1(X1)&l1_cat_1(X1))=>![X2]:(m1_subset_1(X2,u1_cat_1(X1))=>m2_cat_1(k20_ens_1(X1,X2),X1,k1_yoneda_1(X1))))),inference(assume_negation,[status(cth)],[53])).
% fof(56, plain,![X1]:(~(v1_xboole_0(X1))=>![X2]:((v2_cat_1(X2)&l1_cat_1(X2))=>![X3]:(m1_subset_1(X3,u1_cat_1(X2))=>(r1_tarski(k17_ens_1(X2),X1)=>m2_cat_1(k20_ens_1(X2,X3),X2,k12_ens_1(X1)))))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(59, plain,![X1]:((v2_cat_1(X1)&l1_cat_1(X1))=>~(v1_xboole_0(k17_ens_1(X1)))),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% fof(84, plain,![X1]:(v1_xboole_0(X1)|![X2]:((~(v2_cat_1(X2))|~(l1_cat_1(X2)))|![X3]:(~(m1_subset_1(X3,u1_cat_1(X2)))|(~(r1_tarski(k17_ens_1(X2),X1))|m2_cat_1(k20_ens_1(X2,X3),X2,k12_ens_1(X1)))))),inference(fof_nnf,[status(thm)],[56])).
% fof(85, plain,![X4]:(v1_xboole_0(X4)|![X5]:((~(v2_cat_1(X5))|~(l1_cat_1(X5)))|![X6]:(~(m1_subset_1(X6,u1_cat_1(X5)))|(~(r1_tarski(k17_ens_1(X5),X4))|m2_cat_1(k20_ens_1(X5,X6),X5,k12_ens_1(X4)))))),inference(variable_rename,[status(thm)],[84])).
% fof(86, plain,![X4]:![X5]:![X6]:(((~(m1_subset_1(X6,u1_cat_1(X5)))|(~(r1_tarski(k17_ens_1(X5),X4))|m2_cat_1(k20_ens_1(X5,X6),X5,k12_ens_1(X4))))|(~(v2_cat_1(X5))|~(l1_cat_1(X5))))|v1_xboole_0(X4)),inference(shift_quantors,[status(thm)],[85])).
% cnf(87,plain,(v1_xboole_0(X1)|m2_cat_1(k20_ens_1(X2,X3),X2,k12_ens_1(X1))|~l1_cat_1(X2)|~v2_cat_1(X2)|~r1_tarski(k17_ens_1(X2),X1)|~m1_subset_1(X3,u1_cat_1(X2))),inference(split_conjunct,[status(thm)],[86])).
% fof(94, plain,![X3]:![X4]:r1_tarski(X3,X3),inference(variable_rename,[status(thm)],[9])).
% cnf(95,plain,(r1_tarski(X1,X1)),inference(split_conjunct,[status(thm)],[94])).
% fof(99, plain,![X1]:((~(v2_cat_1(X1))|~(l1_cat_1(X1)))|~(v1_xboole_0(k17_ens_1(X1)))),inference(fof_nnf,[status(thm)],[59])).
% fof(100, plain,![X2]:((~(v2_cat_1(X2))|~(l1_cat_1(X2)))|~(v1_xboole_0(k17_ens_1(X2)))),inference(variable_rename,[status(thm)],[99])).
% cnf(101,plain,(~v1_xboole_0(k17_ens_1(X1))|~l1_cat_1(X1)|~v2_cat_1(X1)),inference(split_conjunct,[status(thm)],[100])).
% fof(111, plain,![X1]:((~(v2_cat_1(X1))|~(l1_cat_1(X1)))|k1_yoneda_1(X1)=k12_ens_1(k17_ens_1(X1))),inference(fof_nnf,[status(thm)],[15])).
% fof(112, plain,![X2]:((~(v2_cat_1(X2))|~(l1_cat_1(X2)))|k1_yoneda_1(X2)=k12_ens_1(k17_ens_1(X2))),inference(variable_rename,[status(thm)],[111])).
% cnf(113,plain,(k1_yoneda_1(X1)=k12_ens_1(k17_ens_1(X1))|~l1_cat_1(X1)|~v2_cat_1(X1)),inference(split_conjunct,[status(thm)],[112])).
% fof(246, negated_conjecture,?[X1]:((v2_cat_1(X1)&l1_cat_1(X1))&?[X2]:(m1_subset_1(X2,u1_cat_1(X1))&~(m2_cat_1(k20_ens_1(X1,X2),X1,k1_yoneda_1(X1))))),inference(fof_nnf,[status(thm)],[54])).
% fof(247, negated_conjecture,?[X3]:((v2_cat_1(X3)&l1_cat_1(X3))&?[X4]:(m1_subset_1(X4,u1_cat_1(X3))&~(m2_cat_1(k20_ens_1(X3,X4),X3,k1_yoneda_1(X3))))),inference(variable_rename,[status(thm)],[246])).
% fof(248, negated_conjecture,((v2_cat_1(esk11_0)&l1_cat_1(esk11_0))&(m1_subset_1(esk12_0,u1_cat_1(esk11_0))&~(m2_cat_1(k20_ens_1(esk11_0,esk12_0),esk11_0,k1_yoneda_1(esk11_0))))),inference(skolemize,[status(esa)],[247])).
% cnf(249,negated_conjecture,(~m2_cat_1(k20_ens_1(esk11_0,esk12_0),esk11_0,k1_yoneda_1(esk11_0))),inference(split_conjunct,[status(thm)],[248])).
% cnf(250,negated_conjecture,(m1_subset_1(esk12_0,u1_cat_1(esk11_0))),inference(split_conjunct,[status(thm)],[248])).
% cnf(251,negated_conjecture,(l1_cat_1(esk11_0)),inference(split_conjunct,[status(thm)],[248])).
% cnf(252,negated_conjecture,(v2_cat_1(esk11_0)),inference(split_conjunct,[status(thm)],[248])).
% cnf(295,plain,(v1_xboole_0(k17_ens_1(X1))|m2_cat_1(k20_ens_1(X2,X3),X2,k1_yoneda_1(X1))|~r1_tarski(k17_ens_1(X2),k17_ens_1(X1))|~v2_cat_1(X2)|~m1_subset_1(X3,u1_cat_1(X2))|~l1_cat_1(X2)|~v2_cat_1(X1)|~l1_cat_1(X1)),inference(spm,[status(thm)],[87,113,theory(equality)])).
% cnf(531,plain,(m2_cat_1(k20_ens_1(X2,X3),X2,k1_yoneda_1(X1))|~r1_tarski(k17_ens_1(X2),k17_ens_1(X1))|~v2_cat_1(X2)|~v2_cat_1(X1)|~m1_subset_1(X3,u1_cat_1(X2))|~l1_cat_1(X2)|~l1_cat_1(X1)),inference(csr,[status(thm)],[295,101])).
% cnf(534,negated_conjecture,(~r1_tarski(k17_ens_1(esk11_0),k17_ens_1(esk11_0))|~v2_cat_1(esk11_0)|~m1_subset_1(esk12_0,u1_cat_1(esk11_0))|~l1_cat_1(esk11_0)),inference(spm,[status(thm)],[249,531,theory(equality)])).
% cnf(535,negated_conjecture,($false|~v2_cat_1(esk11_0)|~m1_subset_1(esk12_0,u1_cat_1(esk11_0))|~l1_cat_1(esk11_0)),inference(rw,[status(thm)],[534,95,theory(equality)])).
% cnf(536,negated_conjecture,($false|$false|~m1_subset_1(esk12_0,u1_cat_1(esk11_0))|~l1_cat_1(esk11_0)),inference(rw,[status(thm)],[535,252,theory(equality)])).
% cnf(537,negated_conjecture,($false|$false|$false|~l1_cat_1(esk11_0)),inference(rw,[status(thm)],[536,250,theory(equality)])).
% cnf(538,negated_conjecture,($false|$false|$false|$false),inference(rw,[status(thm)],[537,251,theory(equality)])).
% cnf(539,negated_conjecture,($false),inference(cn,[status(thm)],[538,theory(equality)])).
% cnf(540,negated_conjecture,($false),539,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 264
% # ...of these trivial : 0
% # ...subsumed : 37
% # ...remaining for further processing: 227
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 6
% # Generated clauses : 227
% # ...of the previous two non-trivial : 202
% # Contextual simplify-reflections : 22
% # Paramodulations : 224
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 144
% # Positive orientable unit clauses: 26
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 114
% # Current number of unprocessed clauses: 80
% # ...number of literals in the above : 495
% # Clause-clause subsumption calls (NU) : 505
% # Rec. Clause-clause subsumption calls : 379
% # Unit Clause-clause subsumption calls : 16
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 163 leaves, 1.63+/-2.243 terms/leaf
% # Paramod-from index: 83 leaves, 1.04+/-0.187 terms/leaf
% # Paramod-into index: 141 leaves, 1.21+/-0.669 terms/leaf
% # -------------------------------------------------
% # User time : 0.040 s
% # System time : 0.004 s
% # Total time : 0.044 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP11956/CAT033+1.tptp
%
%------------------------------------------------------------------------------