TSTP Solution File: SEU394+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU394+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 : art04.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:40:40 EST 2010
% Result : Theorem 1.52s
% Output : Solution 1.52s
% 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/SystemOnTPTP28659/SEU394+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28659/SEU394+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28659/SEU394+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 28755
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.034 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(cast_as_carrier_subset(X1)))),file('/tmp/SRASS.s.p', fc2_pre_topc)).
% fof(13, axiom,![X1]:(~(empty(X1))=>![X2]:(((((~(empty(X2))&filtered_subset(X2,boole_POSet(X1)))&upper_relstr_subset(X2,boole_POSet(X1)))&proper_element(X2,powerset(the_carrier(boole_POSet(X1)))))&element(X2,powerset(the_carrier(boole_POSet(X1)))))=>![X3]:~((in(X3,X2)&empty(X3))))),file('/tmp/SRASS.s.p', t2_yellow19)).
% fof(17, axiom,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:((((~(empty(X2))&filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1))))&upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1))))&element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))))=>set_difference(X2,singleton(empty_set))=filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)))),file('/tmp/SRASS.s.p', t14_yellow19)).
% fof(56, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(71, axiom,![X1]:![X2]:(set_difference(X1,singleton(X2))=X1<=>~(in(X2,X1))),file('/tmp/SRASS.s.p', t65_zfmisc_1)).
% fof(88, axiom,(empty(empty_set)&relation(empty_set)),file('/tmp/SRASS.s.p', fc4_relat_1)).
% fof(127, conjecture,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(((((~(empty(X2))&filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1))))&upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1))))&proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))))&element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))))=>X2=filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)))),file('/tmp/SRASS.s.p', t15_yellow19)).
% fof(128, negated_conjecture,~(![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(((((~(empty(X2))&filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1))))&upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1))))&proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))))&element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))))=>X2=filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2))))),inference(assume_negation,[status(cth)],[127])).
% fof(131, plain,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(cast_as_carrier_subset(X1)))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(136, plain,![X1]:(~(empty(X1))=>![X2]:(((((~(empty(X2))&filtered_subset(X2,boole_POSet(X1)))&upper_relstr_subset(X2,boole_POSet(X1)))&proper_element(X2,powerset(the_carrier(boole_POSet(X1)))))&element(X2,powerset(the_carrier(boole_POSet(X1)))))=>![X3]:~((in(X3,X2)&empty(X3))))),inference(fof_simplification,[status(thm)],[13,theory(equality)])).
% fof(140, plain,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:((((~(empty(X2))&filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1))))&upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1))))&element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))))=>set_difference(X2,singleton(empty_set))=filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)))),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(168, plain,![X1]:![X2]:(set_difference(X1,singleton(X2))=X1<=>~(in(X2,X1))),inference(fof_simplification,[status(thm)],[71,theory(equality)])).
% fof(197, negated_conjecture,~(![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(((((~(empty(X2))&filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1))))&upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1))))&proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))))&element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))))=>X2=filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2))))),inference(fof_simplification,[status(thm)],[128,theory(equality)])).
% fof(212, plain,![X1]:((empty_carrier(X1)|~(one_sorted_str(X1)))|~(empty(cast_as_carrier_subset(X1)))),inference(fof_nnf,[status(thm)],[131])).
% fof(213, plain,![X2]:((empty_carrier(X2)|~(one_sorted_str(X2)))|~(empty(cast_as_carrier_subset(X2)))),inference(variable_rename,[status(thm)],[212])).
% cnf(214,plain,(empty_carrier(X1)|~empty(cast_as_carrier_subset(X1))|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[213])).
% fof(241, plain,![X1]:(empty(X1)|![X2]:(((((empty(X2)|~(filtered_subset(X2,boole_POSet(X1))))|~(upper_relstr_subset(X2,boole_POSet(X1))))|~(proper_element(X2,powerset(the_carrier(boole_POSet(X1))))))|~(element(X2,powerset(the_carrier(boole_POSet(X1))))))|![X3]:(~(in(X3,X2))|~(empty(X3))))),inference(fof_nnf,[status(thm)],[136])).
% fof(242, plain,![X4]:(empty(X4)|![X5]:(((((empty(X5)|~(filtered_subset(X5,boole_POSet(X4))))|~(upper_relstr_subset(X5,boole_POSet(X4))))|~(proper_element(X5,powerset(the_carrier(boole_POSet(X4))))))|~(element(X5,powerset(the_carrier(boole_POSet(X4))))))|![X6]:(~(in(X6,X5))|~(empty(X6))))),inference(variable_rename,[status(thm)],[241])).
% fof(243, plain,![X4]:![X5]:![X6]:(((~(in(X6,X5))|~(empty(X6)))|((((empty(X5)|~(filtered_subset(X5,boole_POSet(X4))))|~(upper_relstr_subset(X5,boole_POSet(X4))))|~(proper_element(X5,powerset(the_carrier(boole_POSet(X4))))))|~(element(X5,powerset(the_carrier(boole_POSet(X4)))))))|empty(X4)),inference(shift_quantors,[status(thm)],[242])).
% cnf(244,plain,(empty(X1)|empty(X2)|~element(X2,powerset(the_carrier(boole_POSet(X1))))|~proper_element(X2,powerset(the_carrier(boole_POSet(X1))))|~upper_relstr_subset(X2,boole_POSet(X1))|~filtered_subset(X2,boole_POSet(X1))|~empty(X3)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[243])).
% fof(263, plain,![X1]:((empty_carrier(X1)|~(one_sorted_str(X1)))|![X2]:((((empty(X2)|~(filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))))|~(upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))))|~(element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))))|set_difference(X2,singleton(empty_set))=filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)))),inference(fof_nnf,[status(thm)],[140])).
% fof(264, plain,![X3]:((empty_carrier(X3)|~(one_sorted_str(X3)))|![X4]:((((empty(X4)|~(filtered_subset(X4,boole_POSet(cast_as_carrier_subset(X3)))))|~(upper_relstr_subset(X4,boole_POSet(cast_as_carrier_subset(X3)))))|~(element(X4,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X3)))))))|set_difference(X4,singleton(empty_set))=filter_of_net_str(X3,net_of_bool_filter(X3,cast_as_carrier_subset(X3),X4)))),inference(variable_rename,[status(thm)],[263])).
% fof(265, plain,![X3]:![X4]:(((((empty(X4)|~(filtered_subset(X4,boole_POSet(cast_as_carrier_subset(X3)))))|~(upper_relstr_subset(X4,boole_POSet(cast_as_carrier_subset(X3)))))|~(element(X4,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X3)))))))|set_difference(X4,singleton(empty_set))=filter_of_net_str(X3,net_of_bool_filter(X3,cast_as_carrier_subset(X3),X4)))|(empty_carrier(X3)|~(one_sorted_str(X3)))),inference(shift_quantors,[status(thm)],[264])).
% cnf(266,plain,(empty_carrier(X1)|set_difference(X2,singleton(empty_set))=filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2))|empty(X2)|~one_sorted_str(X1)|~element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))|~upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))|~filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))),inference(split_conjunct,[status(thm)],[265])).
% fof(451, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[56])).
% fof(452, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[451])).
% cnf(453,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[452])).
% fof(530, plain,![X1]:![X2]:((~(set_difference(X1,singleton(X2))=X1)|~(in(X2,X1)))&(in(X2,X1)|set_difference(X1,singleton(X2))=X1)),inference(fof_nnf,[status(thm)],[168])).
% fof(531, plain,![X3]:![X4]:((~(set_difference(X3,singleton(X4))=X3)|~(in(X4,X3)))&(in(X4,X3)|set_difference(X3,singleton(X4))=X3)),inference(variable_rename,[status(thm)],[530])).
% cnf(532,plain,(set_difference(X1,singleton(X2))=X1|in(X2,X1)),inference(split_conjunct,[status(thm)],[531])).
% cnf(626,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[88])).
% fof(878, negated_conjecture,?[X1]:((~(empty_carrier(X1))&one_sorted_str(X1))&?[X2]:(((((~(empty(X2))&filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1))))&upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1))))&proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))))&element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))))&~(X2=filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2))))),inference(fof_nnf,[status(thm)],[197])).
% fof(879, negated_conjecture,?[X3]:((~(empty_carrier(X3))&one_sorted_str(X3))&?[X4]:(((((~(empty(X4))&filtered_subset(X4,boole_POSet(cast_as_carrier_subset(X3))))&upper_relstr_subset(X4,boole_POSet(cast_as_carrier_subset(X3))))&proper_element(X4,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X3))))))&element(X4,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X3))))))&~(X4=filter_of_net_str(X3,net_of_bool_filter(X3,cast_as_carrier_subset(X3),X4))))),inference(variable_rename,[status(thm)],[878])).
% fof(880, negated_conjecture,((~(empty_carrier(esk39_0))&one_sorted_str(esk39_0))&(((((~(empty(esk40_0))&filtered_subset(esk40_0,boole_POSet(cast_as_carrier_subset(esk39_0))))&upper_relstr_subset(esk40_0,boole_POSet(cast_as_carrier_subset(esk39_0))))&proper_element(esk40_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk39_0))))))&element(esk40_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk39_0))))))&~(esk40_0=filter_of_net_str(esk39_0,net_of_bool_filter(esk39_0,cast_as_carrier_subset(esk39_0),esk40_0))))),inference(skolemize,[status(esa)],[879])).
% cnf(881,negated_conjecture,(esk40_0!=filter_of_net_str(esk39_0,net_of_bool_filter(esk39_0,cast_as_carrier_subset(esk39_0),esk40_0))),inference(split_conjunct,[status(thm)],[880])).
% cnf(882,negated_conjecture,(element(esk40_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk39_0)))))),inference(split_conjunct,[status(thm)],[880])).
% cnf(883,negated_conjecture,(proper_element(esk40_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk39_0)))))),inference(split_conjunct,[status(thm)],[880])).
% cnf(884,negated_conjecture,(upper_relstr_subset(esk40_0,boole_POSet(cast_as_carrier_subset(esk39_0)))),inference(split_conjunct,[status(thm)],[880])).
% cnf(885,negated_conjecture,(filtered_subset(esk40_0,boole_POSet(cast_as_carrier_subset(esk39_0)))),inference(split_conjunct,[status(thm)],[880])).
% cnf(886,negated_conjecture,(~empty(esk40_0)),inference(split_conjunct,[status(thm)],[880])).
% cnf(887,negated_conjecture,(one_sorted_str(esk39_0)),inference(split_conjunct,[status(thm)],[880])).
% cnf(888,negated_conjecture,(~empty_carrier(esk39_0)),inference(split_conjunct,[status(thm)],[880])).
% cnf(1307,plain,(empty(X1)|~in(X3,X2)|~proper_element(X2,powerset(the_carrier(boole_POSet(X1))))|~upper_relstr_subset(X2,boole_POSet(X1))|~filtered_subset(X2,boole_POSet(X1))|~empty(X3)|~element(X2,powerset(the_carrier(boole_POSet(X1))))),inference(csr,[status(thm)],[244,453])).
% cnf(1308,negated_conjecture,(empty(cast_as_carrier_subset(esk39_0))|~in(X1,esk40_0)|~upper_relstr_subset(esk40_0,boole_POSet(cast_as_carrier_subset(esk39_0)))|~filtered_subset(esk40_0,boole_POSet(cast_as_carrier_subset(esk39_0)))|~empty(X1)|~element(esk40_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk39_0)))))),inference(spm,[status(thm)],[1307,883,theory(equality)])).
% cnf(1309,negated_conjecture,(empty(cast_as_carrier_subset(esk39_0))|~in(X1,esk40_0)|$false|~filtered_subset(esk40_0,boole_POSet(cast_as_carrier_subset(esk39_0)))|~empty(X1)|~element(esk40_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk39_0)))))),inference(rw,[status(thm)],[1308,884,theory(equality)])).
% cnf(1310,negated_conjecture,(empty(cast_as_carrier_subset(esk39_0))|~in(X1,esk40_0)|$false|$false|~empty(X1)|~element(esk40_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk39_0)))))),inference(rw,[status(thm)],[1309,885,theory(equality)])).
% cnf(1311,negated_conjecture,(empty(cast_as_carrier_subset(esk39_0))|~in(X1,esk40_0)|$false|$false|~empty(X1)|$false),inference(rw,[status(thm)],[1310,882,theory(equality)])).
% cnf(1312,negated_conjecture,(empty(cast_as_carrier_subset(esk39_0))|~in(X1,esk40_0)|~empty(X1)),inference(cn,[status(thm)],[1311,theory(equality)])).
% cnf(1361,negated_conjecture,(empty(esk40_0)|empty_carrier(esk39_0)|set_difference(esk40_0,singleton(empty_set))!=esk40_0|~upper_relstr_subset(esk40_0,boole_POSet(cast_as_carrier_subset(esk39_0)))|~filtered_subset(esk40_0,boole_POSet(cast_as_carrier_subset(esk39_0)))|~element(esk40_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk39_0)))))|~one_sorted_str(esk39_0)),inference(spm,[status(thm)],[881,266,theory(equality)])).
% cnf(1367,negated_conjecture,(empty(esk40_0)|empty_carrier(esk39_0)|set_difference(esk40_0,singleton(empty_set))!=esk40_0|$false|~filtered_subset(esk40_0,boole_POSet(cast_as_carrier_subset(esk39_0)))|~element(esk40_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk39_0)))))|~one_sorted_str(esk39_0)),inference(rw,[status(thm)],[1361,884,theory(equality)])).
% cnf(1368,negated_conjecture,(empty(esk40_0)|empty_carrier(esk39_0)|set_difference(esk40_0,singleton(empty_set))!=esk40_0|$false|$false|~element(esk40_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk39_0)))))|~one_sorted_str(esk39_0)),inference(rw,[status(thm)],[1367,885,theory(equality)])).
% cnf(1369,negated_conjecture,(empty(esk40_0)|empty_carrier(esk39_0)|set_difference(esk40_0,singleton(empty_set))!=esk40_0|$false|$false|$false|~one_sorted_str(esk39_0)),inference(rw,[status(thm)],[1368,882,theory(equality)])).
% cnf(1370,negated_conjecture,(empty(esk40_0)|empty_carrier(esk39_0)|set_difference(esk40_0,singleton(empty_set))!=esk40_0|$false|$false|$false|$false),inference(rw,[status(thm)],[1369,887,theory(equality)])).
% cnf(1371,negated_conjecture,(empty(esk40_0)|empty_carrier(esk39_0)|set_difference(esk40_0,singleton(empty_set))!=esk40_0),inference(cn,[status(thm)],[1370,theory(equality)])).
% cnf(1372,negated_conjecture,(empty_carrier(esk39_0)|set_difference(esk40_0,singleton(empty_set))!=esk40_0),inference(sr,[status(thm)],[1371,886,theory(equality)])).
% cnf(1373,negated_conjecture,(set_difference(esk40_0,singleton(empty_set))!=esk40_0),inference(sr,[status(thm)],[1372,888,theory(equality)])).
% cnf(1419,negated_conjecture,(in(empty_set,esk40_0)),inference(spm,[status(thm)],[1373,532,theory(equality)])).
% cnf(1427,negated_conjecture,(empty(cast_as_carrier_subset(esk39_0))|~empty(empty_set)),inference(spm,[status(thm)],[1312,1419,theory(equality)])).
% cnf(1429,negated_conjecture,(empty(cast_as_carrier_subset(esk39_0))|$false),inference(rw,[status(thm)],[1427,626,theory(equality)])).
% cnf(1430,negated_conjecture,(empty(cast_as_carrier_subset(esk39_0))),inference(cn,[status(thm)],[1429,theory(equality)])).
% cnf(1434,negated_conjecture,(empty_carrier(esk39_0)|~one_sorted_str(esk39_0)),inference(spm,[status(thm)],[214,1430,theory(equality)])).
% cnf(1438,negated_conjecture,(empty_carrier(esk39_0)|$false),inference(rw,[status(thm)],[1434,887,theory(equality)])).
% cnf(1439,negated_conjecture,(empty_carrier(esk39_0)),inference(cn,[status(thm)],[1438,theory(equality)])).
% cnf(1440,negated_conjecture,($false),inference(sr,[status(thm)],[1439,888,theory(equality)])).
% cnf(1441,negated_conjecture,($false),1440,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 411
% # ...of these trivial : 45
% # ...subsumed : 46
% # ...remaining for further processing: 320
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 241
% # ...of the previous two non-trivial : 180
% # Contextual simplify-reflections : 25
% # Paramodulations : 238
% # Factorizations : 2
% # Equation resolutions : 1
% # Current number of processed clauses: 313
% # Positive orientable unit clauses: 122
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 30
% # Non-unit-clauses : 161
% # Current number of unprocessed clauses: 121
% # ...number of literals in the above : 543
% # Clause-clause subsumption calls (NU) : 2839
% # Rec. Clause-clause subsumption calls : 465
% # Unit Clause-clause subsumption calls : 140
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 32
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 371 leaves, 1.25+/-1.069 terms/leaf
% # Paramod-from index: 207 leaves, 1.01+/-0.098 terms/leaf
% # Paramod-into index: 343 leaves, 1.09+/-0.387 terms/leaf
% # -------------------------------------------------
% # User time : 0.067 s
% # System time : 0.002 s
% # Total time : 0.069 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.28 WC
% FINAL PrfWatch: 0.19 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP28659/SEU394+1.tptp
%
%------------------------------------------------------------------------------