TSTP Solution File: SWV389+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV389+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 08:52:34 EST 2010
% Result : Theorem 0.95s
% Output : Solution 0.95s
% 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/SystemOnTPTP20836/SWV389+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20836/SWV389+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20836/SWV389+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 20932
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:((check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))&ok(removemin_cpq_eff(triple(X1,X2,X3))))=>check_cpq(triple(X1,X2,X3))),file('/tmp/SRASS.s.p', l25_l40)).
% fof(26, axiom,![X1]:removemin_cpq_eff(X1)=remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),file('/tmp/SRASS.s.p', ax52)).
% fof(43, conjecture,![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>(~(check_cpq(removemin_cpq_eff(triple(X1,X2,X3))))|~(ok(removemin_cpq_eff(triple(X1,X2,X3)))))),file('/tmp/SRASS.s.p', l25_co)).
% fof(44, negated_conjecture,~(![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>(~(check_cpq(removemin_cpq_eff(triple(X1,X2,X3))))|~(ok(removemin_cpq_eff(triple(X1,X2,X3))))))),inference(assume_negation,[status(cth)],[43])).
% fof(54, negated_conjecture,~(![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>(~(check_cpq(removemin_cpq_eff(triple(X1,X2,X3))))|~(ok(removemin_cpq_eff(triple(X1,X2,X3))))))),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(55, plain,![X1]:![X2]:![X3]:((~(check_cpq(removemin_cpq_eff(triple(X1,X2,X3))))|~(ok(removemin_cpq_eff(triple(X1,X2,X3)))))|check_cpq(triple(X1,X2,X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(56, plain,![X4]:![X5]:![X6]:((~(check_cpq(removemin_cpq_eff(triple(X4,X5,X6))))|~(ok(removemin_cpq_eff(triple(X4,X5,X6)))))|check_cpq(triple(X4,X5,X6))),inference(variable_rename,[status(thm)],[55])).
% cnf(57,plain,(check_cpq(triple(X1,X2,X3))|~ok(removemin_cpq_eff(triple(X1,X2,X3)))|~check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))),inference(split_conjunct,[status(thm)],[56])).
% fof(131, plain,![X2]:removemin_cpq_eff(X2)=remove_cpq(findmin_cpq_eff(X2),findmin_cpq_res(X2)),inference(variable_rename,[status(thm)],[26])).
% cnf(132,plain,(removemin_cpq_eff(X1)=remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1))),inference(split_conjunct,[status(thm)],[131])).
% fof(175, negated_conjecture,?[X1]:?[X2]:?[X3]:(~(check_cpq(triple(X1,X2,X3)))&(check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))&ok(removemin_cpq_eff(triple(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[54])).
% fof(176, negated_conjecture,?[X4]:?[X5]:?[X6]:(~(check_cpq(triple(X4,X5,X6)))&(check_cpq(removemin_cpq_eff(triple(X4,X5,X6)))&ok(removemin_cpq_eff(triple(X4,X5,X6))))),inference(variable_rename,[status(thm)],[175])).
% fof(177, negated_conjecture,(~(check_cpq(triple(esk1_0,esk2_0,esk3_0)))&(check_cpq(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))&ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))))),inference(skolemize,[status(esa)],[176])).
% cnf(178,negated_conjecture,(ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))),inference(split_conjunct,[status(thm)],[177])).
% cnf(179,negated_conjecture,(check_cpq(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))),inference(split_conjunct,[status(thm)],[177])).
% cnf(180,negated_conjecture,(~check_cpq(triple(esk1_0,esk2_0,esk3_0))),inference(split_conjunct,[status(thm)],[177])).
% cnf(181,negated_conjecture,(check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))),inference(rw,[status(thm)],[179,132,theory(equality)]),['unfolding']).
% cnf(182,negated_conjecture,(ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))),inference(rw,[status(thm)],[178,132,theory(equality)]),['unfolding']).
% cnf(184,plain,(check_cpq(triple(X1,X2,X3))|~check_cpq(remove_cpq(findmin_cpq_eff(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))))|~ok(remove_cpq(findmin_cpq_eff(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[57,132,theory(equality)]),132,theory(equality)]),['unfolding']).
% cnf(302,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))|~check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))),inference(spm,[status(thm)],[184,182,theory(equality)])).
% cnf(309,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))|$false),inference(rw,[status(thm)],[302,181,theory(equality)])).
% cnf(310,negated_conjecture,(check_cpq(triple(esk1_0,esk2_0,esk3_0))),inference(cn,[status(thm)],[309,theory(equality)])).
% cnf(311,negated_conjecture,($false),inference(sr,[status(thm)],[310,180,theory(equality)])).
% cnf(312,negated_conjecture,($false),311,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 104
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 104
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 100
% # ...of the previous two non-trivial : 87
% # Contextual simplify-reflections : 2
% # Paramodulations : 96
% # Factorizations : 2
% # Equation resolutions : 3
% # Current number of processed clauses: 50
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 30
% # Current number of unprocessed clauses: 87
% # ...number of literals in the above : 286
% # Clause-clause subsumption calls (NU) : 36
% # Rec. Clause-clause subsumption calls : 34
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 72 leaves, 1.75+/-1.470 terms/leaf
% # Paramod-from index: 30 leaves, 1.27+/-0.512 terms/leaf
% # Paramod-into index: 62 leaves, 1.60+/-1.373 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.005 s
% # Total time : 0.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP20836/SWV389+1.tptp
%
%------------------------------------------------------------------------------