TSTP Solution File: SET985+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET985+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:53 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 60 ( 25 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 51 ( 15 ~; 24 |; 6 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 36 ( 6 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t139_zfmisc_1,conjecture,
! [X1] :
( ~ empty(X1)
=> ! [X2,X3,X4] :
( ( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| subset(cartesian_product2(X2,X1),cartesian_product2(X4,X3)) )
=> subset(X2,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t139_zfmisc_1) ).
fof(t138_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
=> ( cartesian_product2(X1,X2) = empty_set
| ( subset(X1,X3)
& subset(X2,X4) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t138_zfmisc_1) ).
fof(t113_zfmisc_1,axiom,
! [X1,X2] :
( cartesian_product2(X1,X2) = empty_set
<=> ( X1 = empty_set
| X2 = empty_set ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t113_zfmisc_1) ).
fof(t2_xboole_1,axiom,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_xboole_1) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_xboole_0) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ~ empty(X1)
=> ! [X2,X3,X4] :
( ( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| subset(cartesian_product2(X2,X1),cartesian_product2(X4,X3)) )
=> subset(X2,X4) ) ),
inference(assume_negation,[status(cth)],[t139_zfmisc_1]) ).
fof(c_0_6,plain,
! [X5,X6,X7,X8] :
( ( subset(X5,X7)
| cartesian_product2(X5,X6) = empty_set
| ~ subset(cartesian_product2(X5,X6),cartesian_product2(X7,X8)) )
& ( subset(X6,X8)
| cartesian_product2(X5,X6) = empty_set
| ~ subset(cartesian_product2(X5,X6),cartesian_product2(X7,X8)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t138_zfmisc_1])])]) ).
fof(c_0_7,negated_conjecture,
( ~ empty(esk1_0)
& ( subset(cartesian_product2(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0))
| subset(cartesian_product2(esk2_0,esk1_0),cartesian_product2(esk4_0,esk3_0)) )
& ~ subset(esk2_0,esk4_0) ),
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)],[c_0_5])])])])])]) ).
cnf(c_0_8,plain,
( cartesian_product2(X1,X2) = empty_set
| subset(X1,X3)
| ~ subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( subset(cartesian_product2(esk2_0,esk1_0),cartesian_product2(esk4_0,esk3_0))
| subset(cartesian_product2(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
~ subset(esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X3,X4,X3,X4] :
( ( cartesian_product2(X3,X4) != empty_set
| X3 = empty_set
| X4 = empty_set )
& ( X3 != empty_set
| cartesian_product2(X3,X4) = empty_set )
& ( X4 != empty_set
| cartesian_product2(X3,X4) = empty_set ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t113_zfmisc_1])])])])]) ).
cnf(c_0_12,plain,
( cartesian_product2(X1,X2) = empty_set
| subset(X2,X4)
| ~ subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( cartesian_product2(esk2_0,esk1_0) = empty_set
| subset(cartesian_product2(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
fof(c_0_14,plain,
! [X2] : subset(empty_set,X2),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
cnf(c_0_15,plain,
( X1 = empty_set
| X2 = empty_set
| cartesian_product2(X2,X1) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( cartesian_product2(esk2_0,esk1_0) = empty_set
| cartesian_product2(esk1_0,esk2_0) = empty_set ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10]) ).
cnf(c_0_17,plain,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( empty_set = esk2_0
| empty_set = esk1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( empty_set = esk1_0
| subset(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_21,negated_conjecture,
empty_set = esk1_0,
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ empty(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET985+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n020.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 : Mon Jul 11 06:24:43 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.015 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 24
% 0.23/1.41 # Proof object clause steps : 14
% 0.23/1.41 # Proof object formula steps : 10
% 0.23/1.41 # Proof object conjectures : 11
% 0.23/1.41 # Proof object clause conjectures : 8
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 8
% 0.23/1.41 # Proof object initial formulas used : 5
% 0.23/1.41 # Proof object generating inferences : 5
% 0.23/1.41 # Proof object simplifying inferences : 5
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 8
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 13
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 13
% 0.23/1.41 # Processed clauses : 24
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 1
% 0.23/1.41 # ...remaining for further processing : 23
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 1
% 0.23/1.41 # Backward-rewritten : 14
% 0.23/1.41 # Generated clauses : 40
% 0.23/1.41 # ...of the previous two non-trivial : 35
% 0.23/1.41 # Contextual simplify-reflections : 1
% 0.23/1.41 # Paramodulations : 39
% 0.23/1.41 # Factorizations : 1
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 8
% 0.23/1.41 # Positive orientable unit clauses : 3
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 4
% 0.23/1.41 # Non-unit-clauses : 1
% 0.23/1.41 # Current number of unprocessed clauses: 10
% 0.23/1.41 # ...number of literals in the above : 24
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 15
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 29
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 27
% 0.23/1.41 # Non-unit clause-clause subsumptions : 1
% 0.23/1.41 # Unit Clause-clause subsumption calls : 3
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 1064
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.014 s
% 0.23/1.41 # System time : 0.002 s
% 0.23/1.41 # Total time : 0.016 s
% 0.23/1.41 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------