%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM560+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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 : Mon Jul 18 09:33:48 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 7 unt; 0 def)
% Number of atoms : 113 ( 15 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 155 ( 65 ~; 69 |; 14 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 41 ( 3 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefPtt,axiom,
! [X1,X2] :
( ( aFunction0(X1)
& aElement0(X2) )
=> ! [X3] :
( X3 = sdtlbdtrb0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElementOf0(X4,szDzozmdt0(X1))
& sdtlpdtrp0(X1,X4) = X2 ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefPtt) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefSub) ).
fof(m__,conjecture,
aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mDomSet,axiom,
! [X1] :
( aFunction0(X1)
=> aSet0(szDzozmdt0(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDomSet) ).
fof(m__2693,hypothesis,
( aFunction0(xF)
& aElement0(xy) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2693) ).
fof(c_0_5,plain,
! [X5,X6,X7,X8,X8,X7] :
( ( aSet0(X7)
| X7 != sdtlbdtrb0(X5,X6)
| ~ aFunction0(X5)
| ~ aElement0(X6) )
& ( aElementOf0(X8,szDzozmdt0(X5))
| ~ aElementOf0(X8,X7)
| X7 != sdtlbdtrb0(X5,X6)
| ~ aFunction0(X5)
| ~ aElement0(X6) )
& ( sdtlpdtrp0(X5,X8) = X6
| ~ aElementOf0(X8,X7)
| X7 != sdtlbdtrb0(X5,X6)
| ~ aFunction0(X5)
| ~ aElement0(X6) )
& ( ~ aElementOf0(X8,szDzozmdt0(X5))
| sdtlpdtrp0(X5,X8) != X6
| aElementOf0(X8,X7)
| X7 != sdtlbdtrb0(X5,X6)
| ~ aFunction0(X5)
| ~ aElement0(X6) )
& ( ~ aElementOf0(esk2_3(X5,X6,X7),X7)
| ~ aElementOf0(esk2_3(X5,X6,X7),szDzozmdt0(X5))
| sdtlpdtrp0(X5,esk2_3(X5,X6,X7)) != X6
| ~ aSet0(X7)
| X7 = sdtlbdtrb0(X5,X6)
| ~ aFunction0(X5)
| ~ aElement0(X6) )
& ( aElementOf0(esk2_3(X5,X6,X7),szDzozmdt0(X5))
| aElementOf0(esk2_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| X7 = sdtlbdtrb0(X5,X6)
| ~ aFunction0(X5)
| ~ aElement0(X6) )
& ( sdtlpdtrp0(X5,esk2_3(X5,X6,X7)) = X6
| aElementOf0(esk2_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| X7 = sdtlbdtrb0(X5,X6)
| ~ aFunction0(X5)
| ~ aElement0(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)],[mDefPtt])])])])])])]) ).
cnf(c_0_6,plain,
( aElementOf0(X4,szDzozmdt0(X2))
| ~ aElement0(X1)
| ~ aFunction0(X2)
| X3 != sdtlbdtrb0(X2,X1)
| ~ aElementOf0(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X4,X5,X6,X5] :
( ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aElementOf0(esk1_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk1_2(X4,X5),X4)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) ) ),
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)],[mDefSub])])])])])])]) ).
cnf(c_0_8,plain,
( aSet0(X3)
| ~ aElement0(X1)
| ~ aFunction0(X2)
| X3 != sdtlbdtrb0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_10,plain,
( aElementOf0(X1,szDzozmdt0(X2))
| ~ aFunction0(X2)
| ~ aElementOf0(X1,sdtlbdtrb0(X2,X3))
| ~ aElement0(X3) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( aSubsetOf0(X2,X1)
| aElementOf0(esk1_2(X1,X2),X2)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( aSet0(sdtlbdtrb0(X1,X2))
| ~ aFunction0(X1)
| ~ aElement0(X2) ),
inference(er,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X2] :
( ~ aFunction0(X2)
| aSet0(szDzozmdt0(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDomSet])]) ).
fof(c_0_14,negated_conjecture,
~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( aSubsetOf0(X2,X1)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( aSubsetOf0(sdtlbdtrb0(X1,X2),X3)
| aElementOf0(esk1_2(X3,sdtlbdtrb0(X1,X2)),szDzozmdt0(X1))
| ~ aFunction0(X1)
| ~ aElement0(X2)
| ~ aSet0(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_17,plain,
( aSet0(szDzozmdt0(X1))
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( aSubsetOf0(sdtlbdtrb0(X1,X2),szDzozmdt0(X1))
| ~ aFunction0(X1)
| ~ aElement0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_12]) ).
cnf(c_0_20,hypothesis,
aFunction0(xF),
inference(split_conjunct,[status(thm)],[m__2693]) ).
cnf(c_0_21,hypothesis,
aElement0(xy),
inference(split_conjunct,[status(thm)],[m__2693]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM560+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n027.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 : Tue Jul 5 16:58:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.016 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 23
% 0.22/1.41 # Proof object clause steps : 13
% 0.22/1.41 # Proof object formula steps : 10
% 0.22/1.41 # Proof object conjectures : 5
% 0.22/1.41 # Proof object clause conjectures : 2
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 8
% 0.22/1.41 # Proof object initial formulas used : 5
% 0.22/1.41 # Proof object generating inferences : 5
% 0.22/1.41 # Proof object simplifying inferences : 6
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 68
% 0.22/1.41 # Removed by relevancy pruning/SinE : 53
% 0.22/1.41 # Initial clauses : 25
% 0.22/1.41 # Removed in clause preprocessing : 4
% 0.22/1.41 # Initial clauses in saturation : 21
% 0.22/1.41 # Processed clauses : 39
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 1
% 0.22/1.41 # ...remaining for further processing : 38
% 0.22/1.41 # Other redundant clauses eliminated : 2
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 2
% 0.22/1.41 # Backward-rewritten : 0
% 0.22/1.41 # Generated clauses : 48
% 0.22/1.41 # ...of the previous two non-trivial : 37
% 0.22/1.41 # Contextual simplify-reflections : 9
% 0.22/1.41 # Paramodulations : 41
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 7
% 0.22/1.41 # Current number of processed clauses : 36
% 0.22/1.41 # Positive orientable unit clauses : 2
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 1
% 0.22/1.41 # Non-unit-clauses : 33
% 0.22/1.41 # Current number of unprocessed clauses: 16
% 0.22/1.41 # ...number of literals in the above : 89
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 2
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 111
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 36
% 0.22/1.41 # Non-unit clause-clause subsumptions : 12
% 0.22/1.41 # Unit Clause-clause subsumption calls : 0
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 0
% 0.22/1.41 # BW rewrite match successes : 0
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 3493
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.015 s
% 0.22/1.41 # System time : 0.005 s
% 0.22/1.41 # Total time : 0.020 s
% 0.22/1.41 # Maximum resident set size: 3108 pages
%------------------------------------------------------------------------------