TSTP Solution File: SEU371+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU371+1 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 04:10:53 EST 2010
% Result : Theorem 1.42s
% Output : Solution 1.42s
% 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/SystemOnTPTP7672/SEU371+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7672/SEU371+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7672/SEU371+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 7768
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(rel_str(X1)=>bottom_of_relstr(X1)=join_on_relstr(X1,empty_set)),file('/tmp/SRASS.s.p', d11_yellow_0)).
% fof(5, axiom,![X1]:boole_POSet(X1)=poset_of_lattice(boole_lattice(X1)),file('/tmp/SRASS.s.p', d2_yellow_1)).
% fof(12, axiom,![X1]:(lower_bounded_semilattstr(boole_lattice(X1))&bottom_of_semilattstr(boole_lattice(X1))=empty_set),file('/tmp/SRASS.s.p', t3_lattice3)).
% fof(33, axiom,![X1]:((((~(empty_carrier(X1))&lattice(X1))&complete_latt_str(X1))&latt_str(X1))=>((((~(empty_carrier(X1))&lattice(X1))&lower_bounded_semilattstr(X1))&latt_str(X1))&bottom_of_semilattstr(X1)=join_of_latt_set(X1,empty_set))),file('/tmp/SRASS.s.p', t50_lattice3)).
% fof(48, axiom,![X1]:(~(empty_carrier(boole_lattice(X1)))&strict_latt_str(boole_lattice(X1))),file('/tmp/SRASS.s.p', fc1_lattice3)).
% fof(49, axiom,![X1]:((((((((~(empty_carrier(boole_lattice(X1)))&strict_latt_str(boole_lattice(X1)))&join_commutative(boole_lattice(X1)))&join_associative(boole_lattice(X1)))&meet_commutative(boole_lattice(X1)))&meet_associative(boole_lattice(X1)))&meet_absorbing(boole_lattice(X1)))&join_absorbing(boole_lattice(X1)))&lattice(boole_lattice(X1))),file('/tmp/SRASS.s.p', fc2_lattice3)).
% fof(52, axiom,![X1]:(strict_latt_str(boole_lattice(X1))&latt_str(boole_lattice(X1))),file('/tmp/SRASS.s.p', dt_k1_lattice3)).
% fof(53, axiom,![X1]:(((~(empty_carrier(X1))&lattice(X1))&latt_str(X1))=>((((strict_rel_str(poset_of_lattice(X1))&reflexive_relstr(poset_of_lattice(X1)))&transitive_relstr(poset_of_lattice(X1)))&antisymmetric_relstr(poset_of_lattice(X1)))&rel_str(poset_of_lattice(X1)))),file('/tmp/SRASS.s.p', dt_k3_lattice3)).
% fof(56, axiom,![X1]:((((~(empty_carrier(X1))&lattice(X1))&complete_latt_str(X1))&latt_str(X1))=>![X2]:(join_of_latt_set(X1,X2)=join_on_relstr(poset_of_lattice(X1),X2)&meet_of_latt_set(X1,X2)=meet_on_relstr(poset_of_lattice(X1),X2))),file('/tmp/SRASS.s.p', t29_yellow_0)).
% fof(71, axiom,![X1]:((((((((((((((((~(empty_carrier(boole_lattice(X1)))&strict_latt_str(boole_lattice(X1)))&join_commutative(boole_lattice(X1)))&join_associative(boole_lattice(X1)))&meet_commutative(boole_lattice(X1)))&meet_associative(boole_lattice(X1)))&meet_absorbing(boole_lattice(X1)))&join_absorbing(boole_lattice(X1)))&lattice(boole_lattice(X1)))&distributive_lattstr(boole_lattice(X1)))&modular_lattstr(boole_lattice(X1)))&lower_bounded_semilattstr(boole_lattice(X1)))&upper_bounded_semilattstr(boole_lattice(X1)))&bounded_lattstr(boole_lattice(X1)))&complemented_lattstr(boole_lattice(X1)))&boolean_lattstr(boole_lattice(X1)))&complete_latt_str(boole_lattice(X1))),file('/tmp/SRASS.s.p', fc1_knaster)).
% fof(115, conjecture,![X1]:bottom_of_relstr(boole_POSet(X1))=empty_set,file('/tmp/SRASS.s.p', t18_yellow_1)).
% fof(116, negated_conjecture,~(![X1]:bottom_of_relstr(boole_POSet(X1))=empty_set),inference(assume_negation,[status(cth)],[115])).
% fof(123, plain,![X1]:((((~(empty_carrier(X1))&lattice(X1))&complete_latt_str(X1))&latt_str(X1))=>((((~(empty_carrier(X1))&lattice(X1))&lower_bounded_semilattstr(X1))&latt_str(X1))&bottom_of_semilattstr(X1)=join_of_latt_set(X1,empty_set))),inference(fof_simplification,[status(thm)],[33,theory(equality)])).
% fof(133, plain,![X1]:(~(empty_carrier(boole_lattice(X1)))&strict_latt_str(boole_lattice(X1))),inference(fof_simplification,[status(thm)],[48,theory(equality)])).
% fof(134, plain,![X1]:((((((((~(empty_carrier(boole_lattice(X1)))&strict_latt_str(boole_lattice(X1)))&join_commutative(boole_lattice(X1)))&join_associative(boole_lattice(X1)))&meet_commutative(boole_lattice(X1)))&meet_associative(boole_lattice(X1)))&meet_absorbing(boole_lattice(X1)))&join_absorbing(boole_lattice(X1)))&lattice(boole_lattice(X1))),inference(fof_simplification,[status(thm)],[49,theory(equality)])).
% fof(136, plain,![X1]:(((~(empty_carrier(X1))&lattice(X1))&latt_str(X1))=>((((strict_rel_str(poset_of_lattice(X1))&reflexive_relstr(poset_of_lattice(X1)))&transitive_relstr(poset_of_lattice(X1)))&antisymmetric_relstr(poset_of_lattice(X1)))&rel_str(poset_of_lattice(X1)))),inference(fof_simplification,[status(thm)],[53,theory(equality)])).
% fof(138, plain,![X1]:((((~(empty_carrier(X1))&lattice(X1))&complete_latt_str(X1))&latt_str(X1))=>![X2]:(join_of_latt_set(X1,X2)=join_on_relstr(poset_of_lattice(X1),X2)&meet_of_latt_set(X1,X2)=meet_on_relstr(poset_of_lattice(X1),X2))),inference(fof_simplification,[status(thm)],[56,theory(equality)])).
% fof(149, plain,![X1]:((((((((((((((((~(empty_carrier(boole_lattice(X1)))&strict_latt_str(boole_lattice(X1)))&join_commutative(boole_lattice(X1)))&join_associative(boole_lattice(X1)))&meet_commutative(boole_lattice(X1)))&meet_associative(boole_lattice(X1)))&meet_absorbing(boole_lattice(X1)))&join_absorbing(boole_lattice(X1)))&lattice(boole_lattice(X1)))&distributive_lattstr(boole_lattice(X1)))&modular_lattstr(boole_lattice(X1)))&lower_bounded_semilattstr(boole_lattice(X1)))&upper_bounded_semilattstr(boole_lattice(X1)))&bounded_lattstr(boole_lattice(X1)))&complemented_lattstr(boole_lattice(X1)))&boolean_lattstr(boole_lattice(X1)))&complete_latt_str(boole_lattice(X1))),inference(fof_simplification,[status(thm)],[71,theory(equality)])).
% fof(175, plain,![X1]:(~(rel_str(X1))|bottom_of_relstr(X1)=join_on_relstr(X1,empty_set)),inference(fof_nnf,[status(thm)],[2])).
% fof(176, plain,![X2]:(~(rel_str(X2))|bottom_of_relstr(X2)=join_on_relstr(X2,empty_set)),inference(variable_rename,[status(thm)],[175])).
% cnf(177,plain,(bottom_of_relstr(X1)=join_on_relstr(X1,empty_set)|~rel_str(X1)),inference(split_conjunct,[status(thm)],[176])).
% fof(182, plain,![X2]:boole_POSet(X2)=poset_of_lattice(boole_lattice(X2)),inference(variable_rename,[status(thm)],[5])).
% cnf(183,plain,(boole_POSet(X1)=poset_of_lattice(boole_lattice(X1))),inference(split_conjunct,[status(thm)],[182])).
% fof(205, plain,![X2]:(lower_bounded_semilattstr(boole_lattice(X2))&bottom_of_semilattstr(boole_lattice(X2))=empty_set),inference(variable_rename,[status(thm)],[12])).
% cnf(206,plain,(bottom_of_semilattstr(boole_lattice(X1))=empty_set),inference(split_conjunct,[status(thm)],[205])).
% fof(285, plain,![X1]:((((empty_carrier(X1)|~(lattice(X1)))|~(complete_latt_str(X1)))|~(latt_str(X1)))|((((~(empty_carrier(X1))&lattice(X1))&lower_bounded_semilattstr(X1))&latt_str(X1))&bottom_of_semilattstr(X1)=join_of_latt_set(X1,empty_set))),inference(fof_nnf,[status(thm)],[123])).
% fof(286, plain,![X2]:((((empty_carrier(X2)|~(lattice(X2)))|~(complete_latt_str(X2)))|~(latt_str(X2)))|((((~(empty_carrier(X2))&lattice(X2))&lower_bounded_semilattstr(X2))&latt_str(X2))&bottom_of_semilattstr(X2)=join_of_latt_set(X2,empty_set))),inference(variable_rename,[status(thm)],[285])).
% fof(287, plain,![X2]:(((((~(empty_carrier(X2))|(((empty_carrier(X2)|~(lattice(X2)))|~(complete_latt_str(X2)))|~(latt_str(X2))))&(lattice(X2)|(((empty_carrier(X2)|~(lattice(X2)))|~(complete_latt_str(X2)))|~(latt_str(X2)))))&(lower_bounded_semilattstr(X2)|(((empty_carrier(X2)|~(lattice(X2)))|~(complete_latt_str(X2)))|~(latt_str(X2)))))&(latt_str(X2)|(((empty_carrier(X2)|~(lattice(X2)))|~(complete_latt_str(X2)))|~(latt_str(X2)))))&(bottom_of_semilattstr(X2)=join_of_latt_set(X2,empty_set)|(((empty_carrier(X2)|~(lattice(X2)))|~(complete_latt_str(X2)))|~(latt_str(X2))))),inference(distribute,[status(thm)],[286])).
% cnf(288,plain,(empty_carrier(X1)|bottom_of_semilattstr(X1)=join_of_latt_set(X1,empty_set)|~latt_str(X1)|~complete_latt_str(X1)|~lattice(X1)),inference(split_conjunct,[status(thm)],[287])).
% fof(381, plain,![X2]:(~(empty_carrier(boole_lattice(X2)))&strict_latt_str(boole_lattice(X2))),inference(variable_rename,[status(thm)],[133])).
% cnf(383,plain,(~empty_carrier(boole_lattice(X1))),inference(split_conjunct,[status(thm)],[381])).
% fof(384, plain,![X2]:((((((((~(empty_carrier(boole_lattice(X2)))&strict_latt_str(boole_lattice(X2)))&join_commutative(boole_lattice(X2)))&join_associative(boole_lattice(X2)))&meet_commutative(boole_lattice(X2)))&meet_associative(boole_lattice(X2)))&meet_absorbing(boole_lattice(X2)))&join_absorbing(boole_lattice(X2)))&lattice(boole_lattice(X2))),inference(variable_rename,[status(thm)],[134])).
% cnf(385,plain,(lattice(boole_lattice(X1))),inference(split_conjunct,[status(thm)],[384])).
% fof(399, plain,![X2]:(strict_latt_str(boole_lattice(X2))&latt_str(boole_lattice(X2))),inference(variable_rename,[status(thm)],[52])).
% cnf(400,plain,(latt_str(boole_lattice(X1))),inference(split_conjunct,[status(thm)],[399])).
% fof(402, plain,![X1]:(((empty_carrier(X1)|~(lattice(X1)))|~(latt_str(X1)))|((((strict_rel_str(poset_of_lattice(X1))&reflexive_relstr(poset_of_lattice(X1)))&transitive_relstr(poset_of_lattice(X1)))&antisymmetric_relstr(poset_of_lattice(X1)))&rel_str(poset_of_lattice(X1)))),inference(fof_nnf,[status(thm)],[136])).
% fof(403, plain,![X2]:(((empty_carrier(X2)|~(lattice(X2)))|~(latt_str(X2)))|((((strict_rel_str(poset_of_lattice(X2))&reflexive_relstr(poset_of_lattice(X2)))&transitive_relstr(poset_of_lattice(X2)))&antisymmetric_relstr(poset_of_lattice(X2)))&rel_str(poset_of_lattice(X2)))),inference(variable_rename,[status(thm)],[402])).
% fof(404, plain,![X2]:(((((strict_rel_str(poset_of_lattice(X2))|((empty_carrier(X2)|~(lattice(X2)))|~(latt_str(X2))))&(reflexive_relstr(poset_of_lattice(X2))|((empty_carrier(X2)|~(lattice(X2)))|~(latt_str(X2)))))&(transitive_relstr(poset_of_lattice(X2))|((empty_carrier(X2)|~(lattice(X2)))|~(latt_str(X2)))))&(antisymmetric_relstr(poset_of_lattice(X2))|((empty_carrier(X2)|~(lattice(X2)))|~(latt_str(X2)))))&(rel_str(poset_of_lattice(X2))|((empty_carrier(X2)|~(lattice(X2)))|~(latt_str(X2))))),inference(distribute,[status(thm)],[403])).
% cnf(405,plain,(empty_carrier(X1)|rel_str(poset_of_lattice(X1))|~latt_str(X1)|~lattice(X1)),inference(split_conjunct,[status(thm)],[404])).
% fof(430, plain,![X1]:((((empty_carrier(X1)|~(lattice(X1)))|~(complete_latt_str(X1)))|~(latt_str(X1)))|![X2]:(join_of_latt_set(X1,X2)=join_on_relstr(poset_of_lattice(X1),X2)&meet_of_latt_set(X1,X2)=meet_on_relstr(poset_of_lattice(X1),X2))),inference(fof_nnf,[status(thm)],[138])).
% fof(431, plain,![X3]:((((empty_carrier(X3)|~(lattice(X3)))|~(complete_latt_str(X3)))|~(latt_str(X3)))|![X4]:(join_of_latt_set(X3,X4)=join_on_relstr(poset_of_lattice(X3),X4)&meet_of_latt_set(X3,X4)=meet_on_relstr(poset_of_lattice(X3),X4))),inference(variable_rename,[status(thm)],[430])).
% fof(432, plain,![X3]:![X4]:((join_of_latt_set(X3,X4)=join_on_relstr(poset_of_lattice(X3),X4)&meet_of_latt_set(X3,X4)=meet_on_relstr(poset_of_lattice(X3),X4))|(((empty_carrier(X3)|~(lattice(X3)))|~(complete_latt_str(X3)))|~(latt_str(X3)))),inference(shift_quantors,[status(thm)],[431])).
% fof(433, plain,![X3]:![X4]:((join_of_latt_set(X3,X4)=join_on_relstr(poset_of_lattice(X3),X4)|(((empty_carrier(X3)|~(lattice(X3)))|~(complete_latt_str(X3)))|~(latt_str(X3))))&(meet_of_latt_set(X3,X4)=meet_on_relstr(poset_of_lattice(X3),X4)|(((empty_carrier(X3)|~(lattice(X3)))|~(complete_latt_str(X3)))|~(latt_str(X3))))),inference(distribute,[status(thm)],[432])).
% cnf(435,plain,(empty_carrier(X1)|join_of_latt_set(X1,X2)=join_on_relstr(poset_of_lattice(X1),X2)|~latt_str(X1)|~complete_latt_str(X1)|~lattice(X1)),inference(split_conjunct,[status(thm)],[433])).
% fof(517, plain,![X2]:((((((((((((((((~(empty_carrier(boole_lattice(X2)))&strict_latt_str(boole_lattice(X2)))&join_commutative(boole_lattice(X2)))&join_associative(boole_lattice(X2)))&meet_commutative(boole_lattice(X2)))&meet_associative(boole_lattice(X2)))&meet_absorbing(boole_lattice(X2)))&join_absorbing(boole_lattice(X2)))&lattice(boole_lattice(X2)))&distributive_lattstr(boole_lattice(X2)))&modular_lattstr(boole_lattice(X2)))&lower_bounded_semilattstr(boole_lattice(X2)))&upper_bounded_semilattstr(boole_lattice(X2)))&bounded_lattstr(boole_lattice(X2)))&complemented_lattstr(boole_lattice(X2)))&boolean_lattstr(boole_lattice(X2)))&complete_latt_str(boole_lattice(X2))),inference(variable_rename,[status(thm)],[149])).
% cnf(518,plain,(complete_latt_str(boole_lattice(X1))),inference(split_conjunct,[status(thm)],[517])).
% fof(798, negated_conjecture,?[X1]:~(bottom_of_relstr(boole_POSet(X1))=empty_set),inference(fof_nnf,[status(thm)],[116])).
% fof(799, negated_conjecture,?[X2]:~(bottom_of_relstr(boole_POSet(X2))=empty_set),inference(variable_rename,[status(thm)],[798])).
% fof(800, negated_conjecture,~(bottom_of_relstr(boole_POSet(esk30_0))=empty_set),inference(skolemize,[status(esa)],[799])).
% cnf(801,negated_conjecture,(bottom_of_relstr(boole_POSet(esk30_0))!=empty_set),inference(split_conjunct,[status(thm)],[800])).
% cnf(820,negated_conjecture,(bottom_of_relstr(poset_of_lattice(boole_lattice(esk30_0)))!=empty_set),inference(rw,[status(thm)],[801,183,theory(equality)]),['unfolding']).
% cnf(1086,plain,(join_of_latt_set(boole_lattice(X1),empty_set)=empty_set|empty_carrier(boole_lattice(X1))|~complete_latt_str(boole_lattice(X1))|~lattice(boole_lattice(X1))|~latt_str(boole_lattice(X1))),inference(spm,[status(thm)],[206,288,theory(equality)])).
% cnf(1088,plain,(join_of_latt_set(boole_lattice(X1),empty_set)=empty_set|empty_carrier(boole_lattice(X1))|$false|~lattice(boole_lattice(X1))|~latt_str(boole_lattice(X1))),inference(rw,[status(thm)],[1086,518,theory(equality)])).
% cnf(1089,plain,(join_of_latt_set(boole_lattice(X1),empty_set)=empty_set|empty_carrier(boole_lattice(X1))|$false|$false|~latt_str(boole_lattice(X1))),inference(rw,[status(thm)],[1088,385,theory(equality)])).
% cnf(1090,plain,(join_of_latt_set(boole_lattice(X1),empty_set)=empty_set|empty_carrier(boole_lattice(X1))|$false|$false|$false),inference(rw,[status(thm)],[1089,400,theory(equality)])).
% cnf(1091,plain,(join_of_latt_set(boole_lattice(X1),empty_set)=empty_set|empty_carrier(boole_lattice(X1))),inference(cn,[status(thm)],[1090,theory(equality)])).
% cnf(1092,plain,(join_of_latt_set(boole_lattice(X1),empty_set)=empty_set),inference(sr,[status(thm)],[1091,383,theory(equality)])).
% cnf(1100,plain,(join_of_latt_set(X1,empty_set)=bottom_of_relstr(poset_of_lattice(X1))|empty_carrier(X1)|~rel_str(poset_of_lattice(X1))|~complete_latt_str(X1)|~lattice(X1)|~latt_str(X1)),inference(spm,[status(thm)],[177,435,theory(equality)])).
% cnf(1342,plain,(bottom_of_relstr(poset_of_lattice(X1))=join_of_latt_set(X1,empty_set)|empty_carrier(X1)|~complete_latt_str(X1)|~lattice(X1)|~latt_str(X1)),inference(csr,[status(thm)],[1100,405])).
% cnf(1345,negated_conjecture,(empty_carrier(boole_lattice(esk30_0))|join_of_latt_set(boole_lattice(esk30_0),empty_set)!=empty_set|~complete_latt_str(boole_lattice(esk30_0))|~lattice(boole_lattice(esk30_0))|~latt_str(boole_lattice(esk30_0))),inference(spm,[status(thm)],[820,1342,theory(equality)])).
% cnf(1346,negated_conjecture,(empty_carrier(boole_lattice(esk30_0))|$false|~complete_latt_str(boole_lattice(esk30_0))|~lattice(boole_lattice(esk30_0))|~latt_str(boole_lattice(esk30_0))),inference(rw,[status(thm)],[1345,1092,theory(equality)])).
% cnf(1347,negated_conjecture,(empty_carrier(boole_lattice(esk30_0))|$false|$false|~lattice(boole_lattice(esk30_0))|~latt_str(boole_lattice(esk30_0))),inference(rw,[status(thm)],[1346,518,theory(equality)])).
% cnf(1348,negated_conjecture,(empty_carrier(boole_lattice(esk30_0))|$false|$false|$false|~latt_str(boole_lattice(esk30_0))),inference(rw,[status(thm)],[1347,385,theory(equality)])).
% cnf(1349,negated_conjecture,(empty_carrier(boole_lattice(esk30_0))|$false|$false|$false|$false),inference(rw,[status(thm)],[1348,400,theory(equality)])).
% cnf(1350,negated_conjecture,(empty_carrier(boole_lattice(esk30_0))),inference(cn,[status(thm)],[1349,theory(equality)])).
% cnf(1351,negated_conjecture,($false),inference(sr,[status(thm)],[1350,383,theory(equality)])).
% cnf(1352,negated_conjecture,($false),1351,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 449
% # ...of these trivial : 33
% # ...subsumed : 75
% # ...remaining for further processing: 341
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 5
% # Generated clauses : 250
% # ...of the previous two non-trivial : 190
% # Contextual simplify-reflections : 42
% # Paramodulations : 239
% # Factorizations : 2
% # Equation resolutions : 6
% # Current number of processed clauses: 333
% # Positive orientable unit clauses: 164
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 19
% # Non-unit-clauses : 150
% # Current number of unprocessed clauses: 95
% # ...number of literals in the above : 443
% # Clause-clause subsumption calls (NU) : 2795
% # Rec. Clause-clause subsumption calls : 780
% # Unit Clause-clause subsumption calls : 417
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 375 leaves, 1.14+/-0.666 terms/leaf
% # Paramod-from index: 240 leaves, 1.00+/-0.064 terms/leaf
% # Paramod-into index: 343 leaves, 1.07+/-0.371 terms/leaf
% # -------------------------------------------------
% # User time : 0.060 s
% # System time : 0.007 s
% # Total time : 0.067 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.25 WC
% FINAL PrfWatch: 0.18 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP7672/SEU371+1.tptp
%
%------------------------------------------------------------------------------