TSTP Solution File: SET887+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET887+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 00:55:13 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 6 unt; 0 def)
% Number of atoms : 112 ( 86 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 132 ( 51 ~; 55 |; 21 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 77 ( 19 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t28_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
~ ( subset(unordered_pair(X1,X2),unordered_pair(X3,X4))
& X1 != X3
& X1 != X4 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t28_zfmisc_1) ).
fof(l46_zfmisc_1,axiom,
! [X1,X2,X3] :
( subset(X1,unordered_pair(X2,X3))
<=> ~ ( X1 != empty_set
& X1 != singleton(X2)
& X1 != singleton(X3)
& X1 != unordered_pair(X2,X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l46_zfmisc_1) ).
fof(t8_zfmisc_1,axiom,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_zfmisc_1) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_tarski) ).
fof(t10_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t10_zfmisc_1) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_xboole_0) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3,X4] :
~ ( subset(unordered_pair(X1,X2),unordered_pair(X3,X4))
& X1 != X3
& X1 != X4 ),
inference(assume_negation,[status(cth)],[t28_zfmisc_1]) ).
fof(c_0_7,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ subset(X4,unordered_pair(X5,X6))
| X4 = empty_set
| X4 = singleton(X5)
| X4 = singleton(X6)
| X4 = unordered_pair(X5,X6) )
& ( X4 != empty_set
| subset(X4,unordered_pair(X5,X6)) )
& ( X4 != singleton(X5)
| subset(X4,unordered_pair(X5,X6)) )
& ( X4 != singleton(X6)
| subset(X4,unordered_pair(X5,X6)) )
& ( X4 != unordered_pair(X5,X6)
| subset(X4,unordered_pair(X5,X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l46_zfmisc_1])])])])]) ).
fof(c_0_8,negated_conjecture,
( subset(unordered_pair(esk5_0,esk6_0),unordered_pair(esk7_0,esk8_0))
& esk5_0 != esk7_0
& esk5_0 != esk8_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X4,X5,X6] :
( singleton(X4) != unordered_pair(X5,X6)
| X4 = X5 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_zfmisc_1])])])]) ).
cnf(c_0_10,plain,
( X1 = unordered_pair(X2,X3)
| X1 = singleton(X3)
| X1 = singleton(X2)
| X1 = empty_set
| ~ subset(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
subset(unordered_pair(esk5_0,esk6_0),unordered_pair(esk7_0,esk8_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( unordered_pair(esk7_0,esk8_0) = unordered_pair(esk5_0,esk6_0)
| singleton(esk8_0) = unordered_pair(esk5_0,esk6_0)
| singleton(esk7_0) = unordered_pair(esk5_0,esk6_0)
| unordered_pair(esk5_0,esk6_0) = empty_set ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( unordered_pair(esk7_0,esk8_0) = unordered_pair(esk5_0,esk6_0)
| singleton(esk7_0) = unordered_pair(esk5_0,esk6_0)
| unordered_pair(esk5_0,esk6_0) = empty_set
| esk8_0 = X1
| unordered_pair(esk5_0,esk6_0) != unordered_pair(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
esk5_0 != esk8_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_16,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6
| X7 != unordered_pair(X5,X6) )
& ( X8 != X5
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( X8 != X6
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( esk2_3(X5,X6,X7) != X5
| ~ in(esk2_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( esk2_3(X5,X6,X7) != X6
| ~ in(esk2_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( in(esk2_3(X5,X6,X7),X7)
| esk2_3(X5,X6,X7) = X5
| esk2_3(X5,X6,X7) = X6
| X7 = unordered_pair(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tarski])])])])])])]) ).
cnf(c_0_17,negated_conjecture,
( unordered_pair(esk7_0,esk8_0) = unordered_pair(esk5_0,esk6_0)
| singleton(esk7_0) = unordered_pair(esk5_0,esk6_0)
| unordered_pair(esk5_0,esk6_0) = empty_set ),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_15]) ).
cnf(c_0_18,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X5,X6,X7,X8] :
( unordered_pair(X5,X6) != unordered_pair(X7,X8)
| X5 = X7
| X5 = X8 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t10_zfmisc_1])]) ).
cnf(c_0_20,negated_conjecture,
( unordered_pair(esk7_0,esk8_0) = unordered_pair(esk5_0,esk6_0)
| unordered_pair(esk5_0,esk6_0) = empty_set
| esk7_0 = X1
| unordered_pair(esk5_0,esk6_0) != unordered_pair(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
esk5_0 != esk7_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_22,plain,
! [X3,X4,X3] :
( ( X3 != empty_set
| ~ in(X4,X3) )
& ( in(esk1_1(X3),X3)
| X3 = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d1_xboole_0])])])])])])]) ).
cnf(c_0_23,plain,
( in(X1,X2)
| X2 != unordered_pair(X3,X1) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( X1 = X2
| X1 = X3
| unordered_pair(X1,X4) != unordered_pair(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( unordered_pair(esk7_0,esk8_0) = unordered_pair(esk5_0,esk6_0)
| unordered_pair(esk5_0,esk6_0) = empty_set ),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_20]),c_0_21]) ).
cnf(c_0_26,plain,
( ~ in(X1,X2)
| X2 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( unordered_pair(esk5_0,esk6_0) = empty_set
| X1 = esk7_0
| X1 = esk8_0
| unordered_pair(X1,X2) != unordered_pair(esk5_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
unordered_pair(X1,X2) != empty_set,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_28]),c_0_21]),c_0_15]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET887+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 16:46:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.015 s
% 0.23/1.40
% 0.23/1.40 # Failure: Out of unprocessed clauses!
% 0.23/1.40 # OLD status GaveUp
% 0.23/1.40 # Parsed axioms : 12
% 0.23/1.40 # Removed by relevancy pruning/SinE : 8
% 0.23/1.40 # Initial clauses : 6
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 6
% 0.23/1.40 # Processed clauses : 15
% 0.23/1.40 # ...of these trivial : 0
% 0.23/1.40 # ...subsumed : 7
% 0.23/1.40 # ...remaining for further processing : 8
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 0
% 0.23/1.40 # Backward-rewritten : 1
% 0.23/1.40 # Generated clauses : 10
% 0.23/1.40 # ...of the previous two non-trivial : 9
% 0.23/1.40 # Contextual simplify-reflections : 0
% 0.23/1.40 # Paramodulations : 8
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 2
% 0.23/1.40 # Current number of processed clauses : 7
% 0.23/1.40 # Positive orientable unit clauses : 2
% 0.23/1.40 # Positive unorientable unit clauses: 1
% 0.23/1.40 # Negative unit clauses : 2
% 0.23/1.40 # Non-unit-clauses : 2
% 0.23/1.40 # Current number of unprocessed clauses: 0
% 0.23/1.40 # ...number of literals in the above : 0
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 1
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 11
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 11
% 0.23/1.40 # Non-unit clause-clause subsumptions : 7
% 0.23/1.40 # Unit Clause-clause subsumption calls : 0
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 4
% 0.23/1.40 # BW rewrite match successes : 4
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 330
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.013 s
% 0.23/1.40 # System time : 0.002 s
% 0.23/1.40 # Total time : 0.015 s
% 0.23/1.40 # Maximum resident set size: 2776 pages
% 0.23/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.40 # Preprocessing time : 0.015 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 31
% 0.23/1.40 # Proof object clause steps : 18
% 0.23/1.40 # Proof object formula steps : 13
% 0.23/1.40 # Proof object conjectures : 13
% 0.23/1.40 # Proof object clause conjectures : 10
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 8
% 0.23/1.40 # Proof object initial formulas used : 6
% 0.23/1.40 # Proof object generating inferences : 9
% 0.23/1.40 # Proof object simplifying inferences : 6
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 12
% 0.23/1.40 # Removed by relevancy pruning/SinE : 0
% 0.23/1.40 # Initial clauses : 24
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 24
% 0.23/1.40 # Processed clauses : 40
% 0.23/1.40 # ...of these trivial : 0
% 0.23/1.40 # ...subsumed : 3
% 0.23/1.40 # ...remaining for further processing : 36
% 0.23/1.40 # Other redundant clauses eliminated : 2
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 4
% 0.23/1.40 # Backward-rewritten : 0
% 0.23/1.40 # Generated clauses : 73
% 0.23/1.40 # ...of the previous two non-trivial : 64
% 0.23/1.40 # Contextual simplify-reflections : 0
% 0.23/1.40 # Paramodulations : 63
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 9
% 0.23/1.40 # Current number of processed clauses : 29
% 0.23/1.40 # Positive orientable unit clauses : 5
% 0.23/1.40 # Positive unorientable unit clauses: 1
% 0.23/1.40 # Negative unit clauses : 4
% 0.23/1.40 # Non-unit-clauses : 19
% 0.23/1.40 # Current number of unprocessed clauses: 32
% 0.23/1.40 # ...number of literals in the above : 82
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 5
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 47
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 39
% 0.23/1.40 # Non-unit clause-clause subsumptions : 5
% 0.23/1.40 # Unit Clause-clause subsumption calls : 4
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 7
% 0.23/1.40 # BW rewrite match successes : 6
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 1630
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.014 s
% 0.23/1.40 # System time : 0.003 s
% 0.23/1.40 # Total time : 0.017 s
% 0.23/1.40 # Maximum resident set size: 2780 pages
%------------------------------------------------------------------------------