TSTP Solution File: SEU110+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU110+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 01:07:48 EST 2010
% Result : Theorem 92.24s
% Output : Solution 92.84s
% 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/SystemOnTPTP13301/SEU110+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~t23_finsub_1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... reflexivity_r1_tarski:
% CSA axiom reflexivity_r1_tarski found
% Looking for CSA axiom ... t1_xboole_1:
% CSA axiom t1_xboole_1 found
% Looking for CSA axiom ... d3_tarski: CSA axiom d3_tarski found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... dt_k5_finsub_1:
% CSA axiom dt_k5_finsub_1 found
% Looking for CSA axiom ... antisymmetry_r2_hidden:
% CSA axiom antisymmetry_r2_hidden found
% Looking for CSA axiom ... existence_m1_subset_1:
% CSA axiom existence_m1_subset_1 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... t3_subset:
% CSA axiom t3_subset found
% Looking for CSA axiom ... cc3_finsub_1:
% CSA axiom cc3_finsub_1 found
% Looking for CSA axiom ... rc1_subset_1:
% CSA axiom rc1_subset_1 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ... yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc2_subset_1:
% CSA axiom rc2_subset_1 found
% Looking for CSA axiom ... d5_finsub_1:
% CSA axiom d5_finsub_1 found
% Looking for CSA axiom ... t8_boole:
% CSA axiom t8_boole found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :t8_boole:d5_finsub_1:rc2_subset_1:rc1_subset_1:cc3_finsub_1:t3_subset:existence_m1_subset_1:antisymmetry_r2_hidden:dt_k5_finsub_1:d3_tarski:t1_xboole_1:reflexivity_r1_tarski (12)
% Unselected axioms are ... :cc1_finsub_1:cc2_finsub_1:fc1_xboole_0:rc1_xboole_0:rc2_xboole_0:cc1_finset_1:rc1_finset_1:t7_boole:cc2_finset_1:fc1_subset_1:t4_subset:t1_subset:fc1_finsub_1:rc3_finset_1:rc4_finset_1:t5_subset:rc1_finsub_1:fc2_finsub_1:t2_subset:t6_boole:rc2_finset_1 (21)
% SZS status THM for /tmp/SystemOnTPTP13301/SEU110+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP13301/SEU110+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 15517
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(preboolean(X2)=>(X2=finite_subsets(X1)<=>![X3]:(in(X3,X2)<=>(subset(X3,X1)&finite(X3))))),file('/tmp/SRASS.s.p', d5_finsub_1)).
% fof(9, axiom,![X1]:preboolean(finite_subsets(X1)),file('/tmp/SRASS.s.p', dt_k5_finsub_1)).
% fof(10, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(11, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3)),file('/tmp/SRASS.s.p', t1_xboole_1)).
% fof(13, conjecture,![X1]:![X2]:(subset(X1,X2)=>subset(finite_subsets(X1),finite_subsets(X2))),file('/tmp/SRASS.s.p', t23_finsub_1)).
% fof(14, negated_conjecture,~(![X1]:![X2]:(subset(X1,X2)=>subset(finite_subsets(X1),finite_subsets(X2)))),inference(assume_negation,[status(cth)],[13])).
% fof(20, plain,![X1]:![X2]:(~(preboolean(X2))|((~(X2=finite_subsets(X1))|![X3]:((~(in(X3,X2))|(subset(X3,X1)&finite(X3)))&((~(subset(X3,X1))|~(finite(X3)))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|(~(subset(X3,X1))|~(finite(X3))))&(in(X3,X2)|(subset(X3,X1)&finite(X3))))|X2=finite_subsets(X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(21, plain,![X4]:![X5]:(~(preboolean(X5))|((~(X5=finite_subsets(X4))|![X6]:((~(in(X6,X5))|(subset(X6,X4)&finite(X6)))&((~(subset(X6,X4))|~(finite(X6)))|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|(~(subset(X7,X4))|~(finite(X7))))&(in(X7,X5)|(subset(X7,X4)&finite(X7))))|X5=finite_subsets(X4)))),inference(variable_rename,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:(~(preboolean(X5))|((~(X5=finite_subsets(X4))|![X6]:((~(in(X6,X5))|(subset(X6,X4)&finite(X6)))&((~(subset(X6,X4))|~(finite(X6)))|in(X6,X5))))&(((~(in(esk1_2(X4,X5),X5))|(~(subset(esk1_2(X4,X5),X4))|~(finite(esk1_2(X4,X5)))))&(in(esk1_2(X4,X5),X5)|(subset(esk1_2(X4,X5),X4)&finite(esk1_2(X4,X5)))))|X5=finite_subsets(X4)))),inference(skolemize,[status(esa)],[21])).
% fof(23, plain,![X4]:![X5]:![X6]:(((((~(in(X6,X5))|(subset(X6,X4)&finite(X6)))&((~(subset(X6,X4))|~(finite(X6)))|in(X6,X5)))|~(X5=finite_subsets(X4)))&(((~(in(esk1_2(X4,X5),X5))|(~(subset(esk1_2(X4,X5),X4))|~(finite(esk1_2(X4,X5)))))&(in(esk1_2(X4,X5),X5)|(subset(esk1_2(X4,X5),X4)&finite(esk1_2(X4,X5)))))|X5=finite_subsets(X4)))|~(preboolean(X5))),inference(shift_quantors,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:((((((subset(X6,X4)|~(in(X6,X5)))|~(X5=finite_subsets(X4)))|~(preboolean(X5)))&(((finite(X6)|~(in(X6,X5)))|~(X5=finite_subsets(X4)))|~(preboolean(X5))))&((((~(subset(X6,X4))|~(finite(X6)))|in(X6,X5))|~(X5=finite_subsets(X4)))|~(preboolean(X5))))&((((~(in(esk1_2(X4,X5),X5))|(~(subset(esk1_2(X4,X5),X4))|~(finite(esk1_2(X4,X5)))))|X5=finite_subsets(X4))|~(preboolean(X5)))&((((subset(esk1_2(X4,X5),X4)|in(esk1_2(X4,X5),X5))|X5=finite_subsets(X4))|~(preboolean(X5)))&(((finite(esk1_2(X4,X5))|in(esk1_2(X4,X5),X5))|X5=finite_subsets(X4))|~(preboolean(X5)))))),inference(distribute,[status(thm)],[23])).
% cnf(28,plain,(in(X3,X1)|~preboolean(X1)|X1!=finite_subsets(X2)|~finite(X3)|~subset(X3,X2)),inference(split_conjunct,[status(thm)],[24])).
% cnf(29,plain,(finite(X3)|~preboolean(X1)|X1!=finite_subsets(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[24])).
% cnf(30,plain,(subset(X3,X2)|~preboolean(X1)|X1!=finite_subsets(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(54, plain,![X2]:preboolean(finite_subsets(X2)),inference(variable_rename,[status(thm)],[9])).
% cnf(55,plain,(preboolean(finite_subsets(X1))),inference(split_conjunct,[status(thm)],[54])).
% fof(56, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(57, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[56])).
% fof(58, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk5_2(X4,X5),X4)&~(in(esk5_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[57])).
% fof(59, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk5_2(X4,X5),X4)&~(in(esk5_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[58])).
% fof(60, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk5_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk5_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[59])).
% cnf(61,plain,(subset(X1,X2)|~in(esk5_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[60])).
% cnf(62,plain,(subset(X1,X2)|in(esk5_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(64, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X2,X3)))|subset(X1,X3)),inference(fof_nnf,[status(thm)],[11])).
% fof(65, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X5,X6)))|subset(X4,X6)),inference(variable_rename,[status(thm)],[64])).
% cnf(66,plain,(subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[65])).
% fof(69, negated_conjecture,?[X1]:?[X2]:(subset(X1,X2)&~(subset(finite_subsets(X1),finite_subsets(X2)))),inference(fof_nnf,[status(thm)],[14])).
% fof(70, negated_conjecture,?[X3]:?[X4]:(subset(X3,X4)&~(subset(finite_subsets(X3),finite_subsets(X4)))),inference(variable_rename,[status(thm)],[69])).
% fof(71, negated_conjecture,(subset(esk6_0,esk7_0)&~(subset(finite_subsets(esk6_0),finite_subsets(esk7_0)))),inference(skolemize,[status(esa)],[70])).
% cnf(72,negated_conjecture,(~subset(finite_subsets(esk6_0),finite_subsets(esk7_0))),inference(split_conjunct,[status(thm)],[71])).
% cnf(73,negated_conjecture,(subset(esk6_0,esk7_0)),inference(split_conjunct,[status(thm)],[71])).
% cnf(83,negated_conjecture,(subset(X1,esk7_0)|~subset(X1,esk6_0)),inference(spm,[status(thm)],[66,73,theory(equality)])).
% cnf(86,plain,(finite(esk5_2(X1,X2))|subset(X1,X2)|finite_subsets(X3)!=X1|~preboolean(X1)),inference(spm,[status(thm)],[29,62,theory(equality)])).
% cnf(89,plain,(subset(esk5_2(X1,X2),X3)|subset(X1,X2)|finite_subsets(X3)!=X1|~preboolean(X1)),inference(spm,[status(thm)],[30,62,theory(equality)])).
% cnf(265,plain,(finite(esk5_2(finite_subsets(X1),X2))|subset(finite_subsets(X1),X2)|~preboolean(finite_subsets(X1))),inference(er,[status(thm)],[86,theory(equality)])).
% cnf(266,plain,(finite(esk5_2(finite_subsets(X1),X2))|subset(finite_subsets(X1),X2)|$false),inference(rw,[status(thm)],[265,55,theory(equality)])).
% cnf(267,plain,(finite(esk5_2(finite_subsets(X1),X2))|subset(finite_subsets(X1),X2)),inference(cn,[status(thm)],[266,theory(equality)])).
% cnf(268,plain,(subset(esk5_2(finite_subsets(X1),X2),X1)|subset(finite_subsets(X1),X2)|~preboolean(finite_subsets(X1))),inference(er,[status(thm)],[89,theory(equality)])).
% cnf(269,plain,(subset(esk5_2(finite_subsets(X1),X2),X1)|subset(finite_subsets(X1),X2)|$false),inference(rw,[status(thm)],[268,55,theory(equality)])).
% cnf(270,plain,(subset(esk5_2(finite_subsets(X1),X2),X1)|subset(finite_subsets(X1),X2)),inference(cn,[status(thm)],[269,theory(equality)])).
% cnf(913,negated_conjecture,(subset(esk5_2(finite_subsets(esk6_0),X1),esk7_0)|subset(finite_subsets(esk6_0),X1)),inference(spm,[status(thm)],[83,270,theory(equality)])).
% cnf(970,negated_conjecture,(in(esk5_2(finite_subsets(esk6_0),X1),X2)|subset(finite_subsets(esk6_0),X1)|finite_subsets(esk7_0)!=X2|~finite(esk5_2(finite_subsets(esk6_0),X1))|~preboolean(X2)),inference(spm,[status(thm)],[28,913,theory(equality)])).
% cnf(3430,negated_conjecture,(subset(finite_subsets(esk6_0),X1)|in(esk5_2(finite_subsets(esk6_0),X1),X2)|finite_subsets(esk7_0)!=X2|~preboolean(X2)),inference(csr,[status(thm)],[970,267])).
% cnf(3431,negated_conjecture,(subset(finite_subsets(esk6_0),X1)|in(esk5_2(finite_subsets(esk6_0),X1),finite_subsets(esk7_0))|~preboolean(finite_subsets(esk7_0))),inference(er,[status(thm)],[3430,theory(equality)])).
% cnf(3432,negated_conjecture,(subset(finite_subsets(esk6_0),X1)|in(esk5_2(finite_subsets(esk6_0),X1),finite_subsets(esk7_0))|$false),inference(rw,[status(thm)],[3431,55,theory(equality)])).
% cnf(3433,negated_conjecture,(subset(finite_subsets(esk6_0),X1)|in(esk5_2(finite_subsets(esk6_0),X1),finite_subsets(esk7_0))),inference(cn,[status(thm)],[3432,theory(equality)])).
% cnf(3439,negated_conjecture,(subset(finite_subsets(esk6_0),finite_subsets(esk7_0))),inference(spm,[status(thm)],[61,3433,theory(equality)])).
% cnf(3444,negated_conjecture,($false),inference(sr,[status(thm)],[3439,72,theory(equality)])).
% cnf(3445,negated_conjecture,($false),3444,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 572
% # ...of these trivial : 13
% # ...subsumed : 220
% # ...remaining for further processing: 339
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 2
% # Generated clauses : 2899
% # ...of the previous two non-trivial : 2514
% # Contextual simplify-reflections : 35
% # Paramodulations : 2887
% # Factorizations : 0
% # Equation resolutions : 12
% # Current number of processed clauses: 330
% # Positive orientable unit clauses: 33
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 294
% # Current number of unprocessed clauses: 1948
% # ...number of literals in the above : 5854
% # Clause-clause subsumption calls (NU) : 5914
% # Rec. Clause-clause subsumption calls : 4792
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 14
% # Indexed BW rewrite attempts : 200
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 166 leaves, 3.51+/-5.972 terms/leaf
% # Paramod-from index: 44 leaves, 3.23+/-4.752 terms/leaf
% # Paramod-into index: 133 leaves, 3.74+/-6.399 terms/leaf
% # -------------------------------------------------
% # User time : 0.131 s
% # System time : 0.005 s
% # Total time : 0.136 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.26 CPU 0.34 WC
% FINAL PrfWatch: 0.26 CPU 0.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP13301/SEU110+1.tptp
%
%------------------------------------------------------------------------------