TSTP Solution File: SET942+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET942+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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:37 EDT 2022
% Result : Theorem 0.21s 1.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 3 unt; 0 def)
% Number of atoms : 82 ( 16 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 100 ( 41 ~; 44 |; 9 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 56 ( 5 sgn 23 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t95_zfmisc_1,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> subset(union(X1),union(X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t95_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> subset(union(X1),union(X2)) ),
inference(assume_negation,[status(cth)],[t95_zfmisc_1]) ).
fof(c_0_4,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk3_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(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)],[d3_tarski])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( subset(esk1_0,esk2_0)
& ~ subset(union(esk1_0),union(esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_6,plain,
! [X5,X6,X7,X7,X9,X5,X6,X11] :
( ( in(X7,esk4_3(X5,X6,X7))
| ~ in(X7,X6)
| X6 != union(X5) )
& ( in(esk4_3(X5,X6,X7),X5)
| ~ in(X7,X6)
| X6 != union(X5) )
& ( ~ in(X7,X9)
| ~ in(X9,X5)
| in(X7,X6)
| X6 != union(X5) )
& ( ~ in(esk5_2(X5,X6),X6)
| ~ in(esk5_2(X5,X6),X11)
| ~ in(X11,X5)
| X6 = union(X5) )
& ( in(esk5_2(X5,X6),esk6_2(X5,X6))
| in(esk5_2(X5,X6),X6)
| X6 = union(X5) )
& ( in(esk6_2(X5,X6),X5)
| in(esk5_2(X5,X6),X6)
| X6 = union(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)],[d4_tarski])])])])])])]) ).
cnf(c_0_7,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( in(X3,X1)
| X1 != union(X2)
| ~ in(X4,X2)
| ~ in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( in(X1,X2)
| X2 != union(esk2_0)
| ~ in(X3,esk1_0)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
( in(esk4_3(X2,X1,X3),X2)
| X1 != union(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( in(X1,X2)
| X2 != union(esk2_0)
| X3 != union(esk1_0)
| ~ in(X1,esk4_3(esk1_0,X3,X4))
| ~ in(X4,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( in(X3,esk4_3(X2,X1,X3))
| X1 != union(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( in(X1,X2)
| X2 != union(esk2_0)
| X3 != union(esk1_0)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
( in(X1,union(esk2_0))
| X2 != union(esk1_0)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_17,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,negated_conjecture,
( in(X1,union(esk2_0))
| ~ in(X1,union(esk1_0)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( subset(X1,union(esk2_0))
| ~ in(esk3_2(X1,union(esk2_0)),union(esk1_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,negated_conjecture,
~ subset(union(esk1_0),union(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
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.11 % Problem : SET942+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 20:26:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.39 # Preprocessing time : 0.015 s
% 0.21/1.39
% 0.21/1.39 # Proof found!
% 0.21/1.39 # SZS status Theorem
% 0.21/1.39 # SZS output start CNFRefutation
% See solution above
% 0.21/1.39 # Proof object total steps : 23
% 0.21/1.39 # Proof object clause steps : 16
% 0.21/1.39 # Proof object formula steps : 7
% 0.21/1.39 # Proof object conjectures : 13
% 0.21/1.39 # Proof object clause conjectures : 10
% 0.21/1.39 # Proof object formula conjectures : 3
% 0.21/1.39 # Proof object initial clauses used : 8
% 0.21/1.39 # Proof object initial formulas used : 3
% 0.21/1.39 # Proof object generating inferences : 8
% 0.21/1.39 # Proof object simplifying inferences : 1
% 0.21/1.39 # Training examples: 0 positive, 0 negative
% 0.21/1.39 # Parsed axioms : 7
% 0.21/1.39 # Removed by relevancy pruning/SinE : 2
% 0.21/1.39 # Initial clauses : 13
% 0.21/1.39 # Removed in clause preprocessing : 0
% 0.21/1.39 # Initial clauses in saturation : 13
% 0.21/1.39 # Processed clauses : 39
% 0.21/1.39 # ...of these trivial : 0
% 0.21/1.39 # ...subsumed : 1
% 0.21/1.39 # ...remaining for further processing : 38
% 0.21/1.39 # Other redundant clauses eliminated : 0
% 0.21/1.39 # Clauses deleted for lack of memory : 0
% 0.21/1.39 # Backward-subsumed : 0
% 0.21/1.39 # Backward-rewritten : 0
% 0.21/1.39 # Generated clauses : 79
% 0.21/1.39 # ...of the previous two non-trivial : 74
% 0.21/1.39 # Contextual simplify-reflections : 0
% 0.21/1.39 # Paramodulations : 77
% 0.21/1.39 # Factorizations : 0
% 0.21/1.39 # Equation resolutions : 2
% 0.21/1.39 # Current number of processed clauses : 38
% 0.21/1.39 # Positive orientable unit clauses : 2
% 0.21/1.39 # Positive unorientable unit clauses: 0
% 0.21/1.39 # Negative unit clauses : 2
% 0.21/1.39 # Non-unit-clauses : 34
% 0.21/1.39 # Current number of unprocessed clauses: 48
% 0.21/1.39 # ...number of literals in the above : 220
% 0.21/1.39 # Current number of archived formulas : 0
% 0.21/1.39 # Current number of archived clauses : 0
% 0.21/1.39 # Clause-clause subsumption calls (NU) : 234
% 0.21/1.39 # Rec. Clause-clause subsumption calls : 137
% 0.21/1.39 # Non-unit clause-clause subsumptions : 1
% 0.21/1.39 # Unit Clause-clause subsumption calls : 5
% 0.21/1.39 # Rewrite failures with RHS unbound : 0
% 0.21/1.39 # BW rewrite match attempts : 1
% 0.21/1.39 # BW rewrite match successes : 0
% 0.21/1.39 # Condensation attempts : 0
% 0.21/1.39 # Condensation successes : 0
% 0.21/1.39 # Termbank termtop insertions : 1966
% 0.21/1.39
% 0.21/1.39 # -------------------------------------------------
% 0.21/1.39 # User time : 0.015 s
% 0.21/1.39 # System time : 0.003 s
% 0.21/1.39 # Total time : 0.018 s
% 0.21/1.39 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------