%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LAT385+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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 : Sun Jul 17 04:48:15 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 282 ( 8 equ)
% Maximal formula atoms : 48 ( 14 avg)
% Number of connectives : 351 ( 89 ~; 104 |; 120 &)
% ( 1 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-3 aty)
% Number of variables : 65 ( 3 sgn 51 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__1123,hypothesis,
( aSet0(xU)
& ! [X1] :
( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xU) ) )
| aSubsetOf0(X1,xU) )
=> ? [X2] :
( aElementOf0(X2,xU)
& aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,X1,xU)
& ! [X3] :
( ( ( aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X3,X4) ) )
| aLowerBoundOfIn0(X3,X1,xU) )
=> sdtlseqdt0(X3,X2) )
& aInfimumOfIn0(X2,X1,xU)
& ? [X3] :
( aElementOf0(X3,xU)
& aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X4,X3) )
& aUpperBoundOfIn0(X3,X1,xU)
& ! [X4] :
( ( ( aElementOf0(X4,xU)
& ! [X5] :
( aElementOf0(X5,X1)
=> sdtlseqdt0(X5,X4) ) )
| aUpperBoundOfIn0(X4,X1,xU) )
=> sdtlseqdt0(X3,X4) )
& aSupremumOfIn0(X3,X1,xU) ) ) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ! [X1,X2] :
( ( aElementOf0(X1,szDzozmdt0(xf))
& aElementOf0(X2,szDzozmdt0(xf)) )
=> ( sdtlseqdt0(X1,X2)
=> sdtlseqdt0(sdtlpdtrp0(xf,X1),sdtlpdtrp0(xf,X2)) ) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,xU) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1123) ).
fof(m__,conjecture,
? [X1] :
( ( aElementOf0(X1,xU)
& ( ( aElementOf0(X1,xU)
& ! [X2] :
( aElementOf0(X2,xP)
=> sdtlseqdt0(X1,X2) ) )
| aLowerBoundOfIn0(X1,xP,xU) )
& ! [X2] :
( ( aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,xP)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,xP,xU) )
=> sdtlseqdt0(X2,X1) ) )
| aInfimumOfIn0(X1,xP,xU) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__1244,hypothesis,
( aSet0(xP)
& ! [X1] :
( ( aElementOf0(X1,xP)
=> ( aElementOf0(X1,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,X1),X1)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& aUpperBoundOfIn0(X1,xT,xU) ) )
& ( ( aElementOf0(X1,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,X1),X1)
& ( ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
| aUpperBoundOfIn0(X1,xT,xU) ) )
=> aElementOf0(X1,xP) ) )
& xP = cS1241(xU,xf,xT) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1244) ).
fof(c_0_3,plain,
! [X1] :
( epred1_1(X1)
<=> ? [X2] :
( aElementOf0(X2,xU)
& aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,X1,xU)
& ! [X3] :
( ( ( aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X3,X4) ) )
| aLowerBoundOfIn0(X3,X1,xU) )
=> sdtlseqdt0(X3,X2) )
& aInfimumOfIn0(X2,X1,xU)
& ? [X3] :
( aElementOf0(X3,xU)
& aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X4,X3) )
& aUpperBoundOfIn0(X3,X1,xU)
& ! [X4] :
( ( ( aElementOf0(X4,xU)
& ! [X5] :
( aElementOf0(X5,X1)
=> sdtlseqdt0(X5,X4) ) )
| aUpperBoundOfIn0(X4,X1,xU) )
=> sdtlseqdt0(X3,X4) )
& aSupremumOfIn0(X3,X1,xU) ) ) ),
introduced(definition) ).
fof(c_0_4,hypothesis,
( aSet0(xU)
& ! [X1] :
( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xU) ) )
| aSubsetOf0(X1,xU) )
=> epred1_1(X1) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ! [X1,X2] :
( ( aElementOf0(X1,szDzozmdt0(xf))
& aElementOf0(X2,szDzozmdt0(xf)) )
=> ( sdtlseqdt0(X1,X2)
=> sdtlseqdt0(sdtlpdtrp0(xf,X1),sdtlpdtrp0(xf,X2)) ) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,xU) ),
inference(apply_def,[status(thm)],[m__1123,c_0_3]) ).
fof(c_0_5,negated_conjecture,
~ ? [X1] :
( ( aElementOf0(X1,xU)
& ( ( aElementOf0(X1,xU)
& ! [X2] :
( aElementOf0(X2,xP)
=> sdtlseqdt0(X1,X2) ) )
| aLowerBoundOfIn0(X1,xP,xU) )
& ! [X2] :
( ( aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,xP)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,xP,xU) )
=> sdtlseqdt0(X2,X1) ) )
| aInfimumOfIn0(X1,xP,xU) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X1] :
( epred1_1(X1)
=> ? [X2] :
( aElementOf0(X2,xU)
& aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,X1,xU)
& ! [X3] :
( ( ( aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X3,X4) ) )
| aLowerBoundOfIn0(X3,X1,xU) )
=> sdtlseqdt0(X3,X2) )
& aInfimumOfIn0(X2,X1,xU)
& ? [X3] :
( aElementOf0(X3,xU)
& aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X4,X3) )
& aUpperBoundOfIn0(X3,X1,xU)
& ! [X4] :
( ( ( aElementOf0(X4,xU)
& ! [X5] :
( aElementOf0(X5,X1)
=> sdtlseqdt0(X5,X4) ) )
| aUpperBoundOfIn0(X4,X1,xU) )
=> sdtlseqdt0(X3,X4) )
& aSupremumOfIn0(X3,X1,xU) ) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_7,hypothesis,
! [X3,X5,X6] :
( aSet0(xU)
& ( aElementOf0(esk1_1(X3),X3)
| ~ aSet0(X3)
| epred1_1(X3) )
& ( ~ aElementOf0(esk1_1(X3),xU)
| ~ aSet0(X3)
| epred1_1(X3) )
& ( ~ aSubsetOf0(X3,xU)
| epred1_1(X3) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ( ~ aElementOf0(X5,szDzozmdt0(xf))
| ~ aElementOf0(X6,szDzozmdt0(xf))
| ~ sdtlseqdt0(X5,X6)
| sdtlseqdt0(sdtlpdtrp0(xf,X5),sdtlpdtrp0(xf,X6)) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,xU) ),
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)],[c_0_4])])])])])])]) ).
fof(c_0_8,hypothesis,
! [X3,X4,X3] :
( aSet0(xP)
& ( aElementOf0(X3,xU)
| ~ aElementOf0(X3,xP) )
& ( sdtlseqdt0(sdtlpdtrp0(xf,X3),X3)
| ~ aElementOf0(X3,xP) )
& ( ~ aElementOf0(X4,xT)
| sdtlseqdt0(X4,X3)
| ~ aElementOf0(X3,xP) )
& ( aUpperBoundOfIn0(X3,xT,xU)
| ~ aElementOf0(X3,xP) )
& ( aElementOf0(esk2_1(X3),xT)
| ~ aElementOf0(X3,xU)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X3),X3)
| aElementOf0(X3,xP) )
& ( ~ sdtlseqdt0(esk2_1(X3),X3)
| ~ aElementOf0(X3,xU)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X3),X3)
| aElementOf0(X3,xP) )
& ( ~ aUpperBoundOfIn0(X3,xT,xU)
| ~ aElementOf0(X3,xU)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X3),X3)
| aElementOf0(X3,xP) )
& xP = cS1241(xU,xf,xT) ),
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)],[m__1244])])])])])])]) ).
fof(c_0_9,negated_conjecture,
! [X4,X7,X4] :
( ( aElementOf0(esk4_1(X4),xU)
| aElementOf0(esk3_1(X4),xP)
| ~ aElementOf0(X4,xU)
| ~ aElementOf0(X4,xU) )
& ( ~ aElementOf0(X7,xP)
| sdtlseqdt0(esk4_1(X4),X7)
| aElementOf0(esk3_1(X4),xP)
| ~ aElementOf0(X4,xU)
| ~ aElementOf0(X4,xU) )
& ( aLowerBoundOfIn0(esk4_1(X4),xP,xU)
| aElementOf0(esk3_1(X4),xP)
| ~ aElementOf0(X4,xU)
| ~ aElementOf0(X4,xU) )
& ( ~ sdtlseqdt0(esk4_1(X4),X4)
| aElementOf0(esk3_1(X4),xP)
| ~ aElementOf0(X4,xU)
| ~ aElementOf0(X4,xU) )
& ( aElementOf0(esk4_1(X4),xU)
| ~ sdtlseqdt0(X4,esk3_1(X4))
| ~ aElementOf0(X4,xU)
| ~ aElementOf0(X4,xU) )
& ( ~ aElementOf0(X7,xP)
| sdtlseqdt0(esk4_1(X4),X7)
| ~ sdtlseqdt0(X4,esk3_1(X4))
| ~ aElementOf0(X4,xU)
| ~ aElementOf0(X4,xU) )
& ( aLowerBoundOfIn0(esk4_1(X4),xP,xU)
| ~ sdtlseqdt0(X4,esk3_1(X4))
| ~ aElementOf0(X4,xU)
| ~ aElementOf0(X4,xU) )
& ( ~ sdtlseqdt0(esk4_1(X4),X4)
| ~ sdtlseqdt0(X4,esk3_1(X4))
| ~ aElementOf0(X4,xU)
| ~ aElementOf0(X4,xU) )
& ( aElementOf0(esk4_1(X4),xU)
| ~ aLowerBoundOfIn0(X4,xP,xU)
| ~ aElementOf0(X4,xU) )
& ( ~ aElementOf0(X7,xP)
| sdtlseqdt0(esk4_1(X4),X7)
| ~ aLowerBoundOfIn0(X4,xP,xU)
| ~ aElementOf0(X4,xU) )
& ( aLowerBoundOfIn0(esk4_1(X4),xP,xU)
| ~ aLowerBoundOfIn0(X4,xP,xU)
| ~ aElementOf0(X4,xU) )
& ( ~ sdtlseqdt0(esk4_1(X4),X4)
| ~ aLowerBoundOfIn0(X4,xP,xU)
| ~ aElementOf0(X4,xU) )
& ~ aInfimumOfIn0(X4,xP,xU) ),
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)],[c_0_5])])])])])])]) ).
fof(c_0_10,plain,
! [X6,X8,X9,X12,X13] :
( ( aElementOf0(esk15_1(X6),xU)
| ~ epred1_1(X6) )
& ( ~ aElementOf0(X8,X6)
| sdtlseqdt0(esk15_1(X6),X8)
| ~ epred1_1(X6) )
& ( aLowerBoundOfIn0(esk15_1(X6),X6,xU)
| ~ epred1_1(X6) )
& ( aElementOf0(esk16_2(X6,X9),X6)
| ~ aElementOf0(X9,xU)
| sdtlseqdt0(X9,esk15_1(X6))
| ~ epred1_1(X6) )
& ( ~ sdtlseqdt0(X9,esk16_2(X6,X9))
| ~ aElementOf0(X9,xU)
| sdtlseqdt0(X9,esk15_1(X6))
| ~ epred1_1(X6) )
& ( ~ aLowerBoundOfIn0(X9,X6,xU)
| sdtlseqdt0(X9,esk15_1(X6))
| ~ epred1_1(X6) )
& ( aInfimumOfIn0(esk15_1(X6),X6,xU)
| ~ epred1_1(X6) )
& ( aElementOf0(esk17_1(X6),xU)
| ~ epred1_1(X6) )
& ( ~ aElementOf0(X12,X6)
| sdtlseqdt0(X12,esk17_1(X6))
| ~ epred1_1(X6) )
& ( aUpperBoundOfIn0(esk17_1(X6),X6,xU)
| ~ epred1_1(X6) )
& ( aElementOf0(esk18_2(X6,X13),X6)
| ~ aElementOf0(X13,xU)
| sdtlseqdt0(esk17_1(X6),X13)
| ~ epred1_1(X6) )
& ( ~ sdtlseqdt0(esk18_2(X6,X13),X13)
| ~ aElementOf0(X13,xU)
| sdtlseqdt0(esk17_1(X6),X13)
| ~ epred1_1(X6) )
& ( ~ aUpperBoundOfIn0(X13,X6,xU)
| sdtlseqdt0(esk17_1(X6),X13)
| ~ epred1_1(X6) )
& ( aSupremumOfIn0(esk17_1(X6),X6,xU)
| ~ epred1_1(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)],[inference(fof_simplification,[status(thm)],[c_0_6])])])])])])])]) ).
cnf(c_0_11,hypothesis,
( epred1_1(X1)
| ~ aSet0(X1)
| ~ aElementOf0(esk1_1(X1),xU) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
( aElementOf0(X1,xU)
| ~ aElementOf0(X1,xP) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
~ aInfimumOfIn0(X1,xP,xU),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( aInfimumOfIn0(esk15_1(X1),X1,xU)
| ~ epred1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
( epred1_1(X1)
| ~ aElementOf0(esk1_1(X1),xP)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
( epred1_1(X1)
| aElementOf0(esk1_1(X1),X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
~ epred1_1(xP),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LAT385+4 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n021.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 29 17:29:27 EDT 2022
% 0.12/0.34 % 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.024 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 : 20
% 0.22/1.41 # Proof object clause steps : 9
% 0.22/1.41 # Proof object formula steps : 11
% 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 : 6
% 0.22/1.41 # Proof object initial formulas used : 3
% 0.22/1.41 # Proof object generating inferences : 3
% 0.22/1.41 # Proof object simplifying inferences : 3
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 28
% 0.22/1.41 # Removed by relevancy pruning/SinE : 7
% 0.22/1.41 # Initial clauses : 102
% 0.22/1.41 # Removed in clause preprocessing : 2
% 0.22/1.41 # Initial clauses in saturation : 100
% 0.22/1.41 # Processed clauses : 155
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 21
% 0.22/1.41 # ...remaining for further processing : 134
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 0
% 0.22/1.41 # Generated clauses : 206
% 0.22/1.41 # ...of the previous two non-trivial : 176
% 0.22/1.41 # Contextual simplify-reflections : 40
% 0.22/1.41 # Paramodulations : 206
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 134
% 0.22/1.41 # Positive orientable unit clauses : 14
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 4
% 0.22/1.41 # Non-unit-clauses : 116
% 0.22/1.41 # Current number of unprocessed clauses: 121
% 0.22/1.41 # ...number of literals in the above : 615
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 0
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 3459
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 1916
% 0.22/1.41 # Non-unit clause-clause subsumptions : 58
% 0.22/1.41 # Unit Clause-clause subsumption calls : 61
% 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 : 10524
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.038 s
% 0.22/1.41 # System time : 0.005 s
% 0.22/1.41 # Total time : 0.043 s
% 0.22/1.41 # Maximum resident set size: 3480 pages
%------------------------------------------------------------------------------