TSTP Solution File: KLE048+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE048+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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 07:45:33 EST 2010
% Result : Theorem 1.41s
% Output : Solution 1.41s
% 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/SystemOnTPTP12075/KLE048+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12075/KLE048+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12075/KLE048+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 12171
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(4, axiom,![X1]:leq(addition(one,multiplication(X1,star(X1))),star(X1)),file('/tmp/SRASS.s.p', star_unfold_right)).
% fof(6, axiom,![X4]:(test(X4)<=>?[X5]:complement(X5,X4)),file('/tmp/SRASS.s.p', test_1)).
% fof(7, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(10, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(11, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(12, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(15, axiom,![X1]:![X2]:![X3]:(leq(addition(multiplication(X1,X2),X3),X1)=>leq(multiplication(X3,star(X2)),X1)),file('/tmp/SRASS.s.p', star_induction_right)).
% fof(17, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(20, axiom,![X4]:![X5]:(complement(X5,X4)<=>((multiplication(X4,X5)=zero&multiplication(X5,X4)=zero)&addition(X4,X5)=one)),file('/tmp/SRASS.s.p', test_2)).
% fof(21, conjecture,![X4]:(test(X4)=>star(X4)=one),file('/tmp/SRASS.s.p', goals)).
% fof(22, negated_conjecture,~(![X4]:(test(X4)=>star(X4)=one)),inference(assume_negation,[status(cth)],[21])).
% fof(26, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(27,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(30, plain,![X2]:leq(addition(one,multiplication(X2,star(X2))),star(X2)),inference(variable_rename,[status(thm)],[4])).
% cnf(31,plain,(leq(addition(one,multiplication(X1,star(X1))),star(X1))),inference(split_conjunct,[status(thm)],[30])).
% fof(34, plain,![X4]:((~(test(X4))|?[X5]:complement(X5,X4))&(![X5]:~(complement(X5,X4))|test(X4))),inference(fof_nnf,[status(thm)],[6])).
% fof(35, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[34])).
% fof(36, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[35])).
% fof(37, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[36])).
% cnf(38,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(40, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(41, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[40])).
% cnf(42,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[41])).
% cnf(43,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[41])).
% fof(52, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[10])).
% cnf(53,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(54, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[11])).
% cnf(55,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[54])).
% fof(56, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(57,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[56])).
% fof(63, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X1,X2),X3),X1))|leq(multiplication(X3,star(X2)),X1)),inference(fof_nnf,[status(thm)],[15])).
% fof(64, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X4,X5),X6),X4))|leq(multiplication(X6,star(X5)),X4)),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3)),inference(split_conjunct,[status(thm)],[64])).
% fof(68, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[17])).
% cnf(69,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[68])).
% fof(74, plain,![X4]:![X5]:((~(complement(X5,X4))|((multiplication(X4,X5)=zero&multiplication(X5,X4)=zero)&addition(X4,X5)=one))&(((~(multiplication(X4,X5)=zero)|~(multiplication(X5,X4)=zero))|~(addition(X4,X5)=one))|complement(X5,X4))),inference(fof_nnf,[status(thm)],[20])).
% fof(75, plain,![X6]:![X7]:((~(complement(X7,X6))|((multiplication(X6,X7)=zero&multiplication(X7,X6)=zero)&addition(X6,X7)=one))&(((~(multiplication(X6,X7)=zero)|~(multiplication(X7,X6)=zero))|~(addition(X6,X7)=one))|complement(X7,X6))),inference(variable_rename,[status(thm)],[74])).
% fof(76, plain,![X6]:![X7]:((((multiplication(X6,X7)=zero|~(complement(X7,X6)))&(multiplication(X7,X6)=zero|~(complement(X7,X6))))&(addition(X6,X7)=one|~(complement(X7,X6))))&(((~(multiplication(X6,X7)=zero)|~(multiplication(X7,X6)=zero))|~(addition(X6,X7)=one))|complement(X7,X6))),inference(distribute,[status(thm)],[75])).
% cnf(78,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[76])).
% fof(81, negated_conjecture,?[X4]:(test(X4)&~(star(X4)=one)),inference(fof_nnf,[status(thm)],[22])).
% fof(82, negated_conjecture,?[X5]:(test(X5)&~(star(X5)=one)),inference(variable_rename,[status(thm)],[81])).
% fof(83, negated_conjecture,(test(esk2_0)&~(star(esk2_0)=one)),inference(skolemize,[status(esa)],[82])).
% cnf(84,negated_conjecture,(star(esk2_0)!=one),inference(split_conjunct,[status(thm)],[83])).
% cnf(85,negated_conjecture,(test(esk2_0)),inference(split_conjunct,[status(thm)],[83])).
% cnf(93,plain,(leq(X1,X1)),inference(spm,[status(thm)],[42,57,theory(equality)])).
% cnf(100,plain,(addition(X1,esk1_1(X1))=one|~test(X1)),inference(spm,[status(thm)],[78,38,theory(equality)])).
% cnf(141,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[55,57,theory(equality)])).
% cnf(189,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[69,27,theory(equality)])).
% cnf(212,plain,(addition(addition(one,multiplication(X1,star(X1))),star(X1))=star(X1)),inference(spm,[status(thm)],[43,31,theory(equality)])).
% cnf(216,plain,(addition(one,addition(multiplication(X1,star(X1)),star(X1)))=star(X1)),inference(rw,[status(thm)],[212,55,theory(equality)])).
% cnf(371,plain,(leq(multiplication(addition(multiplication(X1,X2),X3),star(X2)),X1)|~leq(addition(multiplication(X1,X2),X3),X1)),inference(spm,[status(thm)],[65,141,theory(equality)])).
% cnf(3469,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[189,53,theory(equality)])).
% cnf(5727,plain,(addition(one,multiplication(addition(X1,one),star(X1)))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[216,53,theory(equality)]),3469,theory(equality)])).
% cnf(5731,plain,(addition(one,star(X1))=star(X1)),inference(spm,[status(thm)],[141,5727,theory(equality)])).
% cnf(21281,plain,(leq(multiplication(one,star(X2)),X1)|~leq(one,X1)|~test(multiplication(X1,X2))),inference(spm,[status(thm)],[371,100,theory(equality)])).
% cnf(21324,plain,(leq(star(X2),X1)|~leq(one,X1)|~test(multiplication(X1,X2))),inference(rw,[status(thm)],[21281,27,theory(equality)])).
% cnf(21384,plain,(leq(star(X1),one)|~test(multiplication(one,X1))),inference(spm,[status(thm)],[21324,93,theory(equality)])).
% cnf(21421,plain,(leq(star(X1),one)|~test(X1)),inference(rw,[status(thm)],[21384,27,theory(equality)])).
% cnf(21656,plain,(addition(star(X1),one)=one|~test(X1)),inference(spm,[status(thm)],[43,21421,theory(equality)])).
% cnf(21662,plain,(star(X1)=one|~test(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[21656,53,theory(equality)]),5731,theory(equality)])).
% cnf(21672,negated_conjecture,(star(esk2_0)=one),inference(spm,[status(thm)],[21662,85,theory(equality)])).
% cnf(21676,negated_conjecture,($false),inference(sr,[status(thm)],[21672,84,theory(equality)])).
% cnf(21677,negated_conjecture,($false),21676,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1513
% # ...of these trivial : 346
% # ...subsumed : 691
% # ...remaining for further processing: 476
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 108
% # Generated clauses : 11762
% # ...of the previous two non-trivial : 7397
% # Contextual simplify-reflections : 7
% # Paramodulations : 11749
% # Factorizations : 0
% # Equation resolutions : 13
% # Current number of processed clauses: 363
% # Positive orientable unit clauses: 208
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 1
% # Non-unit-clauses : 151
% # Current number of unprocessed clauses: 4638
% # ...number of literals in the above : 7957
% # Clause-clause subsumption calls (NU) : 2911
% # Rec. Clause-clause subsumption calls : 2905
% # Unit Clause-clause subsumption calls : 29
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 327
% # Indexed BW rewrite successes : 115
% # Backwards rewriting index: 385 leaves, 1.35+/-1.003 terms/leaf
% # Paramod-from index: 197 leaves, 1.20+/-0.604 terms/leaf
% # Paramod-into index: 308 leaves, 1.34+/-0.992 terms/leaf
% # -------------------------------------------------
% # User time : 0.292 s
% # System time : 0.012 s
% # Total time : 0.304 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.61 CPU 0.70 WC
% FINAL PrfWatch: 0.61 CPU 0.70 WC
% SZS output end Solution for /tmp/SystemOnTPTP12075/KLE048+1.tptp
%
%------------------------------------------------------------------------------