TSTP Solution File: SET591+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET591+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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:52:14 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 57 ( 10 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 60 ( 26 ~; 19 |; 9 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 12 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th50,conjecture,
! [X1,X2] :
( subset(X1,difference(X2,X1))
=> X1 = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_th50) ).
fof(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',empty_set_defn) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',subset_defn) ).
fof(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',difference_defn) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',equal_defn) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,difference(X2,X1))
=> X1 = empty_set ),
inference(assume_negation,[status(cth)],[prove_th50]) ).
fof(c_0_6,plain,
! [X2] : ~ member(X2,empty_set),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[empty_set_defn])]) ).
fof(c_0_7,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk3_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk3_2(X4,X5),X5)
| subset(X4,X5) ) ),
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)],[subset_defn])])])])])])]) ).
fof(c_0_8,negated_conjecture,
( subset(esk1_0,difference(esk2_0,esk1_0))
& esk1_0 != empty_set ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_9,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X6,X4)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X5)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X4)
| member(X6,X5)
| member(X6,difference(X4,X5)) ) ),
inference(distribute,[status(thm)],[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)],[difference_defn])])])])])]) ).
fof(c_0_10,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])])])]) ).
cnf(c_0_11,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
subset(esk1_0,difference(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ member(X1,difference(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
~ member(X1,esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_19,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
subset(esk1_0,X1),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_21,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET591+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 12:43:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.015 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 23
% 0.24/1.41 # Proof object clause steps : 12
% 0.24/1.41 # Proof object formula steps : 11
% 0.24/1.41 # Proof object conjectures : 8
% 0.24/1.41 # Proof object clause conjectures : 5
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 7
% 0.24/1.41 # Proof object initial formulas used : 5
% 0.24/1.41 # Proof object generating inferences : 5
% 0.24/1.41 # Proof object simplifying inferences : 2
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 7
% 0.24/1.41 # Removed by relevancy pruning/SinE : 1
% 0.24/1.41 # Initial clauses : 13
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 13
% 0.24/1.41 # Processed clauses : 18
% 0.24/1.41 # ...of these trivial : 0
% 0.24/1.41 # ...subsumed : 0
% 0.24/1.41 # ...remaining for further processing : 18
% 0.24/1.41 # Other redundant clauses eliminated : 2
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 1
% 0.24/1.41 # Generated clauses : 18
% 0.24/1.41 # ...of the previous two non-trivial : 11
% 0.24/1.41 # Contextual simplify-reflections : 1
% 0.24/1.41 # Paramodulations : 16
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 2
% 0.24/1.41 # Current number of processed clauses : 15
% 0.24/1.41 # Positive orientable unit clauses : 3
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 3
% 0.24/1.41 # Non-unit-clauses : 9
% 0.24/1.41 # Current number of unprocessed clauses: 6
% 0.24/1.41 # ...number of literals in the above : 13
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 1
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 5
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 5
% 0.24/1.41 # Non-unit clause-clause subsumptions : 1
% 0.24/1.41 # Unit Clause-clause subsumption calls : 0
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 1
% 0.24/1.41 # BW rewrite match successes : 1
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 775
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.013 s
% 0.24/1.41 # System time : 0.003 s
% 0.24/1.41 # Total time : 0.016 s
% 0.24/1.41 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------