TSTP Solution File: SET983+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET983+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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:52 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 8 unt; 0 def)
% Number of atoms : 48 ( 11 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 52 ( 19 ~; 19 |; 10 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 41 ( 4 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t137_zfmisc_1,conjecture,
! [X1,X2,X3,X4,X5] :
( ( in(X1,cartesian_product2(X2,X3))
& in(X1,cartesian_product2(X4,X5)) )
=> in(X1,cartesian_product2(set_intersection2(X2,X4),set_intersection2(X3,X5))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t137_zfmisc_1) ).
fof(t123_zfmisc_1,axiom,
! [X1,X2,X3,X4] : cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t123_zfmisc_1) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_xboole_0) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3,X4,X5] :
( ( in(X1,cartesian_product2(X2,X3))
& in(X1,cartesian_product2(X4,X5)) )
=> in(X1,cartesian_product2(set_intersection2(X2,X4),set_intersection2(X3,X5))) ),
inference(assume_negation,[status(cth)],[t137_zfmisc_1]) ).
fof(c_0_4,negated_conjecture,
( in(esk1_0,cartesian_product2(esk2_0,esk3_0))
& in(esk1_0,cartesian_product2(esk4_0,esk5_0))
& ~ in(esk1_0,cartesian_product2(set_intersection2(esk2_0,esk4_0),set_intersection2(esk3_0,esk5_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X5,X6,X7,X8] : cartesian_product2(set_intersection2(X5,X6),set_intersection2(X7,X8)) = set_intersection2(cartesian_product2(X5,X7),cartesian_product2(X6,X8)),
inference(variable_rename,[status(thm)],[t123_zfmisc_1]) ).
fof(c_0_6,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( in(X8,X6)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(X8,X5)
| ~ in(X8,X6)
| in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(esk6_3(X5,X6,X7),X7)
| ~ in(esk6_3(X5,X6,X7),X5)
| ~ in(esk6_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk6_3(X5,X6,X7),X5)
| in(esk6_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk6_3(X5,X6,X7),X6)
| in(esk6_3(X5,X6,X7),X7)
| X7 = set_intersection2(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)],[d3_xboole_0])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
~ in(esk1_0,cartesian_product2(set_intersection2(esk2_0,esk4_0),set_intersection2(esk3_0,esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ in(esk1_0,set_intersection2(cartesian_product2(esk2_0,esk3_0),cartesian_product2(esk4_0,esk5_0))),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
in(esk1_0,cartesian_product2(esk4_0,esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
in(esk1_0,cartesian_product2(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET983+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 10 15:15:53 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.015 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 15
% 0.24/1.42 # Proof object clause steps : 8
% 0.24/1.42 # Proof object formula steps : 7
% 0.24/1.42 # Proof object conjectures : 8
% 0.24/1.42 # Proof object clause conjectures : 5
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 5
% 0.24/1.42 # Proof object initial formulas used : 3
% 0.24/1.42 # Proof object generating inferences : 2
% 0.24/1.42 # Proof object simplifying inferences : 4
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 8
% 0.24/1.42 # Removed by relevancy pruning/SinE : 2
% 0.24/1.42 # Initial clauses : 13
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 13
% 0.24/1.42 # Processed clauses : 30
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 8
% 0.24/1.42 # ...remaining for further processing : 22
% 0.24/1.42 # Other redundant clauses eliminated : 3
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 3
% 0.24/1.42 # Generated clauses : 81
% 0.24/1.42 # ...of the previous two non-trivial : 62
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 71
% 0.24/1.42 # Factorizations : 4
% 0.24/1.42 # Equation resolutions : 6
% 0.24/1.42 # Current number of processed clauses : 19
% 0.24/1.42 # Positive orientable unit clauses : 5
% 0.24/1.42 # Positive unorientable unit clauses: 1
% 0.24/1.42 # Negative unit clauses : 3
% 0.24/1.42 # Non-unit-clauses : 10
% 0.24/1.42 # Current number of unprocessed clauses: 25
% 0.24/1.42 # ...number of literals in the above : 63
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 3
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 72
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 68
% 0.24/1.42 # Non-unit clause-clause subsumptions : 8
% 0.24/1.42 # Unit Clause-clause subsumption calls : 0
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 12
% 0.24/1.42 # BW rewrite match successes : 10
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 1533
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.015 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.017 s
% 0.24/1.42 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------