TSTP Solution File: SEU275+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU275+1 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 02:51:53 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP13302/SEU275+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP13302/SEU275+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13302/SEU275+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 13398
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(ordinal(X1)=>connected(inclusion_relation(X1))),file('/tmp/SRASS.s.p', t4_wellord2)).
% fof(2, axiom,![X1]:(ordinal(X1)=>well_founded_relation(inclusion_relation(X1))),file('/tmp/SRASS.s.p', t6_wellord2)).
% fof(3, axiom,![X1]:relation(inclusion_relation(X1)),file('/tmp/SRASS.s.p', dt_k1_wellord2)).
% fof(4, axiom,![X1]:reflexive(inclusion_relation(X1)),file('/tmp/SRASS.s.p', t2_wellord2)).
% fof(5, axiom,![X1]:transitive(inclusion_relation(X1)),file('/tmp/SRASS.s.p', t3_wellord2)).
% fof(6, axiom,![X1]:antisymmetric(inclusion_relation(X1)),file('/tmp/SRASS.s.p', t5_wellord2)).
% fof(10, axiom,![X1]:(relation(X1)=>(well_ordering(X1)<=>((((reflexive(X1)&transitive(X1))&antisymmetric(X1))&connected(X1))&well_founded_relation(X1)))),file('/tmp/SRASS.s.p', d4_wellord1)).
% fof(11, conjecture,![X1]:(ordinal(X1)=>well_ordering(inclusion_relation(X1))),file('/tmp/SRASS.s.p', t7_wellord2)).
% fof(12, negated_conjecture,~(![X1]:(ordinal(X1)=>well_ordering(inclusion_relation(X1)))),inference(assume_negation,[status(cth)],[11])).
% fof(13, plain,![X1]:(~(ordinal(X1))|connected(inclusion_relation(X1))),inference(fof_nnf,[status(thm)],[1])).
% fof(14, plain,![X2]:(~(ordinal(X2))|connected(inclusion_relation(X2))),inference(variable_rename,[status(thm)],[13])).
% cnf(15,plain,(connected(inclusion_relation(X1))|~ordinal(X1)),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X1]:(~(ordinal(X1))|well_founded_relation(inclusion_relation(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(17, plain,![X2]:(~(ordinal(X2))|well_founded_relation(inclusion_relation(X2))),inference(variable_rename,[status(thm)],[16])).
% cnf(18,plain,(well_founded_relation(inclusion_relation(X1))|~ordinal(X1)),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X2]:relation(inclusion_relation(X2)),inference(variable_rename,[status(thm)],[3])).
% cnf(20,plain,(relation(inclusion_relation(X1))),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X2]:reflexive(inclusion_relation(X2)),inference(variable_rename,[status(thm)],[4])).
% cnf(22,plain,(reflexive(inclusion_relation(X1))),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X2]:transitive(inclusion_relation(X2)),inference(variable_rename,[status(thm)],[5])).
% cnf(24,plain,(transitive(inclusion_relation(X1))),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X2]:antisymmetric(inclusion_relation(X2)),inference(variable_rename,[status(thm)],[6])).
% cnf(26,plain,(antisymmetric(inclusion_relation(X1))),inference(split_conjunct,[status(thm)],[25])).
% fof(40, plain,![X1]:(~(relation(X1))|((~(well_ordering(X1))|((((reflexive(X1)&transitive(X1))&antisymmetric(X1))&connected(X1))&well_founded_relation(X1)))&(((((~(reflexive(X1))|~(transitive(X1)))|~(antisymmetric(X1)))|~(connected(X1)))|~(well_founded_relation(X1)))|well_ordering(X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(41, plain,![X2]:(~(relation(X2))|((~(well_ordering(X2))|((((reflexive(X2)&transitive(X2))&antisymmetric(X2))&connected(X2))&well_founded_relation(X2)))&(((((~(reflexive(X2))|~(transitive(X2)))|~(antisymmetric(X2)))|~(connected(X2)))|~(well_founded_relation(X2)))|well_ordering(X2)))),inference(variable_rename,[status(thm)],[40])).
% fof(42, plain,![X2]:(((((((reflexive(X2)|~(well_ordering(X2)))|~(relation(X2)))&((transitive(X2)|~(well_ordering(X2)))|~(relation(X2))))&((antisymmetric(X2)|~(well_ordering(X2)))|~(relation(X2))))&((connected(X2)|~(well_ordering(X2)))|~(relation(X2))))&((well_founded_relation(X2)|~(well_ordering(X2)))|~(relation(X2))))&((((((~(reflexive(X2))|~(transitive(X2)))|~(antisymmetric(X2)))|~(connected(X2)))|~(well_founded_relation(X2)))|well_ordering(X2))|~(relation(X2)))),inference(distribute,[status(thm)],[41])).
% cnf(43,plain,(well_ordering(X1)|~relation(X1)|~well_founded_relation(X1)|~connected(X1)|~antisymmetric(X1)|~transitive(X1)|~reflexive(X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(49, negated_conjecture,?[X1]:(ordinal(X1)&~(well_ordering(inclusion_relation(X1)))),inference(fof_nnf,[status(thm)],[12])).
% fof(50, negated_conjecture,?[X2]:(ordinal(X2)&~(well_ordering(inclusion_relation(X2)))),inference(variable_rename,[status(thm)],[49])).
% fof(51, negated_conjecture,(ordinal(esk2_0)&~(well_ordering(inclusion_relation(esk2_0)))),inference(skolemize,[status(esa)],[50])).
% cnf(52,negated_conjecture,(~well_ordering(inclusion_relation(esk2_0))),inference(split_conjunct,[status(thm)],[51])).
% cnf(53,negated_conjecture,(ordinal(esk2_0)),inference(split_conjunct,[status(thm)],[51])).
% cnf(59,plain,(well_ordering(inclusion_relation(X1))|~antisymmetric(inclusion_relation(X1))|~transitive(inclusion_relation(X1))|~reflexive(inclusion_relation(X1))|~relation(inclusion_relation(X1))|~connected(inclusion_relation(X1))|~ordinal(X1)),inference(spm,[status(thm)],[43,18,theory(equality)])).
% cnf(61,plain,(well_ordering(inclusion_relation(X1))|$false|~transitive(inclusion_relation(X1))|~reflexive(inclusion_relation(X1))|~relation(inclusion_relation(X1))|~connected(inclusion_relation(X1))|~ordinal(X1)),inference(rw,[status(thm)],[59,26,theory(equality)])).
% cnf(62,plain,(well_ordering(inclusion_relation(X1))|$false|$false|~reflexive(inclusion_relation(X1))|~relation(inclusion_relation(X1))|~connected(inclusion_relation(X1))|~ordinal(X1)),inference(rw,[status(thm)],[61,24,theory(equality)])).
% cnf(63,plain,(well_ordering(inclusion_relation(X1))|$false|$false|$false|~relation(inclusion_relation(X1))|~connected(inclusion_relation(X1))|~ordinal(X1)),inference(rw,[status(thm)],[62,22,theory(equality)])).
% cnf(64,plain,(well_ordering(inclusion_relation(X1))|$false|$false|$false|$false|~connected(inclusion_relation(X1))|~ordinal(X1)),inference(rw,[status(thm)],[63,20,theory(equality)])).
% cnf(65,plain,(well_ordering(inclusion_relation(X1))|~connected(inclusion_relation(X1))|~ordinal(X1)),inference(cn,[status(thm)],[64,theory(equality)])).
% cnf(66,plain,(well_ordering(inclusion_relation(X1))|~ordinal(X1)),inference(csr,[status(thm)],[65,15])).
% cnf(67,negated_conjecture,(~ordinal(esk2_0)),inference(spm,[status(thm)],[52,66,theory(equality)])).
% cnf(68,negated_conjecture,($false),inference(rw,[status(thm)],[67,53,theory(equality)])).
% cnf(69,negated_conjecture,($false),inference(cn,[status(thm)],[68,theory(equality)])).
% cnf(70,negated_conjecture,($false),69,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 41
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 41
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 5
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections : 1
% # Paramodulations : 5
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 21
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # 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: 27 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 18 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 23 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.003 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.17 WC
% FINAL PrfWatch: 0.08 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP13302/SEU275+1.tptp
%
%------------------------------------------------------------------------------