TSTP Solution File: SET957+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET957+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:43 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 74 ( 13 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 81 ( 30 ~; 30 |; 15 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-4 aty)
% Number of variables : 58 ( 6 sgn 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t110_zfmisc_1,conjecture,
! [X1,X2,X3,X4,X5,X6] :
( ( subset(X1,cartesian_product2(X2,X3))
& subset(X4,cartesian_product2(X5,X6))
& ! [X7,X8] :
( in(ordered_pair(X7,X8),X1)
<=> in(ordered_pair(X7,X8),X4) ) )
=> X1 = X4 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t110_zfmisc_1) ).
fof(t103_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
~ ( subset(X1,cartesian_product2(X2,X3))
& in(X4,X1)
& ! [X5,X6] :
~ ( in(X5,X2)
& in(X6,X3)
& X4 = ordered_pair(X5,X6) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t103_zfmisc_1) ).
fof(t2_tarski,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3,X4,X5,X6] :
( ( subset(X1,cartesian_product2(X2,X3))
& subset(X4,cartesian_product2(X5,X6))
& ! [X7,X8] :
( in(ordered_pair(X7,X8),X1)
<=> in(ordered_pair(X7,X8),X4) ) )
=> X1 = X4 ),
inference(assume_negation,[status(cth)],[t110_zfmisc_1]) ).
fof(c_0_4,negated_conjecture,
! [X15,X16,X15,X16] :
( subset(esk1_0,cartesian_product2(esk2_0,esk3_0))
& subset(esk4_0,cartesian_product2(esk5_0,esk6_0))
& ( ~ in(ordered_pair(X15,X16),esk1_0)
| in(ordered_pair(X15,X16),esk4_0) )
& ( ~ in(ordered_pair(X15,X16),esk4_0)
| in(ordered_pair(X15,X16),esk1_0) )
& esk1_0 != esk4_0 ),
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)],[c_0_3])])])])])]) ).
fof(c_0_5,plain,
! [X7,X8,X9,X10] :
( ( in(esk8_4(X7,X8,X9,X10),X8)
| ~ subset(X7,cartesian_product2(X8,X9))
| ~ in(X10,X7) )
& ( in(esk9_4(X7,X8,X9,X10),X9)
| ~ subset(X7,cartesian_product2(X8,X9))
| ~ in(X10,X7) )
& ( X10 = ordered_pair(esk8_4(X7,X8,X9,X10),esk9_4(X7,X8,X9,X10))
| ~ subset(X7,cartesian_product2(X8,X9))
| ~ in(X10,X7) ) ),
inference(distribute,[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)],[t103_zfmisc_1])])])])])]) ).
cnf(c_0_6,negated_conjecture,
( in(ordered_pair(X1,X2),esk1_0)
| ~ in(ordered_pair(X1,X2),esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( X1 = ordered_pair(esk8_4(X2,X3,X4,X1),esk9_4(X2,X3,X4,X1))
| ~ in(X1,X2)
| ~ subset(X2,cartesian_product2(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( in(X1,esk1_0)
| ~ subset(X2,cartesian_product2(X3,X4))
| ~ in(X1,esk4_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
subset(esk4_0,cartesian_product2(esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_10,plain,
! [X4,X5] :
( ( ~ in(esk7_2(X4,X5),X4)
| ~ in(esk7_2(X4,X5),X5)
| X4 = X5 )
& ( in(esk7_2(X4,X5),X4)
| in(esk7_2(X4,X5),X5)
| X4 = X5 ) ),
inference(distribute,[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)],[t2_tarski])])])])])]) ).
cnf(c_0_11,negated_conjecture,
( in(X1,esk1_0)
| ~ in(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( X1 = X2
| in(esk7_2(X1,X2),X2)
| in(esk7_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( esk4_0 = X1
| in(esk7_2(esk4_0,X1),esk1_0)
| in(esk7_2(esk4_0,X1),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 != esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( in(ordered_pair(X1,X2),esk4_0)
| ~ in(ordered_pair(X1,X2),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
( X1 = X2
| ~ in(esk7_2(X1,X2),X2)
| ~ in(esk7_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
in(esk7_2(esk4_0,esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_13]),c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( in(X1,esk4_0)
| ~ subset(X2,cartesian_product2(X3,X4))
| ~ in(X1,esk1_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_7]) ).
cnf(c_0_19,negated_conjecture,
subset(esk1_0,cartesian_product2(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_20,negated_conjecture,
~ in(esk7_2(esk4_0,esk1_0),esk4_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( in(X1,esk4_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SET957+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.14/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jul 10 07:11:47 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.016 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 23
% 0.25/1.44 # Proof object clause steps : 16
% 0.25/1.44 # Proof object formula steps : 7
% 0.25/1.44 # Proof object conjectures : 16
% 0.25/1.44 # Proof object clause conjectures : 13
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 8
% 0.25/1.44 # Proof object initial formulas used : 3
% 0.25/1.44 # Proof object generating inferences : 8
% 0.25/1.44 # Proof object simplifying inferences : 4
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 10
% 0.25/1.44 # Removed by relevancy pruning/SinE : 2
% 0.25/1.44 # Initial clauses : 15
% 0.25/1.44 # Removed in clause preprocessing : 0
% 0.25/1.44 # Initial clauses in saturation : 15
% 0.25/1.44 # Processed clauses : 47
% 0.25/1.44 # ...of these trivial : 1
% 0.25/1.44 # ...subsumed : 6
% 0.25/1.44 # ...remaining for further processing : 40
% 0.25/1.44 # Other redundant clauses eliminated : 0
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 4
% 0.25/1.44 # Backward-rewritten : 0
% 0.25/1.44 # Generated clauses : 64
% 0.25/1.44 # ...of the previous two non-trivial : 52
% 0.25/1.44 # Contextual simplify-reflections : 2
% 0.25/1.44 # Paramodulations : 60
% 0.25/1.44 # Factorizations : 4
% 0.25/1.44 # Equation resolutions : 0
% 0.25/1.44 # Current number of processed clauses : 36
% 0.25/1.44 # Positive orientable unit clauses : 5
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 6
% 0.25/1.44 # Non-unit-clauses : 25
% 0.25/1.44 # Current number of unprocessed clauses: 18
% 0.25/1.44 # ...number of literals in the above : 52
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 4
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 221
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 175
% 0.25/1.44 # Non-unit clause-clause subsumptions : 10
% 0.25/1.44 # Unit Clause-clause subsumption calls : 31
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 0
% 0.25/1.44 # BW rewrite match successes : 0
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 1768
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.019 s
% 0.25/1.44 # System time : 0.001 s
% 0.25/1.44 # Total time : 0.020 s
% 0.25/1.44 # Maximum resident set size: 2932 pages
%------------------------------------------------------------------------------