TSTP Solution File: SEU308+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU308+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 03:22:11 EST 2010
% Result : Theorem 23.44s
% Output : Solution 23.44s
% 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/SystemOnTPTP13883/SEU308+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13883/SEU308+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13883/SEU308+2.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 13981
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.44 CPU 2.02 WC
% PrfWatch: 3.23 CPU 4.04 WC
% PrfWatch: 5.22 CPU 6.05 WC
% PrfWatch: 7.21 CPU 8.05 WC
% # Preprocessing time : 0.214 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 9.19 CPU 10.05 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(one_sorted_str(X1)=>cast_as_carrier_subset(X1)=the_carrier(X1)),file('/tmp/SRASS.s.p', d3_pre_topc)).
% fof(11, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>subset_complement(X1,X2)=set_difference(X1,X2)),file('/tmp/SRASS.s.p', d5_subset_1)).
% fof(12, axiom,![X1]:![X2]:![X3]:((element(X2,powerset(X1))&element(X3,powerset(X1)))=>subset_difference(X1,X2,X3)=set_difference(X2,X3)),file('/tmp/SRASS.s.p', redefinition_k6_subset_1)).
% fof(27, axiom,![X1]:element(cast_to_subset(X1),powerset(X1)),file('/tmp/SRASS.s.p', dt_k2_subset_1)).
% fof(130, axiom,![X1]:cast_to_subset(X1)=X1,file('/tmp/SRASS.s.p', d4_subset_1)).
% fof(495, conjecture,![X1]:(one_sorted_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>subset_complement(the_carrier(X1),X2)=subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2))),file('/tmp/SRASS.s.p', t17_pre_topc)).
% fof(496, negated_conjecture,~(![X1]:(one_sorted_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>subset_complement(the_carrier(X1),X2)=subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2)))),inference(assume_negation,[status(cth)],[495])).
% fof(576, plain,![X1]:(~(one_sorted_str(X1))|cast_as_carrier_subset(X1)=the_carrier(X1)),inference(fof_nnf,[status(thm)],[1])).
% fof(577, plain,![X2]:(~(one_sorted_str(X2))|cast_as_carrier_subset(X2)=the_carrier(X2)),inference(variable_rename,[status(thm)],[576])).
% cnf(578,plain,(cast_as_carrier_subset(X1)=the_carrier(X1)|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[577])).
% fof(607, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|subset_complement(X1,X2)=set_difference(X1,X2)),inference(fof_nnf,[status(thm)],[11])).
% fof(608, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|subset_complement(X3,X4)=set_difference(X3,X4)),inference(variable_rename,[status(thm)],[607])).
% cnf(609,plain,(subset_complement(X1,X2)=set_difference(X1,X2)|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[608])).
% fof(610, plain,![X1]:![X2]:![X3]:((~(element(X2,powerset(X1)))|~(element(X3,powerset(X1))))|subset_difference(X1,X2,X3)=set_difference(X2,X3)),inference(fof_nnf,[status(thm)],[12])).
% fof(611, plain,![X4]:![X5]:![X6]:((~(element(X5,powerset(X4)))|~(element(X6,powerset(X4))))|subset_difference(X4,X5,X6)=set_difference(X5,X6)),inference(variable_rename,[status(thm)],[610])).
% cnf(612,plain,(subset_difference(X1,X2,X3)=set_difference(X2,X3)|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[611])).
% fof(677, plain,![X2]:element(cast_to_subset(X2),powerset(X2)),inference(variable_rename,[status(thm)],[27])).
% cnf(678,plain,(element(cast_to_subset(X1),powerset(X1))),inference(split_conjunct,[status(thm)],[677])).
% fof(1219, plain,![X2]:cast_to_subset(X2)=X2,inference(variable_rename,[status(thm)],[130])).
% cnf(1220,plain,(cast_to_subset(X1)=X1),inference(split_conjunct,[status(thm)],[1219])).
% fof(3689, negated_conjecture,?[X1]:(one_sorted_str(X1)&?[X2]:(element(X2,powerset(the_carrier(X1)))&~(subset_complement(the_carrier(X1),X2)=subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2)))),inference(fof_nnf,[status(thm)],[496])).
% fof(3690, negated_conjecture,?[X3]:(one_sorted_str(X3)&?[X4]:(element(X4,powerset(the_carrier(X3)))&~(subset_complement(the_carrier(X3),X4)=subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),X4)))),inference(variable_rename,[status(thm)],[3689])).
% fof(3691, negated_conjecture,(one_sorted_str(esk310_0)&(element(esk311_0,powerset(the_carrier(esk310_0)))&~(subset_complement(the_carrier(esk310_0),esk311_0)=subset_difference(the_carrier(esk310_0),cast_as_carrier_subset(esk310_0),esk311_0)))),inference(skolemize,[status(esa)],[3690])).
% cnf(3692,negated_conjecture,(subset_complement(the_carrier(esk310_0),esk311_0)!=subset_difference(the_carrier(esk310_0),cast_as_carrier_subset(esk310_0),esk311_0)),inference(split_conjunct,[status(thm)],[3691])).
% cnf(3693,negated_conjecture,(element(esk311_0,powerset(the_carrier(esk310_0)))),inference(split_conjunct,[status(thm)],[3691])).
% cnf(3694,negated_conjecture,(one_sorted_str(esk310_0)),inference(split_conjunct,[status(thm)],[3691])).
% cnf(3777,plain,(element(X1,powerset(X1))),inference(rw,[status(thm)],[678,1220,theory(equality)]),['unfolding']).
% cnf(5293,negated_conjecture,(subset_complement(the_carrier(esk310_0),esk311_0)=set_difference(the_carrier(esk310_0),esk311_0)),inference(spm,[status(thm)],[609,3693,theory(equality)])).
% cnf(8287,negated_conjecture,(subset_difference(the_carrier(esk310_0),X1,esk311_0)=set_difference(X1,esk311_0)|~element(X1,powerset(the_carrier(esk310_0)))),inference(spm,[status(thm)],[612,3693,theory(equality)])).
% cnf(96739,negated_conjecture,(subset_difference(the_carrier(esk310_0),cast_as_carrier_subset(esk310_0),esk311_0)!=set_difference(the_carrier(esk310_0),esk311_0)),inference(rw,[status(thm)],[3692,5293,theory(equality)])).
% cnf(96750,negated_conjecture,(subset_difference(the_carrier(esk310_0),the_carrier(esk310_0),esk311_0)!=set_difference(the_carrier(esk310_0),esk311_0)|~one_sorted_str(esk310_0)),inference(spm,[status(thm)],[96739,578,theory(equality)])).
% cnf(96755,negated_conjecture,(subset_difference(the_carrier(esk310_0),the_carrier(esk310_0),esk311_0)!=set_difference(the_carrier(esk310_0),esk311_0)|$false),inference(rw,[status(thm)],[96750,3694,theory(equality)])).
% cnf(96756,negated_conjecture,(subset_difference(the_carrier(esk310_0),the_carrier(esk310_0),esk311_0)!=set_difference(the_carrier(esk310_0),esk311_0)),inference(cn,[status(thm)],[96755,theory(equality)])).
% cnf(122462,negated_conjecture,(subset_difference(the_carrier(esk310_0),the_carrier(esk310_0),esk311_0)=set_difference(the_carrier(esk310_0),esk311_0)),inference(spm,[status(thm)],[8287,3777,theory(equality)])).
% cnf(122474,negated_conjecture,($false),inference(sr,[status(thm)],[122462,96756,theory(equality)])).
% cnf(122475,negated_conjecture,($false),122474,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5351
% # ...of these trivial : 68
% # ...subsumed : 947
% # ...remaining for further processing: 4336
% # Other redundant clauses eliminated : 540
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 76
% # Generated clauses : 111087
% # ...of the previous two non-trivial : 108573
% # Contextual simplify-reflections : 368
% # Paramodulations : 110461
% # Factorizations : 14
% # Equation resolutions : 659
% # Current number of processed clauses: 2379
% # Positive orientable unit clauses: 291
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 65
% # Non-unit-clauses : 2020
% # Current number of unprocessed clauses: 103684
% # ...number of literals in the above : 675099
% # Clause-clause subsumption calls (NU) : 2502669
% # Rec. Clause-clause subsumption calls : 167929
% # Unit Clause-clause subsumption calls : 25227
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 118
% # Indexed BW rewrite successes : 58
% # Backwards rewriting index: 1787 leaves, 1.59+/-3.525 terms/leaf
% # Paramod-from index: 720 leaves, 1.12+/-1.558 terms/leaf
% # Paramod-into index: 1411 leaves, 1.38+/-2.913 terms/leaf
% # -------------------------------------------------
% # User time : 8.110 s
% # System time : 0.217 s
% # Total time : 8.327 s
% # Maximum resident set size: 0 pages
% PrfWatch: 10.94 CPU 11.80 WC
% FINAL PrfWatch: 10.94 CPU 11.80 WC
% SZS output end Solution for /tmp/SystemOnTPTP13883/SEU308+2.tptp
%
%------------------------------------------------------------------------------