%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET956+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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:42 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 3 unt; 0 def)
% Number of atoms : 56 ( 3 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 62 ( 23 ~; 21 |; 12 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-4 aty)
% Number of variables : 48 ( 4 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t109_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ( subset(X1,cartesian_product2(X2,X3))
& ! [X5,X6] :
( in(ordered_pair(X5,X6),X1)
=> in(ordered_pair(X5,X6),X4) ) )
=> subset(X1,X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t109_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(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(c_0_3,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( subset(X1,cartesian_product2(X2,X3))
& ! [X5,X6] :
( in(ordered_pair(X5,X6),X1)
=> in(ordered_pair(X5,X6),X4) ) )
=> subset(X1,X4) ),
inference(assume_negation,[status(cth)],[t109_zfmisc_1]) ).
fof(c_0_4,negated_conjecture,
! [X11,X12] :
( subset(esk1_0,cartesian_product2(esk2_0,esk3_0))
& ( ~ in(ordered_pair(X11,X12),esk1_0)
| in(ordered_pair(X11,X12),esk4_0) )
& ~ subset(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(esk6_4(X7,X8,X9,X10),X8)
| ~ subset(X7,cartesian_product2(X8,X9))
| ~ in(X10,X7) )
& ( in(esk7_4(X7,X8,X9,X10),X9)
| ~ subset(X7,cartesian_product2(X8,X9))
| ~ in(X10,X7) )
& ( X10 = ordered_pair(esk6_4(X7,X8,X9,X10),esk7_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),esk4_0)
| ~ in(ordered_pair(X1,X2),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( X1 = ordered_pair(esk6_4(X2,X3,X4,X1),esk7_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,esk4_0)
| ~ subset(X2,cartesian_product2(X3,X4))
| ~ in(X1,esk1_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
subset(esk1_0,cartesian_product2(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_10,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk5_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk5_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])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
( in(X1,esk4_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| in(esk5_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( subset(X1,X2)
| ~ in(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( subset(esk1_0,X1)
| in(esk5_2(esk1_0,X1),esk4_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ subset(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET956+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 02:02:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.016 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 17
% 0.23/1.42 # Proof object clause steps : 10
% 0.23/1.42 # Proof object formula steps : 7
% 0.23/1.42 # Proof object conjectures : 10
% 0.23/1.42 # Proof object clause conjectures : 7
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 6
% 0.23/1.42 # Proof object initial formulas used : 3
% 0.23/1.42 # Proof object generating inferences : 4
% 0.23/1.42 # Proof object simplifying inferences : 1
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 10
% 0.23/1.42 # Removed by relevancy pruning/SinE : 2
% 0.23/1.42 # Initial clauses : 14
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 14
% 0.23/1.42 # Processed clauses : 20
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 20
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 2
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 18
% 0.23/1.42 # ...of the previous two non-trivial : 14
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 18
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 18
% 0.23/1.42 # Positive orientable unit clauses : 3
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 3
% 0.23/1.42 # Non-unit-clauses : 12
% 0.23/1.42 # Current number of unprocessed clauses: 7
% 0.23/1.42 # ...number of literals in the above : 19
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 2
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 39
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 38
% 0.23/1.42 # Non-unit clause-clause subsumptions : 2
% 0.23/1.42 # Unit Clause-clause subsumption calls : 0
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 0
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 1045
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.014 s
% 0.23/1.42 # System time : 0.003 s
% 0.23/1.42 # Total time : 0.017 s
% 0.23/1.42 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------