TSTP Solution File: SET643+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET643+3 : TPTP v5.0.0. Released v2.2.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 : Wed Dec 29 23:20:56 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP2538/SET643+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP2538/SET643+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2538/SET643+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 2634
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,set_type)=>(subset(X1,cross_product(X2,X3))=>ilf_type(X1,relation_type(X2,X3)))))),file('/tmp/SRASS.s.p', p1)).
% fof(7, axiom,![X1]:(ilf_type(X1,set_type)=>subset(X1,X1)),file('/tmp/SRASS.s.p', p10)).
% fof(19, axiom,![X1]:ilf_type(X1,set_type),file('/tmp/SRASS.s.p', p19)).
% fof(20, conjecture,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>ilf_type(cross_product(X1,X2),relation_type(X1,X2)))),file('/tmp/SRASS.s.p', prove_relset_1_5)).
% fof(21, negated_conjecture,~(![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>ilf_type(cross_product(X1,X2),relation_type(X1,X2))))),inference(assume_negation,[status(cth)],[20])).
% fof(41, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|![X3]:(~(ilf_type(X3,set_type))|(~(subset(X1,cross_product(X2,X3)))|ilf_type(X1,relation_type(X2,X3)))))),inference(fof_nnf,[status(thm)],[4])).
% fof(42, plain,![X4]:(~(ilf_type(X4,set_type))|![X5]:(~(ilf_type(X5,set_type))|![X6]:(~(ilf_type(X6,set_type))|(~(subset(X4,cross_product(X5,X6)))|ilf_type(X4,relation_type(X5,X6)))))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:![X6]:(((~(ilf_type(X6,set_type))|(~(subset(X4,cross_product(X5,X6)))|ilf_type(X4,relation_type(X5,X6))))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type))),inference(shift_quantors,[status(thm)],[42])).
% cnf(44,plain,(ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~subset(X1,cross_product(X2,X3))|~ilf_type(X3,set_type)),inference(split_conjunct,[status(thm)],[43])).
% fof(53, plain,![X1]:(~(ilf_type(X1,set_type))|subset(X1,X1)),inference(fof_nnf,[status(thm)],[7])).
% fof(54, plain,![X2]:(~(ilf_type(X2,set_type))|subset(X2,X2)),inference(variable_rename,[status(thm)],[53])).
% cnf(55,plain,(subset(X1,X1)|~ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[54])).
% fof(132, plain,![X2]:ilf_type(X2,set_type),inference(variable_rename,[status(thm)],[19])).
% cnf(133,plain,(ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[132])).
% fof(134, negated_conjecture,?[X1]:(ilf_type(X1,set_type)&?[X2]:(ilf_type(X2,set_type)&~(ilf_type(cross_product(X1,X2),relation_type(X1,X2))))),inference(fof_nnf,[status(thm)],[21])).
% fof(135, negated_conjecture,?[X3]:(ilf_type(X3,set_type)&?[X4]:(ilf_type(X4,set_type)&~(ilf_type(cross_product(X3,X4),relation_type(X3,X4))))),inference(variable_rename,[status(thm)],[134])).
% fof(136, negated_conjecture,(ilf_type(esk12_0,set_type)&(ilf_type(esk13_0,set_type)&~(ilf_type(cross_product(esk12_0,esk13_0),relation_type(esk12_0,esk13_0))))),inference(skolemize,[status(esa)],[135])).
% cnf(137,negated_conjecture,(~ilf_type(cross_product(esk12_0,esk13_0),relation_type(esk12_0,esk13_0))),inference(split_conjunct,[status(thm)],[136])).
% cnf(145,plain,(subset(X1,X1)|$false),inference(rw,[status(thm)],[55,133,theory(equality)])).
% cnf(146,plain,(subset(X1,X1)),inference(cn,[status(thm)],[145,theory(equality)])).
% cnf(222,plain,(ilf_type(X1,relation_type(X2,X3))|$false|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~subset(X1,cross_product(X2,X3))),inference(rw,[status(thm)],[44,133,theory(equality)])).
% cnf(223,plain,(ilf_type(X1,relation_type(X2,X3))|$false|$false|~ilf_type(X1,set_type)|~subset(X1,cross_product(X2,X3))),inference(rw,[status(thm)],[222,133,theory(equality)])).
% cnf(224,plain,(ilf_type(X1,relation_type(X2,X3))|$false|$false|$false|~subset(X1,cross_product(X2,X3))),inference(rw,[status(thm)],[223,133,theory(equality)])).
% cnf(225,plain,(ilf_type(X1,relation_type(X2,X3))|~subset(X1,cross_product(X2,X3))),inference(cn,[status(thm)],[224,theory(equality)])).
% cnf(278,negated_conjecture,(~subset(cross_product(esk12_0,esk13_0),cross_product(esk12_0,esk13_0))),inference(spm,[status(thm)],[137,225,theory(equality)])).
% cnf(279,negated_conjecture,($false),inference(rw,[status(thm)],[278,146,theory(equality)])).
% cnf(280,negated_conjecture,($false),inference(cn,[status(thm)],[279,theory(equality)])).
% cnf(281,negated_conjecture,($false),280,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 56
% # ...of these trivial : 11
% # ...subsumed : 0
% # ...remaining for further processing: 45
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 3
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections : 1
% # Paramodulations : 3
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 12
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 6
% # Current number of unprocessed clauses: 20
% # ...number of literals in the above : 46
% # Clause-clause subsumption calls (NU) : 3
% # Rec. Clause-clause subsumption calls : 3
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 29 leaves, 1.07+/-0.253 terms/leaf
% # Paramod-from index: 8 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 25 leaves, 1.04+/-0.196 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.003 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP2538/SET643+3.tptp
%
%------------------------------------------------------------------------------