TSTP Solution File: SET676+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET676+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 : 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 : Wed Dec 29 23:27:36 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP6903/SET676+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP6903/SET676+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6903/SET676+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 6999
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>(ilf_type(X2,identity_relation_of_type(X1))<=>ilf_type(X2,relation_type(X1,X1))))),file('/tmp/SRASS.s.p', p4)).
% fof(6, axiom,![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', p1)).
% fof(19, axiom,![X1]:ilf_type(X1,set_type),file('/tmp/SRASS.s.p', p19)).
% fof(20, conjecture,![X1]:(ilf_type(X1,set_type)=>ilf_type(cross_product(X1,X1),identity_relation_of_type(X1))),file('/tmp/SRASS.s.p', prove_relset_1_41)).
% fof(21, negated_conjecture,~(![X1]:(ilf_type(X1,set_type)=>ilf_type(cross_product(X1,X1),identity_relation_of_type(X1)))),inference(assume_negation,[status(cth)],[20])).
% fof(34, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|((~(ilf_type(X2,identity_relation_of_type(X1)))|ilf_type(X2,relation_type(X1,X1)))&(~(ilf_type(X2,relation_type(X1,X1)))|ilf_type(X2,identity_relation_of_type(X1)))))),inference(fof_nnf,[status(thm)],[3])).
% fof(35, plain,![X3]:(~(ilf_type(X3,set_type))|![X4]:(~(ilf_type(X4,set_type))|((~(ilf_type(X4,identity_relation_of_type(X3)))|ilf_type(X4,relation_type(X3,X3)))&(~(ilf_type(X4,relation_type(X3,X3)))|ilf_type(X4,identity_relation_of_type(X3)))))),inference(variable_rename,[status(thm)],[34])).
% fof(36, plain,![X3]:![X4]:((~(ilf_type(X4,set_type))|((~(ilf_type(X4,identity_relation_of_type(X3)))|ilf_type(X4,relation_type(X3,X3)))&(~(ilf_type(X4,relation_type(X3,X3)))|ilf_type(X4,identity_relation_of_type(X3)))))|~(ilf_type(X3,set_type))),inference(shift_quantors,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:((((~(ilf_type(X4,identity_relation_of_type(X3)))|ilf_type(X4,relation_type(X3,X3)))|~(ilf_type(X4,set_type)))|~(ilf_type(X3,set_type)))&(((~(ilf_type(X4,relation_type(X3,X3)))|ilf_type(X4,identity_relation_of_type(X3)))|~(ilf_type(X4,set_type)))|~(ilf_type(X3,set_type)))),inference(distribute,[status(thm)],[36])).
% cnf(38,plain,(ilf_type(X2,identity_relation_of_type(X1))|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~ilf_type(X2,relation_type(X1,X1))),inference(split_conjunct,[status(thm)],[37])).
% fof(49, plain,![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)],[6])).
% fof(50, plain,![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)],[49])).
% fof(51, plain,![X3]:![X4]:((~(ilf_type(X4,set_type))|ilf_type(cross_product(X3,X4),relation_type(X3,X4)))|~(ilf_type(X3,set_type))),inference(shift_quantors,[status(thm)],[50])).
% cnf(52,plain,(ilf_type(cross_product(X1,X2),relation_type(X1,X2))|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)),inference(split_conjunct,[status(thm)],[51])).
% fof(130, plain,![X2]:ilf_type(X2,set_type),inference(variable_rename,[status(thm)],[19])).
% cnf(131,plain,(ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[130])).
% fof(132, negated_conjecture,?[X1]:(ilf_type(X1,set_type)&~(ilf_type(cross_product(X1,X1),identity_relation_of_type(X1)))),inference(fof_nnf,[status(thm)],[21])).
% fof(133, negated_conjecture,?[X2]:(ilf_type(X2,set_type)&~(ilf_type(cross_product(X2,X2),identity_relation_of_type(X2)))),inference(variable_rename,[status(thm)],[132])).
% fof(134, negated_conjecture,(ilf_type(esk12_0,set_type)&~(ilf_type(cross_product(esk12_0,esk12_0),identity_relation_of_type(esk12_0)))),inference(skolemize,[status(esa)],[133])).
% cnf(135,negated_conjecture,(~ilf_type(cross_product(esk12_0,esk12_0),identity_relation_of_type(esk12_0))),inference(split_conjunct,[status(thm)],[134])).
% cnf(165,plain,(ilf_type(cross_product(X1,X2),relation_type(X1,X2))|$false|~ilf_type(X1,set_type)),inference(rw,[status(thm)],[52,131,theory(equality)])).
% cnf(166,plain,(ilf_type(cross_product(X1,X2),relation_type(X1,X2))|$false|$false),inference(rw,[status(thm)],[165,131,theory(equality)])).
% cnf(167,plain,(ilf_type(cross_product(X1,X2),relation_type(X1,X2))),inference(cn,[status(thm)],[166,theory(equality)])).
% cnf(185,plain,(ilf_type(X2,identity_relation_of_type(X1))|$false|~ilf_type(X1,set_type)|~ilf_type(X2,relation_type(X1,X1))),inference(rw,[status(thm)],[38,131,theory(equality)])).
% cnf(186,plain,(ilf_type(X2,identity_relation_of_type(X1))|$false|$false|~ilf_type(X2,relation_type(X1,X1))),inference(rw,[status(thm)],[185,131,theory(equality)])).
% cnf(187,plain,(ilf_type(X2,identity_relation_of_type(X1))|~ilf_type(X2,relation_type(X1,X1))),inference(cn,[status(thm)],[186,theory(equality)])).
% cnf(268,plain,(ilf_type(cross_product(X1,X1),identity_relation_of_type(X1))),inference(spm,[status(thm)],[187,167,theory(equality)])).
% cnf(303,negated_conjecture,($false),inference(rw,[status(thm)],[135,268,theory(equality)])).
% cnf(304,negated_conjecture,($false),inference(cn,[status(thm)],[303,theory(equality)])).
% cnf(305,negated_conjecture,($false),304,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 77
% # ...of these trivial : 10
% # ...subsumed : 1
% # ...remaining for further processing: 66
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 37
% # ...of the previous two non-trivial : 31
% # Contextual simplify-reflections : 1
% # Paramodulations : 35
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 34
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 23
% # Current number of unprocessed clauses: 25
% # ...number of literals in the above : 53
% # Clause-clause subsumption calls (NU) : 4
% # Rec. Clause-clause subsumption calls : 4
% # 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: 56 leaves, 1.34+/-0.762 terms/leaf
% # Paramod-from index: 18 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 48 leaves, 1.19+/-0.485 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.004 s
% # Total time : 0.021 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/SystemOnTPTP6903/SET676+3.tptp
%
%------------------------------------------------------------------------------