%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE129+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 08:07:01 EST 2010
% Result : Theorem 85.12s
% Output : Solution 85.56s
% 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/SystemOnTPTP26627/KLE129+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~goals:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... additive_commutativity:
% CSA axiom additive_commutativity found
% Looking for CSA axiom ... additive_associativity:
% CSA axiom additive_associativity found
% Looking for CSA axiom ... additive_identity:
% CSA axiom additive_identity found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... additive_idempotence:
% CSA axiom additive_idempotence found
% Looking for CSA axiom ... divergence1:
% CSA axiom divergence1 found
% Looking for CSA axiom ... forward_diamond:
% CSA axiom forward_diamond found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :forward_diamond:divergence1:additive_idempotence:additive_identity:additive_associativity:additive_commutativity (6)
% Unselected axioms are ... :divergence2:right_annihilation:left_annihilation:right_distributivity:left_distributivity:domain4:multiplicative_associativity:order:complement:forward_box:domain1:codomain1:domain2:codomain2:domain_difference:codomain3:domain3:multiplicative_right_identity:multiplicative_left_identity:codomain4:backward_box:backward_diamond (22)
% SZS status THM for /tmp/SystemOnTPTP26627/KLE129+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP26627/KLE129+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 27961
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:forward_diamond(X1,X2)=domain(multiplication(X1,domain(X2))),file('/tmp/SRASS.s.p', forward_diamond)).
% fof(2, axiom,![X1]:forward_diamond(X1,divergence(X1))=divergence(X1),file('/tmp/SRASS.s.p', divergence1)).
% fof(3, axiom,![X3]:addition(X3,X3)=X3,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(7, conjecture,![X1]:(divergence(X1)=zero<=![X2]:(addition(domain(X2),forward_diamond(X1,domain(X2)))=forward_diamond(X1,domain(X2))=>domain(X2)=zero)),file('/tmp/SRASS.s.p', goals)).
% fof(8, negated_conjecture,~(![X1]:(divergence(X1)=zero<=![X2]:(addition(domain(X2),forward_diamond(X1,domain(X2)))=forward_diamond(X1,domain(X2))=>domain(X2)=zero))),inference(assume_negation,[status(cth)],[7])).
% fof(9, negated_conjecture,~(![X1]:(![X2]:(addition(domain(X2),forward_diamond(X1,domain(X2)))=forward_diamond(X1,domain(X2))=>domain(X2)=zero)=>divergence(X1)=zero)),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(10, plain,![X3]:![X4]:forward_diamond(X3,X4)=domain(multiplication(X3,domain(X4))),inference(variable_rename,[status(thm)],[1])).
% cnf(11,plain,(forward_diamond(X1,X2)=domain(multiplication(X1,domain(X2)))),inference(split_conjunct,[status(thm)],[10])).
% fof(12, plain,![X2]:forward_diamond(X2,divergence(X2))=divergence(X2),inference(variable_rename,[status(thm)],[2])).
% cnf(13,plain,(forward_diamond(X1,divergence(X1))=divergence(X1)),inference(split_conjunct,[status(thm)],[12])).
% fof(14, plain,![X4]:addition(X4,X4)=X4,inference(variable_rename,[status(thm)],[3])).
% cnf(15,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[14])).
% fof(22, negated_conjecture,?[X1]:(![X2]:(~(addition(domain(X2),forward_diamond(X1,domain(X2)))=forward_diamond(X1,domain(X2)))|domain(X2)=zero)&~(divergence(X1)=zero)),inference(fof_nnf,[status(thm)],[9])).
% fof(23, negated_conjecture,?[X3]:(![X4]:(~(addition(domain(X4),forward_diamond(X3,domain(X4)))=forward_diamond(X3,domain(X4)))|domain(X4)=zero)&~(divergence(X3)=zero)),inference(variable_rename,[status(thm)],[22])).
% fof(24, negated_conjecture,(![X4]:(~(addition(domain(X4),forward_diamond(esk1_0,domain(X4)))=forward_diamond(esk1_0,domain(X4)))|domain(X4)=zero)&~(divergence(esk1_0)=zero)),inference(skolemize,[status(esa)],[23])).
% fof(25, negated_conjecture,![X4]:((~(addition(domain(X4),forward_diamond(esk1_0,domain(X4)))=forward_diamond(esk1_0,domain(X4)))|domain(X4)=zero)&~(divergence(esk1_0)=zero)),inference(shift_quantors,[status(thm)],[24])).
% cnf(26,negated_conjecture,(divergence(esk1_0)!=zero),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,negated_conjecture,(domain(X1)=zero|addition(domain(X1),forward_diamond(esk1_0,domain(X1)))!=forward_diamond(esk1_0,domain(X1))),inference(split_conjunct,[status(thm)],[25])).
% cnf(28,plain,(domain(multiplication(X1,domain(divergence(X1))))=divergence(X1)),inference(rw,[status(thm)],[13,11,theory(equality)]),['unfolding']).
% cnf(29,negated_conjecture,(domain(X1)=zero|addition(domain(X1),domain(multiplication(esk1_0,domain(domain(X1)))))!=domain(multiplication(esk1_0,domain(domain(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[27,11,theory(equality)]),11,theory(equality)]),['unfolding']).
% cnf(50,negated_conjecture,(divergence(X1)=zero|addition(divergence(X1),domain(multiplication(esk1_0,domain(divergence(X1)))))!=domain(multiplication(esk1_0,domain(divergence(X1))))),inference(spm,[status(thm)],[29,28,theory(equality)])).
% cnf(60,negated_conjecture,(divergence(esk1_0)=zero|addition(divergence(esk1_0),divergence(esk1_0))!=divergence(esk1_0)),inference(spm,[status(thm)],[50,28,theory(equality)])).
% cnf(61,negated_conjecture,(divergence(esk1_0)=zero|$false),inference(rw,[status(thm)],[60,15,theory(equality)])).
% cnf(62,negated_conjecture,(divergence(esk1_0)=zero),inference(cn,[status(thm)],[61,theory(equality)])).
% cnf(63,negated_conjecture,($false),inference(sr,[status(thm)],[62,26,theory(equality)])).
% cnf(64,negated_conjecture,($false),63,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 11
% # ...of these trivial : 2
% # ...subsumed : 0
% # ...remaining for further processing: 9
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 19
% # ...of the previous two non-trivial : 11
% # Contextual simplify-reflections : 0
% # Paramodulations : 19
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 9
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 7
% # ...number of literals in the above : 8
% # 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 : 5
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 19 leaves, 1.21+/-0.694 terms/leaf
% # Paramod-from index: 5 leaves, 1.40+/-0.800 terms/leaf
% # Paramod-into index: 18 leaves, 1.17+/-0.500 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.003 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP26627/KLE129+1.tptp
%
%------------------------------------------------------------------------------