TSTP Solution File: NUM613+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM613+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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 20:37:52 EST 2010
% Result : Theorem 14.45s
% Output : Solution 14.45s
% 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/SystemOnTPTP13648/NUM613+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13648/NUM613+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13648/NUM613+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 13744
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.01 WC
% PrfWatch: 3.93 CPU 4.02 WC
% PrfWatch: 5.92 CPU 6.02 WC
% PrfWatch: 7.91 CPU 8.03 WC
% PrfWatch: 9.52 CPU 10.03 WC
% # Preprocessing time : 0.616 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 11.17 CPU 12.04 WC
% PrfWatch: 13.17 CPU 14.04 WC
% # SZS output start CNFRefutation.
% fof(22, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>(szszuzczcdt0(X1)=szszuzczcdt0(X2)=>X1=X2)),file('/tmp/SRASS.s.p', mSuccEquSucc)).
% fof(64, axiom,(aElementOf0(xk,szNzAzT0)&szszuzczcdt0(xk)=xK),file('/tmp/SRASS.s.p', m__3533)).
% fof(83, axiom,((((aSet0(xQ)&![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),file('/tmp/SRASS.s.p', m__5078)).
% fof(93, axiom,((sbrdtbr0(xQ)=szszuzczcdt0(xk)&szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ))&aElementOf0(sbrdtbr0(xP),szNzAzT0)),file('/tmp/SRASS.s.p', m__5255)).
% fof(110, conjecture,sbrdtbr0(xP)=xk,file('/tmp/SRASS.s.p', m__)).
% fof(111, negated_conjecture,~(sbrdtbr0(xP)=xk),inference(assume_negation,[status(cth)],[110])).
% fof(124, negated_conjecture,~(sbrdtbr0(xP)=xk),inference(fof_simplification,[status(thm)],[111,theory(equality)])).
% fof(233, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|(~(szszuzczcdt0(X1)=szszuzczcdt0(X2))|X1=X2)),inference(fof_nnf,[status(thm)],[22])).
% fof(234, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|(~(szszuzczcdt0(X3)=szszuzczcdt0(X4))|X3=X4)),inference(variable_rename,[status(thm)],[233])).
% cnf(235,plain,(X1=X2|szszuzczcdt0(X1)!=szszuzczcdt0(X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[234])).
% cnf(4411,plain,(szszuzczcdt0(xk)=xK),inference(split_conjunct,[status(thm)],[64])).
% cnf(4412,plain,(aElementOf0(xk,szNzAzT0)),inference(split_conjunct,[status(thm)],[64])).
% fof(4588, plain,((((aSet0(xQ)&![X1]:(~(aElementOf0(X1,xQ))|aElementOf0(X1,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(fof_nnf,[status(thm)],[83])).
% fof(4589, plain,((((aSet0(xQ)&![X2]:(~(aElementOf0(X2,xQ))|aElementOf0(X2,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(variable_rename,[status(thm)],[4588])).
% fof(4590, plain,![X2]:(((((~(aElementOf0(X2,xQ))|aElementOf0(X2,xO))&aSet0(xQ))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(shift_quantors,[status(thm)],[4589])).
% cnf(4592,plain,(sbrdtbr0(xQ)=xK),inference(split_conjunct,[status(thm)],[4590])).
% cnf(4648,plain,(aElementOf0(sbrdtbr0(xP),szNzAzT0)),inference(split_conjunct,[status(thm)],[93])).
% cnf(4649,plain,(szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ)),inference(split_conjunct,[status(thm)],[93])).
% cnf(4720,negated_conjecture,(sbrdtbr0(xP)!=xk),inference(split_conjunct,[status(thm)],[124])).
% cnf(5374,plain,(szszuzczcdt0(sbrdtbr0(xP))=xK),inference(rw,[status(thm)],[4649,4592,theory(equality)])).
% cnf(8938,plain,(X1=xk|szszuzczcdt0(X1)!=xK|~aElementOf0(xk,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[235,4411,theory(equality)])).
% cnf(8943,plain,(X1=xk|szszuzczcdt0(X1)!=xK|$false|~aElementOf0(X1,szNzAzT0)),inference(rw,[status(thm)],[8938,4412,theory(equality)])).
% cnf(8944,plain,(X1=xk|szszuzczcdt0(X1)!=xK|~aElementOf0(X1,szNzAzT0)),inference(cn,[status(thm)],[8943,theory(equality)])).
% cnf(86325,plain,(sbrdtbr0(xP)=xk|~aElementOf0(sbrdtbr0(xP),szNzAzT0)),inference(spm,[status(thm)],[8944,5374,theory(equality)])).
% cnf(86329,plain,(sbrdtbr0(xP)=xk|$false),inference(rw,[status(thm)],[86325,4648,theory(equality)])).
% cnf(86330,plain,(sbrdtbr0(xP)=xk),inference(cn,[status(thm)],[86329,theory(equality)])).
% cnf(86331,plain,($false),inference(sr,[status(thm)],[86330,4720,theory(equality)])).
% cnf(86332,plain,($false),86331,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6865
% # ...of these trivial : 19
% # ...subsumed : 615
% # ...remaining for further processing: 6231
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 17
% # Generated clauses : 59510
% # ...of the previous two non-trivial : 50742
% # Contextual simplify-reflections : 3078
% # Paramodulations : 59459
% # Factorizations : 0
% # Equation resolutions : 46
% # Current number of processed clauses: 3160
% # Positive orientable unit clauses: 93
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 22
% # Non-unit-clauses : 3045
% # Current number of unprocessed clauses: 50210
% # ...number of literals in the above : 738910
% # Clause-clause subsumption calls (NU) : 1955804
% # Rec. Clause-clause subsumption calls : 46478
% # Unit Clause-clause subsumption calls : 38836
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 452 leaves, 2.04+/-2.680 terms/leaf
% # Paramod-from index: 217 leaves, 1.02+/-0.150 terms/leaf
% # Paramod-into index: 406 leaves, 1.50+/-1.431 terms/leaf
% # -------------------------------------------------
% # User time : 10.280 s
% # System time : 0.188 s
% # Total time : 10.468 s
% # Maximum resident set size: 0 pages
% PrfWatch: 13.35 CPU 14.23 WC
% FINAL PrfWatch: 13.35 CPU 14.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP13648/NUM613+3.tptp
%
%------------------------------------------------------------------------------