TSTP Solution File: SET658+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET658+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 : 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 23:22:40 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP31423/SET658+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31423/SET658+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31423/SET658+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 31519
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,binary_relation_type)=>(subset(domain_of(X2),X1)=>ilf_type(X2,relation_type(X1,range_of(X2)))))),file('/tmp/SRASS.s.p', p1)).
% fof(8, axiom,![X1]:(ilf_type(X1,set_type)=>subset(X1,X1)),file('/tmp/SRASS.s.p', p15)).
% fof(9, axiom,![X1]:ilf_type(X1,set_type),file('/tmp/SRASS.s.p', p28)).
% fof(29, conjecture,![X1]:(ilf_type(X1,binary_relation_type)=>ilf_type(X1,relation_type(domain_of(X1),range_of(X1)))),file('/tmp/SRASS.s.p', prove_relset_1_20)).
% fof(30, negated_conjecture,~(![X1]:(ilf_type(X1,binary_relation_type)=>ilf_type(X1,relation_type(domain_of(X1),range_of(X1))))),inference(assume_negation,[status(cth)],[29])).
% fof(49, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,binary_relation_type))|(~(subset(domain_of(X2),X1))|ilf_type(X2,relation_type(X1,range_of(X2)))))),inference(fof_nnf,[status(thm)],[5])).
% fof(50, plain,![X3]:(~(ilf_type(X3,set_type))|![X4]:(~(ilf_type(X4,binary_relation_type))|(~(subset(domain_of(X4),X3))|ilf_type(X4,relation_type(X3,range_of(X4)))))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X3]:![X4]:((~(ilf_type(X4,binary_relation_type))|(~(subset(domain_of(X4),X3))|ilf_type(X4,relation_type(X3,range_of(X4)))))|~(ilf_type(X3,set_type))),inference(shift_quantors,[status(thm)],[50])).
% cnf(52,plain,(ilf_type(X2,relation_type(X1,range_of(X2)))|~ilf_type(X1,set_type)|~subset(domain_of(X2),X1)|~ilf_type(X2,binary_relation_type)),inference(split_conjunct,[status(thm)],[51])).
% fof(61, plain,![X1]:(~(ilf_type(X1,set_type))|subset(X1,X1)),inference(fof_nnf,[status(thm)],[8])).
% fof(62, plain,![X2]:(~(ilf_type(X2,set_type))|subset(X2,X2)),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(subset(X1,X1)|~ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[62])).
% fof(64, plain,![X2]:ilf_type(X2,set_type),inference(variable_rename,[status(thm)],[9])).
% cnf(65,plain,(ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[64])).
% fof(179, negated_conjecture,?[X1]:(ilf_type(X1,binary_relation_type)&~(ilf_type(X1,relation_type(domain_of(X1),range_of(X1))))),inference(fof_nnf,[status(thm)],[30])).
% fof(180, negated_conjecture,?[X2]:(ilf_type(X2,binary_relation_type)&~(ilf_type(X2,relation_type(domain_of(X2),range_of(X2))))),inference(variable_rename,[status(thm)],[179])).
% fof(181, negated_conjecture,(ilf_type(esk13_0,binary_relation_type)&~(ilf_type(esk13_0,relation_type(domain_of(esk13_0),range_of(esk13_0))))),inference(skolemize,[status(esa)],[180])).
% cnf(182,negated_conjecture,(~ilf_type(esk13_0,relation_type(domain_of(esk13_0),range_of(esk13_0)))),inference(split_conjunct,[status(thm)],[181])).
% cnf(183,negated_conjecture,(ilf_type(esk13_0,binary_relation_type)),inference(split_conjunct,[status(thm)],[181])).
% cnf(186,plain,(subset(X1,X1)|$false),inference(rw,[status(thm)],[63,65,theory(equality)])).
% cnf(187,plain,(subset(X1,X1)),inference(cn,[status(thm)],[186,theory(equality)])).
% cnf(227,plain,(ilf_type(X2,relation_type(X1,range_of(X2)))|~ilf_type(X2,binary_relation_type)|$false|~subset(domain_of(X2),X1)),inference(rw,[status(thm)],[52,65,theory(equality)])).
% cnf(228,plain,(ilf_type(X2,relation_type(X1,range_of(X2)))|~ilf_type(X2,binary_relation_type)|~subset(domain_of(X2),X1)),inference(cn,[status(thm)],[227,theory(equality)])).
% cnf(330,negated_conjecture,(~subset(domain_of(esk13_0),domain_of(esk13_0))|~ilf_type(esk13_0,binary_relation_type)),inference(spm,[status(thm)],[182,228,theory(equality)])).
% cnf(333,negated_conjecture,($false|~ilf_type(esk13_0,binary_relation_type)),inference(rw,[status(thm)],[330,187,theory(equality)])).
% cnf(334,negated_conjecture,($false|$false),inference(rw,[status(thm)],[333,183,theory(equality)])).
% cnf(335,negated_conjecture,($false),inference(cn,[status(thm)],[334,theory(equality)])).
% cnf(336,negated_conjecture,($false),335,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 72
% # ...of these trivial : 13
% # ...subsumed : 0
% # ...remaining for further processing: 59
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 11
% # ...of the previous two non-trivial : 6
% # Contextual simplify-reflections : 1
% # Paramodulations : 11
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 20
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 25
% # ...number of literals in the above : 54
% # Clause-clause subsumption calls (NU) : 5
% # Rec. Clause-clause subsumption calls : 3
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 43 leaves, 1.14+/-0.347 terms/leaf
% # Paramod-from index: 13 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 37 leaves, 1.05+/-0.226 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.003 s
% # Total time : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP31423/SET658+3.tptp
%
%------------------------------------------------------------------------------