%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO080+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 04:19:53 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP5415/GEO080+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5415/GEO080+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5415/GEO080+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 5511
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(part_of(X2,X1)<=>![X5]:(incident_c(X5,X2)=>incident_c(X5,X1))),file('/tmp/SRASS.s.p', part_of_defn)).
% fof(17, conjecture,![X1]:part_of(X1,X1),file('/tmp/SRASS.s.p', prove_reflexivity)).
% fof(18, negated_conjecture,~(![X1]:part_of(X1,X1)),inference(assume_negation,[status(cth)],[17])).
% fof(24, plain,![X1]:![X2]:((~(part_of(X2,X1))|![X5]:(~(incident_c(X5,X2))|incident_c(X5,X1)))&(?[X5]:(incident_c(X5,X2)&~(incident_c(X5,X1)))|part_of(X2,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(25, plain,![X6]:![X7]:((~(part_of(X7,X6))|![X8]:(~(incident_c(X8,X7))|incident_c(X8,X6)))&(?[X9]:(incident_c(X9,X7)&~(incident_c(X9,X6)))|part_of(X7,X6))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X6]:![X7]:((~(part_of(X7,X6))|![X8]:(~(incident_c(X8,X7))|incident_c(X8,X6)))&((incident_c(esk1_2(X6,X7),X7)&~(incident_c(esk1_2(X6,X7),X6)))|part_of(X7,X6))),inference(skolemize,[status(esa)],[25])).
% fof(27, plain,![X6]:![X7]:![X8]:(((~(incident_c(X8,X7))|incident_c(X8,X6))|~(part_of(X7,X6)))&((incident_c(esk1_2(X6,X7),X7)&~(incident_c(esk1_2(X6,X7),X6)))|part_of(X7,X6))),inference(shift_quantors,[status(thm)],[26])).
% fof(28, plain,![X6]:![X7]:![X8]:(((~(incident_c(X8,X7))|incident_c(X8,X6))|~(part_of(X7,X6)))&((incident_c(esk1_2(X6,X7),X7)|part_of(X7,X6))&(~(incident_c(esk1_2(X6,X7),X6))|part_of(X7,X6)))),inference(distribute,[status(thm)],[27])).
% cnf(29,plain,(part_of(X1,X2)|~incident_c(esk1_2(X2,X1),X2)),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,plain,(part_of(X1,X2)|incident_c(esk1_2(X2,X1),X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(122, negated_conjecture,?[X1]:~(part_of(X1,X1)),inference(fof_nnf,[status(thm)],[18])).
% fof(123, negated_conjecture,?[X2]:~(part_of(X2,X2)),inference(variable_rename,[status(thm)],[122])).
% fof(124, negated_conjecture,~(part_of(esk14_0,esk14_0)),inference(skolemize,[status(esa)],[123])).
% cnf(125,negated_conjecture,(~part_of(esk14_0,esk14_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(136,plain,(part_of(X1,X1)),inference(spm,[status(thm)],[29,30,theory(equality)])).
% cnf(192,negated_conjecture,($false),inference(rw,[status(thm)],[125,136,theory(equality)])).
% cnf(193,negated_conjecture,($false),inference(cn,[status(thm)],[192,theory(equality)])).
% cnf(194,negated_conjecture,($false),193,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 89
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 89
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 66
% # ...of the previous two non-trivial : 53
% # Contextual simplify-reflections : 0
% # Paramodulations : 52
% # Factorizations : 8
% # Equation resolutions : 6
% # Current number of processed clauses: 44
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 42
% # Current number of unprocessed clauses: 51
% # ...number of literals in the above : 236
% # Clause-clause subsumption calls (NU) : 116
% # Rec. Clause-clause subsumption calls : 96
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 16
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 39 leaves, 2.05+/-2.207 terms/leaf
% # Paramod-from index: 16 leaves, 1.31+/-0.583 terms/leaf
% # Paramod-into index: 35 leaves, 1.57+/-1.103 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.005 s
% # Total time : 0.026 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP5415/GEO080+1.tptp
%
%------------------------------------------------------------------------------