TSTP Solution File: SWV405+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV405+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 : art02.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:56:02 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP25455/SWV405+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25455/SWV405+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25455/SWV405+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 25551
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:~(pair_in_list(create_slb,X1,X2)),file('/tmp/SRASS.s.p', ax22)).
% fof(5, axiom,![X1]:![X2]:check_cpq(triple(X1,create_slb,X2)),file('/tmp/SRASS.s.p', ax36)).
% fof(42, conjecture,![X1]:![X2]:(check_cpq(triple(X1,create_slb,X2))<=>![X3]:![X4]:(pair_in_list(create_slb,X3,X4)=>less_than(X4,X3))),file('/tmp/SRASS.s.p', l41_co)).
% fof(43, negated_conjecture,~(![X1]:![X2]:(check_cpq(triple(X1,create_slb,X2))<=>![X3]:![X4]:(pair_in_list(create_slb,X3,X4)=>less_than(X4,X3)))),inference(assume_negation,[status(cth)],[42])).
% fof(44, plain,![X1]:![X2]:~(pair_in_list(create_slb,X1,X2)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(60, plain,![X3]:![X4]:~(pair_in_list(create_slb,X3,X4)),inference(variable_rename,[status(thm)],[44])).
% cnf(61,plain,(~pair_in_list(create_slb,X1,X2)),inference(split_conjunct,[status(thm)],[60])).
% fof(62, plain,![X3]:![X4]:check_cpq(triple(X3,create_slb,X4)),inference(variable_rename,[status(thm)],[5])).
% cnf(63,plain,(check_cpq(triple(X1,create_slb,X2))),inference(split_conjunct,[status(thm)],[62])).
% fof(170, negated_conjecture,?[X1]:?[X2]:((~(check_cpq(triple(X1,create_slb,X2)))|?[X3]:?[X4]:(pair_in_list(create_slb,X3,X4)&~(less_than(X4,X3))))&(check_cpq(triple(X1,create_slb,X2))|![X3]:![X4]:(~(pair_in_list(create_slb,X3,X4))|less_than(X4,X3)))),inference(fof_nnf,[status(thm)],[43])).
% fof(171, negated_conjecture,?[X5]:?[X6]:((~(check_cpq(triple(X5,create_slb,X6)))|?[X7]:?[X8]:(pair_in_list(create_slb,X7,X8)&~(less_than(X8,X7))))&(check_cpq(triple(X5,create_slb,X6))|![X9]:![X10]:(~(pair_in_list(create_slb,X9,X10))|less_than(X10,X9)))),inference(variable_rename,[status(thm)],[170])).
% fof(172, negated_conjecture,((~(check_cpq(triple(esk1_0,create_slb,esk2_0)))|(pair_in_list(create_slb,esk3_0,esk4_0)&~(less_than(esk4_0,esk3_0))))&(check_cpq(triple(esk1_0,create_slb,esk2_0))|![X9]:![X10]:(~(pair_in_list(create_slb,X9,X10))|less_than(X10,X9)))),inference(skolemize,[status(esa)],[171])).
% fof(173, negated_conjecture,![X9]:![X10]:(((~(pair_in_list(create_slb,X9,X10))|less_than(X10,X9))|check_cpq(triple(esk1_0,create_slb,esk2_0)))&(~(check_cpq(triple(esk1_0,create_slb,esk2_0)))|(pair_in_list(create_slb,esk3_0,esk4_0)&~(less_than(esk4_0,esk3_0))))),inference(shift_quantors,[status(thm)],[172])).
% fof(174, negated_conjecture,![X9]:![X10]:(((~(pair_in_list(create_slb,X9,X10))|less_than(X10,X9))|check_cpq(triple(esk1_0,create_slb,esk2_0)))&((pair_in_list(create_slb,esk3_0,esk4_0)|~(check_cpq(triple(esk1_0,create_slb,esk2_0))))&(~(less_than(esk4_0,esk3_0))|~(check_cpq(triple(esk1_0,create_slb,esk2_0)))))),inference(distribute,[status(thm)],[173])).
% cnf(176,negated_conjecture,(pair_in_list(create_slb,esk3_0,esk4_0)|~check_cpq(triple(esk1_0,create_slb,esk2_0))),inference(split_conjunct,[status(thm)],[174])).
% cnf(179,negated_conjecture,(pair_in_list(create_slb,esk3_0,esk4_0)|$false),inference(rw,[status(thm)],[176,63,theory(equality)])).
% cnf(180,negated_conjecture,(pair_in_list(create_slb,esk3_0,esk4_0)),inference(cn,[status(thm)],[179,theory(equality)])).
% cnf(181,negated_conjecture,($false),inference(sr,[status(thm)],[180,61,theory(equality)])).
% cnf(182,negated_conjecture,($false),181,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 10
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 10
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 9
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 41
% # ...number of literals in the above : 93
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # 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: 12 leaves, 1.17+/-0.553 terms/leaf
% # Paramod-from index: 5 leaves, 1.40+/-0.800 terms/leaf
% # Paramod-into index: 11 leaves, 1.18+/-0.575 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.005 s
% # Total time : 0.017 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/SystemOnTPTP25455/SWV405+1.tptp
%
%------------------------------------------------------------------------------