TSTP Solution File: NUM383+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM383+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 18:53:23 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP18312/NUM383+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18312/NUM383+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18312/NUM383+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 18444
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.01 CPU 0.03 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),file('/tmp/SRASS.s.p', antisymmetry_r2_hidden)).
% fof(8, axiom,![X1]:![X2]:(element(X1,powerset(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t3_subset)).
% fof(9, axiom,![X1]:![X2]:![X3]:((in(X1,X2)&element(X2,powerset(X3)))=>element(X1,X3)),file('/tmp/SRASS.s.p', t4_subset)).
% fof(10, axiom,![X1]:![X2]:(element(X1,X2)=>(empty(X2)|in(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(11, axiom,![X1]:![X2]:![X3]:~(((in(X1,X2)&element(X2,powerset(X3)))&empty(X3))),file('/tmp/SRASS.s.p', t5_subset)).
% fof(28, conjecture,![X1]:![X2]:~((in(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', t7_ordinal1)).
% fof(29, negated_conjecture,~(![X1]:![X2]:~((in(X1,X2)&subset(X2,X1)))),inference(assume_negation,[status(cth)],[28])).
% fof(30, plain,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(33, plain,![X1]:![X2]:(~(in(X1,X2))|~(in(X2,X1))),inference(fof_nnf,[status(thm)],[30])).
% fof(34, plain,![X3]:![X4]:(~(in(X3,X4))|~(in(X4,X3))),inference(variable_rename,[status(thm)],[33])).
% cnf(35,plain,(~in(X1,X2)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(53, plain,![X1]:![X2]:((~(element(X1,powerset(X2)))|subset(X1,X2))&(~(subset(X1,X2))|element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(54, plain,![X3]:![X4]:((~(element(X3,powerset(X4)))|subset(X3,X4))&(~(subset(X3,X4))|element(X3,powerset(X4)))),inference(variable_rename,[status(thm)],[53])).
% cnf(55,plain,(element(X1,powerset(X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[54])).
% fof(57, plain,![X1]:![X2]:![X3]:((~(in(X1,X2))|~(element(X2,powerset(X3))))|element(X1,X3)),inference(fof_nnf,[status(thm)],[9])).
% fof(58, plain,![X4]:![X5]:![X6]:((~(in(X4,X5))|~(element(X5,powerset(X6))))|element(X4,X6)),inference(variable_rename,[status(thm)],[57])).
% cnf(59,plain,(element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3)),inference(split_conjunct,[status(thm)],[58])).
% fof(60, plain,![X1]:![X2]:(~(element(X1,X2))|(empty(X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(61, plain,![X3]:![X4]:(~(element(X3,X4))|(empty(X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[60])).
% cnf(62,plain,(in(X1,X2)|empty(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[61])).
% fof(63, plain,![X1]:![X2]:![X3]:((~(in(X1,X2))|~(element(X2,powerset(X3))))|~(empty(X3))),inference(fof_nnf,[status(thm)],[11])).
% fof(64, plain,![X4]:![X5]:![X6]:((~(in(X4,X5))|~(element(X5,powerset(X6))))|~(empty(X6))),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2)),inference(split_conjunct,[status(thm)],[64])).
% fof(126, negated_conjecture,?[X1]:?[X2]:(in(X1,X2)&subset(X2,X1)),inference(fof_nnf,[status(thm)],[29])).
% fof(127, negated_conjecture,?[X3]:?[X4]:(in(X3,X4)&subset(X4,X3)),inference(variable_rename,[status(thm)],[126])).
% fof(128, negated_conjecture,(in(esk12_0,esk13_0)&subset(esk13_0,esk12_0)),inference(skolemize,[status(esa)],[127])).
% cnf(129,negated_conjecture,(subset(esk13_0,esk12_0)),inference(split_conjunct,[status(thm)],[128])).
% cnf(130,negated_conjecture,(in(esk12_0,esk13_0)),inference(split_conjunct,[status(thm)],[128])).
% cnf(144,plain,(empty(X2)|~in(X2,X1)|~element(X1,X2)),inference(spm,[status(thm)],[35,62,theory(equality)])).
% cnf(152,plain,(~empty(X2)|~in(X3,X1)|~subset(X1,X2)),inference(spm,[status(thm)],[65,55,theory(equality)])).
% cnf(154,plain,(element(X1,X2)|~in(X1,X3)|~subset(X3,X2)),inference(spm,[status(thm)],[59,55,theory(equality)])).
% cnf(160,plain,(empty(X1)|empty(X2)|~element(X2,X1)|~element(X1,X2)),inference(spm,[status(thm)],[144,62,theory(equality)])).
% cnf(164,negated_conjecture,(~empty(esk12_0)|~in(X1,esk13_0)),inference(spm,[status(thm)],[152,129,theory(equality)])).
% cnf(167,negated_conjecture,(~empty(esk12_0)),inference(spm,[status(thm)],[164,130,theory(equality)])).
% cnf(170,negated_conjecture,(element(X1,esk12_0)|~in(X1,esk13_0)),inference(spm,[status(thm)],[154,129,theory(equality)])).
% cnf(173,negated_conjecture,(element(esk12_0,esk12_0)),inference(spm,[status(thm)],[170,130,theory(equality)])).
% cnf(181,negated_conjecture,(empty(esk12_0)|~element(esk12_0,esk12_0)),inference(spm,[status(thm)],[160,173,theory(equality)])).
% cnf(187,negated_conjecture,(empty(esk12_0)|$false),inference(rw,[status(thm)],[181,173,theory(equality)])).
% cnf(188,negated_conjecture,(empty(esk12_0)),inference(cn,[status(thm)],[187,theory(equality)])).
% cnf(189,negated_conjecture,($false),inference(sr,[status(thm)],[188,167,theory(equality)])).
% cnf(190,negated_conjecture,($false),189,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 112
% # ...of these trivial : 3
% # ...subsumed : 5
% # ...remaining for further processing: 104
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 40
% # ...of the previous two non-trivial : 33
% # Contextual simplify-reflections : 2
% # Paramodulations : 40
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 56
% # Positive orientable unit clauses: 29
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 22
% # Current number of unprocessed clauses: 5
% # ...number of literals in the above : 10
% # Clause-clause subsumption calls (NU) : 35
% # Rec. Clause-clause subsumption calls : 29
% # Unit Clause-clause subsumption calls : 26
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 61 leaves, 1.18+/-0.666 terms/leaf
% # Paramod-from index: 34 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 59 leaves, 1.10+/-0.354 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.004 s
% # Total time : 0.018 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/SystemOnTPTP18312/NUM383+1.tptp
%
%------------------------------------------------------------------------------