TSTP Solution File: AGT004+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : AGT004+2 : TPTP v5.0.0. Bugfixed v3.1.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 : Tue Dec 28 20:09:03 EST 2010
% Result : Theorem 66.60s
% Output : Solution 66.60s
% 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/SystemOnTPTP14237/AGT004+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14237/AGT004+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14237/AGT004+2.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 14372
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.053 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(9, axiom,~(accept_city(countryamedicalorganization,coastvillage)),file('/tmp/SRASS.s.p', deduced_13)).
% fof(439, axiom,![X2]:![X4]:![X10]:![X3]:(accept_team(X2,X3,X4,X10)<=>((accept_city(X2,X4)&accept_leader(X2,X3))&accept_number(X2,X10))),file('/tmp/SRASS.s.p', a1_1)).
% fof(923, conjecture,~(accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5)),file('/tmp/SRASS.s.p', query_4)).
% fof(924, negated_conjecture,~(~(accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5))),inference(assume_negation,[status(cth)],[923])).
% fof(927, plain,~(accept_city(countryamedicalorganization,coastvillage)),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(971, negated_conjecture,accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),inference(fof_simplification,[status(thm)],[924,theory(equality)])).
% cnf(980,plain,(~accept_city(countryamedicalorganization,coastvillage)),inference(split_conjunct,[status(thm)],[927])).
% fof(1418, plain,![X2]:![X4]:![X10]:![X3]:((~(accept_team(X2,X3,X4,X10))|((accept_city(X2,X4)&accept_leader(X2,X3))&accept_number(X2,X10)))&(((~(accept_city(X2,X4))|~(accept_leader(X2,X3)))|~(accept_number(X2,X10)))|accept_team(X2,X3,X4,X10))),inference(fof_nnf,[status(thm)],[439])).
% fof(1419, plain,![X11]:![X12]:![X13]:![X14]:((~(accept_team(X11,X14,X12,X13))|((accept_city(X11,X12)&accept_leader(X11,X14))&accept_number(X11,X13)))&(((~(accept_city(X11,X12))|~(accept_leader(X11,X14)))|~(accept_number(X11,X13)))|accept_team(X11,X14,X12,X13))),inference(variable_rename,[status(thm)],[1418])).
% fof(1420, plain,![X11]:![X12]:![X13]:![X14]:((((accept_city(X11,X12)|~(accept_team(X11,X14,X12,X13)))&(accept_leader(X11,X14)|~(accept_team(X11,X14,X12,X13))))&(accept_number(X11,X13)|~(accept_team(X11,X14,X12,X13))))&(((~(accept_city(X11,X12))|~(accept_leader(X11,X14)))|~(accept_number(X11,X13)))|accept_team(X11,X14,X12,X13))),inference(distribute,[status(thm)],[1419])).
% cnf(1424,plain,(accept_city(X1,X3)|~accept_team(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[1420])).
% cnf(2048,negated_conjecture,(accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5)),inference(split_conjunct,[status(thm)],[971])).
% cnf(2719,negated_conjecture,(accept_city(countryamedicalorganization,coastvillage)),inference(spm,[status(thm)],[1424,2048,theory(equality)])).
% cnf(2832,negated_conjecture,($false),inference(sr,[status(thm)],[2719,980,theory(equality)])).
% cnf(2833,negated_conjecture,($false),2832,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 674
% # ...of these trivial : 37
% # ...subsumed : 0
% # ...remaining for further processing: 637
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 383
% # ...of the previous two non-trivial : 13
% # Contextual simplify-reflections : 0
% # Paramodulations : 379
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 635
% # Positive orientable unit clauses: 572
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 45
% # Non-unit-clauses : 18
% # Current number of unprocessed clauses: 335
% # ...number of literals in the above : 489
% # Clause-clause subsumption calls (NU) : 16
% # Rec. Clause-clause subsumption calls : 16
% # Unit Clause-clause subsumption calls : 158
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 345
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 504 leaves, 1.43+/-0.973 terms/leaf
% # Paramod-from index: 395 leaves, 1.46+/-0.936 terms/leaf
% # Paramod-into index: 493 leaves, 1.44+/-0.982 terms/leaf
% # -------------------------------------------------
% # User time : 0.068 s
% # System time : 0.011 s
% # Total time : 0.079 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.33 WC
% FINAL PrfWatch: 0.23 CPU 0.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP14237/AGT004+2.tptp
%
%------------------------------------------------------------------------------