TSTP Solution File: PUZ001+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PUZ001+1 : TPTP v5.4.0. Released v2.0.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
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Fri Mar 15 18:41:37 EDT 2013
% Result : Theorem 0.70s
% Output : Solution 0.70s
% 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/SystemOnTPTP2649/PUZ001+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2649/PUZ001+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2649/PUZ001+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/tptp/Systems/EP---1.6/eproof_ram --print-statistics --auto --cpu-limit=60 --memory-limit=1024 --tstp-format /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 2786
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # No SinE strategy applied
% # Auto-Ordering is analysing problem.
% # Problem is type GHSFNFFSS11SS
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreqconjmax>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSFNFFSS11SS
% # Auto-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 14
% # Removed by relevancy pruning/SinE : 0
% # Initial clauses : 15
% # Removed in clause preprocessing : 0
% # Initial clauses in saturation : 15
% # Processed clauses : 37
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 34
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 7
% # Generated clauses : 36
% # ...of the previous two non-trivial : 32
% # Contextual simplify-reflections : 1
% # Paramodulations : 35
% # Factorizations : 1
% # Equation resolutions : 0
% # Current number of processed clauses: 23
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 11
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 17
% # Rec. Clause-clause subsumption calls : 15
% # Non-unit clause-clause subsumptions: 4
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 1
% # BW rewrite match successes : 1
% # Condensation attempts : 0
% # Condensation successes : 0
% # SZS output start CNFRefutation.
% fof(1, axiom,?[X1]:(lives(X1)&killed(X1,agatha)),file('/tmp/SRASS.s.p', pel55_1)).
% fof(2, axiom,![X1]:![X2]:(killed(X1,X2)=>hates(X1,X2)),file('/tmp/SRASS.s.p', pel55_4)).
% fof(4, axiom,![X1]:?[X2]:~(hates(X1,X2)),file('/tmp/SRASS.s.p', pel55_10)).
% fof(5, axiom,![X1]:![X2]:(killed(X1,X2)=>~(richer(X1,X2))),file('/tmp/SRASS.s.p', pel55_5)).
% fof(7, axiom,![X1]:(hates(agatha,X1)=>hates(butler,X1)),file('/tmp/SRASS.s.p', pel55_9)).
% fof(8, axiom,![X1]:(hates(agatha,X1)=>~(hates(charles,X1))),file('/tmp/SRASS.s.p', pel55_6)).
% fof(9, axiom,~(agatha=butler),file('/tmp/SRASS.s.p', pel55_11)).
% fof(11, axiom,![X1]:(~(X1=butler)=>hates(agatha,X1)),file('/tmp/SRASS.s.p', pel55_7)).
% fof(12, axiom,![X1]:(~(richer(X1,agatha))=>hates(butler,X1)),file('/tmp/SRASS.s.p', pel55_8)).
% fof(13, axiom,![X1]:(lives(X1)=>((X1=agatha|X1=butler)|X1=charles)),file('/tmp/SRASS.s.p', pel55_3)).
% fof(14, conjecture,killed(agatha,agatha),file('/tmp/SRASS.s.p', pel55)).
% fof(15, negated_conjecture,~(killed(agatha,agatha)),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X1]:?[X2]:~(hates(X1,X2)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(17, plain,![X1]:![X2]:(killed(X1,X2)=>~(richer(X1,X2))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(18, plain,![X1]:(hates(agatha,X1)=>~(hates(charles,X1))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(19, plain,![X1]:(~(richer(X1,agatha))=>hates(butler,X1)),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(20, negated_conjecture,~(killed(agatha,agatha)),inference(fof_simplification,[status(thm)],[15,theory(equality)])).
% fof(21, plain,?[X2]:(lives(X2)&killed(X2,agatha)),inference(variable_rename,[status(thm)],[1])).
% fof(22, plain,(lives(esk1_0)&killed(esk1_0,agatha)),inference(skolemize,[status(esa)],[21])).
% cnf(23,plain,(killed(esk1_0,agatha)),inference(split_conjunct,[status(thm)],[22])).
% cnf(24,plain,(lives(esk1_0)),inference(split_conjunct,[status(thm)],[22])).
% fof(25, plain,![X1]:![X2]:(~(killed(X1,X2))|hates(X1,X2)),inference(fof_nnf,[status(thm)],[2])).
% fof(26, plain,![X3]:![X4]:(~(killed(X3,X4))|hates(X3,X4)),inference(variable_rename,[status(thm)],[25])).
% cnf(27,plain,(hates(X1,X2)|~killed(X1,X2)),inference(split_conjunct,[status(thm)],[26])).
% fof(29, plain,![X3]:?[X4]:~(hates(X3,X4)),inference(variable_rename,[status(thm)],[16])).
% fof(30, plain,![X3]:~(hates(X3,esk2_1(X3))),inference(skolemize,[status(esa)],[29])).
% cnf(31,plain,(~hates(X1,esk2_1(X1))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X1]:![X2]:(~(killed(X1,X2))|~(richer(X1,X2))),inference(fof_nnf,[status(thm)],[17])).
% fof(33, plain,![X3]:![X4]:(~(killed(X3,X4))|~(richer(X3,X4))),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(~richer(X1,X2)|~killed(X1,X2)),inference(split_conjunct,[status(thm)],[33])).
% fof(36, plain,![X1]:(~(hates(agatha,X1))|hates(butler,X1)),inference(fof_nnf,[status(thm)],[7])).
% fof(37, plain,![X2]:(~(hates(agatha,X2))|hates(butler,X2)),inference(variable_rename,[status(thm)],[36])).
% cnf(38,plain,(hates(butler,X1)|~hates(agatha,X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X1]:(~(hates(agatha,X1))|~(hates(charles,X1))),inference(fof_nnf,[status(thm)],[18])).
% fof(40, plain,![X2]:(~(hates(agatha,X2))|~(hates(charles,X2))),inference(variable_rename,[status(thm)],[39])).
% cnf(41,plain,(~hates(charles,X1)|~hates(agatha,X1)),inference(split_conjunct,[status(thm)],[40])).
% cnf(42,plain,(agatha!=butler),inference(split_conjunct,[status(thm)],[9])).
% fof(44, plain,![X1]:(X1=butler|hates(agatha,X1)),inference(fof_nnf,[status(thm)],[11])).
% fof(45, plain,![X2]:(X2=butler|hates(agatha,X2)),inference(variable_rename,[status(thm)],[44])).
% cnf(46,plain,(hates(agatha,X1)|X1=butler),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X1]:(richer(X1,agatha)|hates(butler,X1)),inference(fof_nnf,[status(thm)],[19])).
% fof(48, plain,![X2]:(richer(X2,agatha)|hates(butler,X2)),inference(variable_rename,[status(thm)],[47])).
% cnf(49,plain,(hates(butler,X1)|richer(X1,agatha)),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X1]:(~(lives(X1))|((X1=agatha|X1=butler)|X1=charles)),inference(fof_nnf,[status(thm)],[13])).
% fof(51, plain,![X2]:(~(lives(X2))|((X2=agatha|X2=butler)|X2=charles)),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(X1=charles|X1=butler|X1=agatha|~lives(X1)),inference(split_conjunct,[status(thm)],[51])).
% cnf(53,negated_conjecture,(~killed(agatha,agatha)),inference(split_conjunct,[status(thm)],[20])).
% cnf(54,plain,(charles=esk1_0|butler=esk1_0|agatha=esk1_0),inference(spm,[status(thm)],[52,24,theory(equality)])).
% cnf(56,plain,(butler=X1|~hates(charles,X1)),inference(spm,[status(thm)],[41,46,theory(equality)])).
% cnf(57,plain,(hates(butler,X1)|~killed(X1,agatha)),inference(spm,[status(thm)],[34,49,theory(equality)])).
% cnf(58,plain,(hates(butler,X1)|butler=X1),inference(spm,[status(thm)],[38,46,theory(equality)])).
% cnf(59,plain,(hates(esk1_0,agatha)),inference(spm,[status(thm)],[27,23,theory(equality)])).
% cnf(61,plain,(hates(butler,esk1_0)),inference(spm,[status(thm)],[57,23,theory(equality)])).
% cnf(64,plain,(killed(esk1_0,esk1_0)|esk1_0=butler|esk1_0=charles),inference(spm,[status(thm)],[23,54,theory(equality)])).
% cnf(66,negated_conjecture,(esk1_0=butler|esk1_0=charles|~killed(esk1_0,esk1_0)),inference(spm,[status(thm)],[53,54,theory(equality)])).
% cnf(75,plain,(esk1_0=charles|esk1_0=butler),inference(csr,[status(thm)],[64,66])).
% cnf(79,plain,(hates(charles,agatha)|esk1_0=butler),inference(spm,[status(thm)],[59,75,theory(equality)])).
% cnf(82,plain,(butler=esk2_1(butler)),inference(spm,[status(thm)],[31,58,theory(equality)])).
% cnf(88,plain,(~hates(butler,butler)),inference(spm,[status(thm)],[31,82,theory(equality)])).
% cnf(95,plain,(butler=agatha|esk1_0=butler),inference(spm,[status(thm)],[56,79,theory(equality)])).
% cnf(96,plain,(esk1_0=butler),inference(sr,[status(thm)],[95,42,theory(equality)])).
% cnf(100,plain,(hates(butler,butler)),inference(rw,[status(thm)],[61,96,theory(equality)])).
% cnf(101,plain,($false),inference(sr,[status(thm)],[100,88,theory(equality)])).
% cnf(102,plain,($false),101,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.03 CPU 0.13 WC
% FINAL PrfWatch: 0.03 CPU 0.13 WC
% SZS output end Solution for /tmp/SystemOnTPTP2649/PUZ001+1.tptp
% WARNING: TreeLimitedRun lost 0.17s, total lost is 0.17s
%
%------------------------------------------------------------------------------